1,037 research outputs found
Dynamical properties of a gene-protein model
A major limitation of the classical random Boolean network model of gene regulatory networks is its synchronous updating, which implies that all the proteins decay at the same rate. Here a model is discussed, where the network is composed of two different sets of nodes, labelled G and P with reference to âgenesâ and âproteinsâ. Each gene corresponds to a protein (the one it codes for), while several proteins can simultaneously affect the expression of a gene. Both kinds of nodes take Boolean values. If we look at the genes only, it is like adding some memory terms, so the new state of the gene subnetwork network does no longer depend upon its previous state only. In general, these terms tend to make the dynamics of the network more ordered than that of the corresponding memoryless network. The analysis is focused here mostly on dynamical critical states. It has been shown elsewhere that the usual way of computing the Derrida parameter, starting from purely random initial conditions, can be misleading in strongly non-ergodic systems. So here the effects of perturbations on both genesâ and proteinsâ levels is analysed, using both the canonical Derrida procedure and an âextendedâ one. The results are discussed. Moreover, the stability of attractors is also analysed, measured by counting the fraction of perturbations where the system eventually falls back onto the initial attractor
Emergence of structure in mouse embryos: Structural Entropy morphometry applied to digital models of embryonic anatomy
We apply an information-theoretic measure to anatomical models of the Edinburgh Mouse Atlas Project. Our goal is to quantify the anatomical complexity of the embryo and to understand how this quantity changes as the organism develops through time. Our measure, Structural Entropy, takes into account the geometrical character of the intermingling of tissue types in the embryo. It does this by a mathematical process that effectively imagines a point-like explorer that starts at an arbitrary place in the 3D structure of the embryo and takes a random path through the embryo, recording the sequence of tissues through which it passes. Consideration of a large number of such paths yields a probability distribution of paths making connections between specific tissue types, and Structural Entropy is calculated from this (mathematical details are given in the main text). We find that Structural Entropy generally decreases (order increases) almost linearly throughout developmental time (4â18Â days). There is one `blipâ of increased Structural Entropy across days 7â8: this corresponds to gastrulation. Our results highlight the potential for mathematical techniques to provide insight into the development of anatomical structure, and also the need for further sources of accurate 3D anatomical data to support analyses of this kind
On RAF Sets and Autocatalytic Cycles in Random Reaction Networks
The emergence of autocatalytic sets of molecules seems to have played an
important role in the origin of life context. Although the possibility to
reproduce this emergence in laboratory has received considerable attention,
this is still far from being achieved. In order to unravel some key properties
enabling the emergence of structures potentially able to sustain their own
existence and growth, in this work we investigate the probability to observe
them in ensembles of random catalytic reaction networks characterized by
different structural properties. From the point of view of network topology, an
autocatalytic set have been defined either in term of strongly connected
components (SCCs) or as reflexively autocatalytic and food-generated sets
(RAFs). We observe that the average level of catalysis differently affects the
probability to observe a SCC or a RAF, highlighting the existence of a region
where the former can be observed, whereas the latter cannot. This parameter
also affects the composition of the RAF, which can be further characterized
into linear structures, autocatalysis or SCCs. Interestingly, we show that the
different network topology (uniform as opposed to power-law catalysis systems)
does not have a significantly divergent impact on SCCs and RAFs appearance,
whereas the proportion between cleavages and condensations seems instead to
play a role. A major factor that limits the probability of RAF appearance and
that may explain some of the difficulties encountered in laboratory seems to be
the presence of molecules which can accumulate without being substrate or
catalyst of any reaction.Comment: pp 113-12
Asynchronous simulation of Boolean networks by monotone Boolean networks
International audienceWe prove that the fully asynchronous dynamics of a Boolean network f : {0, 1}^n â {0, 1}^n without negative loop can be simulated, in a very specific way, by a monotone Boolean network with 2n components. We then use this result to prove that, for every even n, there exists a monotone Boolean network f : {0, 1}^n â {0, 1}^n , an initial configuration x and a fixed point y of f such that: (i) y can be reached from x with a fully asynchronous updating strategy, and (ii) all such strategies contains at least 2^{n/2} updates. This contrasts with the following known property: if f : {0, 1}^n â {0, 1}^n is monotone, then, for every initial configuration x, there exists a fixed point y such that y can be reached from x with a fully asynchronous strategy that contains at most n updates
Dynamics on expanding spaces: modeling the emergence of novelties
Novelties are part of our daily lives. We constantly adopt new technologies,
conceive new ideas, meet new people, experiment with new situations.
Occasionally, we as individuals, in a complicated cognitive and sometimes
fortuitous process, come up with something that is not only new to us, but to
our entire society so that what is a personal novelty can turn into an
innovation at a global level. Innovations occur throughout social, biological
and technological systems and, though we perceive them as a very natural
ingredient of our human experience, little is known about the processes
determining their emergence. Still the statistical occurrence of innovations
shows striking regularities that represent a starting point to get a deeper
insight in the whole phenomenology. This paper represents a small step in that
direction, focusing on reviewing the scientific attempts to effectively model
the emergence of the new and its regularities, with an emphasis on more recent
contributions: from the plain Simon's model tracing back to the 1950s, to the
newest model of Polya's urn with triggering of one novelty by another. What
seems to be key in the successful modelling schemes proposed so far is the idea
of looking at evolution as a path in a complex space, physical, conceptual,
biological, technological, whose structure and topology get continuously
reshaped and expanded by the occurrence of the new. Mathematically it is very
interesting to look at the consequences of the interplay between the "actual"
and the "possible" and this is the aim of this short review.Comment: 25 pages, 10 figure
Boolean Dynamics with Random Couplings
This paper reviews a class of generic dissipative dynamical systems called
N-K models. In these models, the dynamics of N elements, defined as Boolean
variables, develop step by step, clocked by a discrete time variable. Each of
the N Boolean elements at a given time is given a value which depends upon K
elements in the previous time step.
We review the work of many authors on the behavior of the models, looking
particularly at the structure and lengths of their cycles, the sizes of their
basins of attraction, and the flow of information through the systems. In the
limit of infinite N, there is a phase transition between a chaotic and an
ordered phase, with a critical phase in between.
We argue that the behavior of this system depends significantly on the
topology of the network connections. If the elements are placed upon a lattice
with dimension d, the system shows correlations related to the standard
percolation or directed percolation phase transition on such a lattice. On the
other hand, a very different behavior is seen in the Kauffman net in which all
spins are equally likely to be coupled to a given spin. In this situation,
coupling loops are mostly suppressed, and the behavior of the system is much
more like that of a mean field theory.
We also describe possible applications of the models to, for example, genetic
networks, cell differentiation, evolution, democracy in social systems and
neural networks.Comment: 69 pages, 16 figures, Submitted to Springer Applied Mathematical
Sciences Serie
Deconstructing the Big Valley Search Space Hypothesis
The big valley hypothesis suggests that, in combinatorial optimisation, local optima of good quality are clustered and surround the global optimum. We show here that the idea of a single valley does not always hold. Instead the big valley seems to de-construct into several valleys, also called âfunnelsâ in theoretical chemistry. We use the local optima networks model and propose an effective procedure for extracting the network data. We conduct a detailed study on four selected TSP instances of moderate size and observe that the big valley decomposes into a number of sub-valleys of different sizes and fitness distributions. Sometimes the global optimum is located in the largest valley, which suggests an easy to search landscape, but this is not generally the case. The global optimum might be located in a small valley, which offers a clear and visual explanation of the increased search difficulty in these cases. Our study opens up new possibilities for analysing and visualising combinatorial landscapes as complex networks
Bridging Elementary Landscapes and a Geometric Theory of Evolutionary Algorithms: First Steps
This is the author accepted manuscript. The final version is available from Springer via the DOI in this record.Paper to be presented at the Fifteenth International Conference on Parallel Problem Solving from Nature (PPSN XV), Coimbra, Portugal on 8-12 September.Based on a geometric theory of evolutionary algorithms, it was shown that all evolutionary algorithms equipped with a geometric crossover and no mutation operator do the same kind of convex search across representations, and that they are well matched with generalised forms of concave fitness landscapes for which they provably find the optimum in polynomial time. Analysing the landscape structure is essential to understand the relationship between problems and evolutionary algorithms. This paper continues such investigations by considering the following challenge: develop an analytical method to recognise that the fitness landscape for a given problem provably belongs to a class of concave fitness landscapes. Elementary landscapes theory provides analytic algebraic means to study the landscapes structure. This work begins linking both theories to better understand how such method could be devised using elementary landscapes. Examples on well known One Max, Leading Ones, Not-All-Equal Satisfiability and Weight Partitioning problems illustrate the fundamental concepts supporting this approach
- âŠ