Design Degrees of Freedom and Mechanisms for Complexity David Reynolds J. M. Carlson.

Slides:



Advertisements
Similar presentations
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
Advertisements

CmpE 104 SOFTWARE STATISTICAL TOOLS & METHODS MEASURING & ESTIMATING SOFTWARE SIZE AND RESOURCE & SCHEDULE ESTIMATING.
The Evolution of Cooperation within the Iterated Prisoner’s dilemma on a Social Network.
School of Information University of Michigan Network resilience Lecture 20.
Evolution of Biodiversity
Self Organization: Competitive Learning
Complex Feature Recognition: A Bayesian Approach for Learning to Recognize Objects by Paul A. Viola Presented By: Emrah Ceyhan Divin Proothi Sherwin Shaidee.
Chapter 5 Probability Models Introduction –Modeling situations that involve an element of chance –Either independent or state variables is probability.
Planning under Uncertainty
Network Morphospace Andrea Avena-Koenigsberger, Joaquin Goni Ricard Sole, Olaf Sporns Tung Hoang Spring 2015.
Populations, Communities, and Species Interaction Chapter 3.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
Are Forest Fires HOT? A mostly critical look at physics, phase transitions, and universality Jean Carlson, UCSB.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Are Forest Fires HOT? Jean Carlson, UCSB. Background Much attention has been given to “complex adaptive systems” in the last decade. Popularization of.
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
KEY CONCEPT A population shares a common gene pool.
OUR Ecological Footprint …. Ch 20 Community Ecology: Species Abundance + Diversity.
The Science of Man-made systems Gábor Vattay Physics of Complex Systems Eötvös University.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
CITS4403 Computational Modelling Fractals. A fractal is a mathematical set that typically displays self-similar patterns. Fractals may be exactly the.
FLUCTATION SCALING: TAYLOR’S LAW AND BEYOND János Kertész Budapest University of Technology and Economics.
Efficient Model Selection for Support Vector Machines
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Agronomic Spatial Variability and Resolution What is it? How do we describe it? What does it imply for precision management?
Models and Algorithms for Complex Networks Power laws and generative processes.
Agronomic Spatial Variability and Resolution What is it? How do we describe it? What does it imply for precision management?
Schemata Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Why Bother with Theory? Might provide performance.
Texture. Texture is an innate property of all surfaces (clouds, trees, bricks, hair etc…). It refers to visual patterns of homogeneity and does not result.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
BIOLOGY 157: LIFE SCIENCE: AN ENVIRONMENTAL APPROACH (Communities and Succession)
The Ecosystem 2.6 Changes.
Mechanisms of Population Evolution
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
Biology Chapter 4- Population Biology
Spatial ecology I: metapopulations Bio 415/615. Questions 1. How can spatially isolated populations be ‘connected’? 2. What question does the Levins metapopulation.
So, what’s the “point” to all of this?….
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Sampling and estimation Petter Mostad
PCB 3043L - General Ecology Data Analysis.
Methods for point patterns. Methods consider first-order effects (e.g., changes in mean values [intensity] over space) or second-order effects (e.g.,
Introduction to Models Lecture 8 February 22, 2005.
Macroecological questions. What patterns exist, and how are they determined by environment vs. history? How are ecosystems structured, and how is this.
Chapter 20 Statistical Considerations Lecture Slides The McGraw-Hill Companies © 2012.
Sporadic model building for efficiency enhancement of the hierarchical BOA Genetic Programming and Evolvable Machines (2008) 9: Martin Pelikan, Kumara.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
V. Evolution by Natural Selection ▪ Biological Evolution: the process whereby earth’s life changes over time through changes in genetic characteristics.
The Living World Chapters 5, 8, 9. Ecology Individual- natural selection Population- evolution Community- interacting species Ecosystem- cycling of energy.
Giansalvo EXIN Cirrincione unit #4 Single-layer networks They directly compute linear discriminant functions using the TS without need of determining.
The Computational Nature of Language Learning and Evolution 10. Variations and Case Studies Summarized by In-Hee Lee
11.1 Genetic Variation Within Population KEY CONCEPT A population shares a common gene pool.
Self-organization in Forest Evolution J. C. Sprott Department of Physics University of Wisconsin - Madison Presented at the US-Japan Workshop on Complexity.
Topics in Bioinformatics Project 7 Kelsic ED, Zhao J, Vetsigian K, Kishony R. Counteraction of antibiotic production and degradation stabilizes microbial.
15.3 Shaping Evolutionary Theory 7(E) Analyze and evaluate the relationship of natural selection to adaptation and to the development of diversity in and.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Modeling and Simulation CS 313
Mean Shift Segmentation
POPULATION ECOLOGY.
AP Environmental Chapter 6
David Konrad Michel Pleimling 10/21/2011
Introduction to Ecology
Evolution of Biodiversity
Lecture 3 Evolution.
Pattern Selection by Dynamical Biochemical Signals
Presentation transcript:

Design Degrees of Freedom and Mechanisms for Complexity David Reynolds J. M. Carlson

Question to Answer The relationship between design and complexity –Two extreme theoretical points Differentiated by their stance regarding the role of design. 1.Theory of Self-organized criticality (SOC), edge of chaos (EOC). Complexity “emerges” in systems that are otherwise internally homogeneous and simple. Large-scale structure arises naturally and at no apparent cost through collective fluctuations in systems with generic interactions between individual agents. Structure is associated with bifurcation points and critical phase transitions. 2. Highly optimized tolerance (HOT) Complexity is associated with intricately designed or highly evolved systems. Role of robustness to uncertainties in the environment as a driving force towards increasing complexity in biological evolution and engineering design. Robustness design is the primary mechanism for complexity. This paper is based on HOT

Question to Answer To determine how the characteristics of designed systems change as the resolution of the design is varied A measure for design, design degrees of freedom, (DDOF) –Varying the number of DDOF’s to interpolate between systems with minimal design, and those that are highly designed Using the model, percolation forest fire model

Percolation forest fire (PFF) model Two-dimensional N-by-N lattice Each site is either occupied by a tree or is vacant Each contiguous set of nearest neighbor occupied sites defines a connected cluster (forest) The forest is subject to external perturbations, represented by sparks A spark hits a vacant site on the lattice nothing happens; a spark hits an occupied site it burns all the trees in the connected cluster associated with the site. Distribution of the spark, P(i, j). With probability P(i,j), the spark hits the site (i,j). In random percolation, the state of the system is fully characterized by the density . –Individual sites are independently occupied with probability  Properties of the system are determined by ensemble averages in which all configurations at density  are taken to be equally likely

Percolation forest fire model Cont’d Yield Y to be the number of trees remaining after a single spark, –  : the density before the spark –  l  : average loss due to the fire, computed over the distribution of sparks P(i, j) as well as the configurations in the ensemble Objective: optimize yield as a function of the tunable parameters, given a distribution of sparks P(i, j) DDOF’s in PFF (number of tunable design parameters) –1: random percolation; the density  –N 2 : specifically choose whether each site individually is occupied or vacant. DDOF’s   as N   Intractable as 2^(N 2 ) candidate lattices

For finite DDOF’s, the authors adopt an local incremental algorithm for increasing the density. –local optimization in configuration space –Sites are occupied one at a time, always choosing the next site to occupy in order to maximize yield for the incremental change in density –Plot a yield curve, Y(  ), which has a maximum at some  =  max. Beyond this value there is a sharp drop in yield. In the thermodynamic limit,  max approaches unity

Between, 1 and N 2, we consider intermediate numbers of DDOF’s. –Interpolate between 1 and infinite DDOF’s The approach –subdividing the N-by-N lattice into equal square cells –M-by-M lattice, with each cell containing n 2 = (N/M) 2 sites –Individual cells are characterized by a density  IJ where (I, J) defines the cell coordinate on the M-by-M design lattice.

NUMERICAL RESULTS M = 1: single DDOF, optimization of the yield leads to criticality  c N finite, M small : as N gets large, the subregion densities converge to either unit density or a density that approaches the critical density  c.  c -  N , M small. –brute force calculation of the globally optimal configuration –design lattice breaking up into compact domains of unit density, separated by uncrossable barriers of density,  c -  N , M large –cellular patterns similar to HOT patterns Spark distribution, exponential

Criticality- the optimal solution for a single DDOF M = 1. The state of the system is characterized by the density  The choice of P(x,y) is is irrelevant for large N. The model exhibits a continuous phase transition at density –  c  In the limit N , –for  <  c, no infinite cluster –for  <  c, an infinite cluster exists somewhere on the lattice with probability one –for  =  c, the probability of an infinite cluster lies between zero and unity and depends on the shape of the lattice. For a square-shaped, ½.

Criticality Cont’d At low densities, lattice sparse, at low densities there is on average zero macroscopic loss associated with a fire ignited by a single spark. At densities greater than or equal to the critical density, there is an infinite cluster and the probability that any given site is on the infinite cluster defines the percolation probability P  (  ), –At  c, P  (  ) = 0, the infinite cluster (if exists) is fractal

Explicit optimization on finite lattices with few DDOF’s M > 1, but small. Determine the optimal yield configuration as a function of the M 2 cell densities Fix M and increase N. Something interesting: –each of the densities  IJ either converges rapidly to unity or more gradually towards  c M = 2, N = 64. –Yield Y(  11,  12,  21,  22 )

 11 depends on the system size.

Sample solutions for different distributions of sparks

Global optimization for an infinite underlying lattice and few DDOF’s N: infinite, M small Cells: density is either near critical or unit Calculate the yield.

Propagation –Cells at  c -  experience no macroscopic loss in density in a fire, and fires do not propagate macroscopic distances across the cell. –Fires do not propagate from left to right or from top to bottom across cells at density  c - . The  c -  cells thus act effectively as fire breaks for vertical and horizontal propagation. –Fires will propagate between adjacent edges of cells with density  c -  This implies a corner connection between cells at unity density is effectively the same as a shared edge. –Cells at unit density experience total loss when a spark hits the cell cell, or when fires propagate into the cell from nearest (edge connected) or next nearest (corner connected) neighbor cells at unit density

Local optimization for an infinite underlying lattice and many DDOF’s

Summary Degree of Design and Complexity? –Higher Degree of Design -> More complex system, specialized but fragile to rare events.

Mutation, specialization, and hypersensitivity in highly optimized tolerance Tong Zhou, J. M. Carlson, and John Doyle

Using the Percolation forest fire (PFF) model to argue with self- organizes to a critical point (SOC) and ‘‘edge of chaos’’ (EOC) A key signature of a HOT system is that it is simultaneously “robust, yet fragile” simultaneously

Distribution of Spark: exponential Genotype: layout of the lattice Phenotype: {f n, l n } –l n : event sizes –f n : the corresponding probabilities Two types to evolve. –Tortoises: Y  =  -  l ,  l  average loss –Hares: Y 1 =  - l n l n : stochastic loss evolve rapidly, over-specialize for common disturbances, win in the short term, but are vulnerable to extinction in rare events

The experiment begin with 1,000 randomly generated lattices with N = 16 divided equally between the tortoise and hare types. Each subsequent generation consists of two offspring from each parent lattice, each with a finite probability of mutation. Each resulting generation of offspring is then subject to natural selection based on fitness Y. An upper bound of 1,000 on the total population S Competition based on fitness occurs among all of the lattices for this limited space in the community. Any lattice with Y < Yd is considered ‘‘dead’’ and automatically discarded, along with the lowest performers until the total size S of the community is S <=1,000.

Observations of experiment Even at the relatively early stages of evolution the tortoises and hares begin to develop barrier patterns that are characteristic of their respective types. The tortoises sacrifice density to retain a higher concentration of barriers in regions that have less frequent sparks. If the tortoises win this initial competition, they persist forever at the maximum population of 1,000. –They are optimized for “long-term” If the hares survive, evolve more rapidly and to higher densities –they do not sacrifice density to protect against rare events

The second experiment Including niches –the niches retain the top 50 of each type

Observations of the Second Experiment For long periods when no rare events happen, the hares have higher fitness and thus dominate. Nearly all of the available 1,000 spaces belong to the hares, while the tortoise population is sustained at the minimum of 50. -The hares dominate! Rare event occurs, –The hares quickly. Near extinction. Evolution cycle

Interpretations Microevolutionary Features –how intrinsic robust design tradeoffs interact with and constrain natural selection to generate highly ordered structure from randomness. –creating habitats with different spark distributions P(i, j) Lattices in a habitat with skewed distributions become ‘‘specialists’’ and evolve like the hares, Lattices in a habitat with a spatially uniform distribution of sparks become ‘‘generalists’’ by developing a roughly uniform grid of barriers, which is optimal in their habitat. –never extinction but suboptimal with skewed distributions –Even though different genotypes, different layouts but essentially same phyenotypes (the pattern of the barriers) Macroevolutionary Consequences –Initiation of large extinction events is typically associated with rare or anomalous external causes, such as meteoroid impacts and large-scale geological change, whereas more frequent, smaller events are typically associated with a mixture of competition between species, as well as more commonplace variability in the habitat and other environmental conditions