10 research outputs found

    The dynamics of proving uncolourability of large random graphs I. Symmetric Colouring Heuristic

    Full text link
    We study the dynamics of a backtracking procedure capable of proving uncolourability of graphs, and calculate its average running time T for sparse random graphs, as a function of the average degree c and the number of vertices N. The analysis is carried out by mapping the history of the search process onto an out-of-equilibrium (multi-dimensional) surface growth problem. The growth exponent of the average running time is quantitatively predicted, in agreement with simulations.Comment: 5 figure

    Optimization hardness as transient chaos in an analog approach to constraint satisfaction

    Full text link
    Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for k3k\geq 3) implies efficient solutions to a large number of hard optimization problems [2,3]. Here we propose a mapping of k-SAT into a deterministic continuous-time dynamical system with a unique correspondence between its attractors and the k-SAT solution clusters. We show that beyond a constraint density threshold, the analog trajectories become transiently chaotic [4-7], and the boundaries between the basins of attraction [8] of the solution clusters become fractal [7-9], signaling the appearance of optimization hardness [10]. Analytical arguments and simulations indicate that the system always finds solutions for satisfiable formulae even in the frozen regimes of random 3-SAT [11] and of locked occupation problems [12] (considered among the hardest algorithmic benchmarks); a property partly due to the system's hyperbolic [4,13] character. The system finds solutions in polynomial continuous-time, however, at the expense of exponential fluctuations in its energy function.Comment: 27 pages, 14 figure

    Rapid Mixing for Lattice Colorings with Fewer Colors

    Full text link
    We provide an optimally mixing Markov chain for 6-colorings of the square lattice on rectangular regions with free, fixed, or toroidal boundary conditions. This implies that the uniform distribution on the set of such colorings has strong spatial mixing, so that the 6-state Potts antiferromagnet has a finite correlation length and a unique Gibbs measure at zero temperature. Four and five are now the only remaining values of q for which it is not known whether there exists a rapidly mixing Markov chain for q-colorings of the square lattice.Comment: Appeared in Proc. LATIN 2004, to appear in JSTA

    Bicoloring Random Hypergraphs

    Full text link
    We study the problem of bicoloring random hypergraphs, both numerically and analytically. We apply the zero-temperature cavity method to find analytical results for the phase transitions (dynamic and static) in the 1RSB approximation. These points appear to be in agreement with the results of the numerical algorithm. In the second part, we implement and test the Survey Propagation algorithm for specific bicoloring instances in the so called HARD-SAT phase.Comment: 14 pages, 10 figure

    Emergence and persistence of diversity in complex networks

    No full text
    Complex networks are employed as a mathematical description of complex systems in many different fields, ranging from biology to sociology, economy and ecology. Dynamical processes in these systems often display phase transitions, where the dynamics of the system changes qualitatively. In combination with these phase transitions certain components of the system might irretrievably go extinct. In this case, we talk about absorbing transitions. Developing mathematical tools, which allow for an analysis and prediction of the observed phase transitions is crucial for the investigation of complex networks. In this thesis, we investigate absorbing transitions in dynamical networks, where a certain amount of diversity is lost. In some real-world examples, e.g. in the evolution of human societies or of ecological systems, it is desirable to maintain a high degree of diversity, whereas in others, e.g. in epidemic spreading, the diversity of diseases is worthwhile to confine. An understanding of the underlying mechanisms for emergence and persistence of diversity in complex systems is therefore essential. Within the scope of two different network models, we develop an analytical approach, which can be used to estimate the prerequisites for diversity. In the first part, we study a model for opinion formation in human societies. In this model, regimes of low diversity and regimes of high diversity are separated by a fragmentation transition, where the network breaks into disconnected components, corresponding to different opinions. We propose an approach for the estimation of the fragmentation point. The approach is based on a linear stability analysis of the fragmented state close to the phase transition and yields much more accurate results compared to conventional methods. In the second part, we study a model for the formation of complex food webs. We calculate and analyze coexistence conditions for several types of species in ecological communities. To this aim, we employ an approach which involves an iterative stability analysis of the equilibrium with respect to the arrival of a new species. The proposed formalism allows for a direct calculation of coexistence ranges and thus facilitates a systematic analysis of persistence conditions for food webs. In summary, we present a general mathematical framework for the calculation of absorbing phase transitions in complex networks, which is based on concepts from percolation theory. While the specific implementation of the formalism differs from model to model, the basic principle remains applicable to a wide range of different models

    Recent advances and open challenges in percolation

    No full text
    corecore