Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe order-chaos phase transition for a general class of complex Boolean networks
103
0
0.0
(
0
)
Added by
Shirshendu Chatterjee
Publication date
2013
fields
Physics
and research's language is
English
Authors
Shirshendu Chatterjee
Ask ChatGPT about the research
No Arabic abstract
We consider a model for heterogeneous gene regulatory networks that is a generalization of the model proposed by Chatterjee and Durrett (2011) as an annealed approximation of Kauffmanns (1969) random Boolean networks. In this model, genes are represented by the nodes of a random directed graph on n vertices with specified in-degree distribution (resp. out-degree distribution or joint distribution of in-degree and out-degree), and the expression bias (the expected fraction of 1s in the Boolean functions) p is same for all nodes. Following a standard practice in the physics literature, we use a discrete-time threshold contact process with parameter q=2p(1-p) (in which a vertex with at least one occupied input at time t will be occupied at time t+1 with probability q, and vacant otherwise) on the above random graph to approximate the dynamics of the Boolean network. We show that there is a parameter r (which can be written explicitly in terms of first few moments of the degree distribution) such that, with probability tending to 1 as n goes to infinity, if 2p(1-p)r>1, then starting from all occupied sites the threshold contact process maintains a positive ({it quasi-stationary}) density of occupied sites for time which is exponential in n, whereas if 2p(1-p)r<1, then the persistence time of the threshold contact process is at most logarithmic in n. These two phases correspond to the chaotic and ordered behavior of the gene networks.
rate research
Read More
We study the competition interface between two growing clusters in a growth model associated to last-passage percolation. When the initial unoccupied set is approximately a cone, we show that this interface has an asymptotic direction with probability 1. The behavior of this direction depends on the angle $theta$ of the cone: for $thetageq180^{circ}$, the direction is deterministic, while for $theta<180^{circ}$, it is random, and its distribution can be given explicitly in certain cases. We also obtain partial results on the fluctuations of the interface around its asymptotic direction. The evolution of the competition interface in the growth model can be mapped onto the path of a second-class particle in the totally asymmetric simple exclusion process; from the existence of the limiting direction for the interface, we obtain a new and rather natural proof of the strong law of large numbers (with perhaps a random limit) for the position of the second-class particle at large times.
Transient chaos is an ubiquitous phenomenon characterizing the dynamics of phase space trajectories evolving towards a steady state attractor in physical systems as diverse as fluids, chemical reactions and condensed matter systems. Here we show that transient chaos also appears in the dynamics of certain efficient algorithms searching for solutions of constraint satisfaction problems that include scheduling, circuit design, routing, database problems or even Sudoku. In particular, we present a study of the emergence of hardness in Boolean satisfiability ($k$-SAT), a canonical class of constraint satisfaction problems, by using an analog deterministic algorithm based on a system of ordinary differential equations. Problem hardness is defined through the escape rate $kappa$, an invariant measure of transient chaos of the dynamical system corresponding to the analog algorithm, and it expresses the rate at which the trajectory approaches a solution.We show that for a given density of constraints and fixed number of Boolean variables $N$, the hardness of formulas in random $k$-SAT ensembles has a wide variation, approximable by a lognormal distribution. We also show that when increasing the density of constraints $alpha$, hardness appears through a second-order phase transition at $alpha_{chi}$ in the random 3-SAT ensemble where dynamical trajectories become transiently chaotic. A similar behavior is found in 4-SAT as well, however, such transition does not occur for 2-SAT. This behavior also implies a novel type of transient chaos in which the escape rate has an exponential-algebraic dependence on the critical parameter $kappa sim N^{B|alpha - alpha_{chi}|^{1-gamma}}$ with $0< gamma < 1$. We demonstrate that the transition is generated by the appearance of metastable basins in the solution space as the density of constraints $alpha$ is increased.
We give a rigorous proof of the fact that a phase transition discovered by Douglas and Kazakov in 1993 in the context of two-dimensional gauge theories occurs. This phase transition can be formulated in terms of the Brownian bridge on the unitary group U(N) when N tends to infinity. We explain how it can be understood by considering the asymptotic behaviour of the eigenvalues of the unitary Brownian bridge, and how it can be technically approached by means of Fourier analysis on the unitary group. Moreover, we advertise some more or less classical methods for solving certain minimisation problems which play a fundamental role in the study of the phase transition.
We consider a class of continuous-time stochastic growth models on $d$-dimensional lattice with non-negative real numbers as possible values per site. The class contains examples such as binary contact path process and potlatch process. We show the equivalence between the slow population growth and localization property that the time integral of the replica overlap diverges. We also prove, under reasonable assumptions, a localization property in a stronger form that the spatial distribution of the population does not decay uniformly in space.
We study the evolution of the probability density of ensembles of iterates of the logistic map that advance towards and finally remain at attractors of representative dynamical regimes. We consider the mirror families of superstable attractors along the period-doubling cascade, and of chaotic-band attractors along the inverse band-splitting cascade. We examine also their common aperiodic accumulation point. The iteration time progress of the densities of trajectories is determined via the action of the Frobenius-Perron (FP) operator. As a difference with the study of individual orbits, the analysis of ensembles of positions offers a viewpoint from which the nonlinear dynamical features of this iconic model can be better characterized in statistical-mechanical terms. The scaling of the densities along the considered families of attractors conforms to a renormalization-group (RG) structure, while their entropies are seen to attain extrema at the fixed points of the RG flows. Additionally, this entropy as a function of the map control parameter displays the characteristic features of an equation of state of a thermal system undergoing a second-order phase transition. We discuss our results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
