Search

We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or percolating cluster, i.e. the set of mutually connected nodes whose size scales linearly with the size of the system. We evaluate these both for large finite single instances, and for synthetic networks in the configuration model class in the thermodynamic limit. For the latter, we consider both Erdos-Renyi and scale free networks as examples of networks with narrow and broad degree distributions respectively. For real-world networks we use an undirected version of a Gnutella peer-to-peer file-sharing network with $N=62,568$ nodes as an example. We derive the theory for multiple instances of both uncorrelated and correlated percolation processes. For the uncorrelated case, we also obtain a closed form approximation for the large mean degree limit of Erdos-Renyi networks., Comment: 14 pages, 6 multipart figures

We consider a variation of the prototype combinatorial-optimisation problem known as graph-colouring. Our optimisation goal is to colour the vertices of a graph with a fixed number of colours, in a way to maximise the number of different colours present in the set of nearest neighbours of each given vertex. This problem, which we pictorially call "palette-colouring", has been recently addressed as a basic example of problem arising in the context of distributed data storage. Even though it has not been proved to be NP complete, random search algorithms find the problem hard to solve. Heuristics based on a naive belief propagation algorithm are observed to work quite well in certain conditions. In this paper, we build upon the mentioned result, working out the correct belief propagation algorithm, which needs to take into account the many-body nature of the constraints present in this problem. This method improves the naive belief propagation approach, at the cost of increased computational effort. We also investigate the emergence of a satisfiable to unsatisfiable "phase transition" as a function of the vertex mean degree, for different ensembles of sparse random graphs in the large size ("thermodynamic") limit., Comment: 22 pages, 7 figures

We introduce models of heterogeneous systems with finite connectivity defined on random graphs to capture finite-coordination effects on the low-temperature behavior of finite dimensional systems. Our models use a description in terms of small deviations of particle coordinates from a set of reference positions, particularly appropriate for the description of low-temperature phenomena. A Born-von-Karman type expansion with random coefficients is used to model effects of frozen heterogeneities. The key quantity appearing in the theoretical description is a full distribution of effective single-site potentials which needs to be determined self-consistently. If microscopic interactions are harmonic, the effective single-site potentials turn out to be harmonic as well, and the distribution of these single-site potentials is equivalent to a distribution of localization lengths used earlier in the description of chemical gels. For structural glasses characterized by frustration and anharmonicities in the microscopic interactions, the distribution of single-site potentials involves anharmonicities of all orders, and both single-well and double well potentials are observed, the latter with a broad spectrum of barrier heights. The appearance of glassy phases at low temperatures is marked by the appearance of asymmetries in the distribution of single-site potentials, as previously observed for fully connected systems. Double-well potentials with a broad spectrum of barrier heights and asymmetries would give rise to the well known universal glassy low temperature anomalies when quantum effects are taken into account., Comment: 35 pages, 8 Figures

We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any vertex. Two efficient algorithms, belief propagation and Walksat are adapted to carry out this task. We present experimental results based on two types of random graphs for different system sizes and identify the critical value of the connectivity for the algorithms to find a perfect solution. The problem and the suggested algorithms have practical relevance since various applications, such as distributed storage, can be mapped onto this problem., Comment: 10 pages, 10 figures

We obtain exact expressions for the asymptotic behaviour of the average probability of the block decoding error for ensembles of regular low density parity check error correcting codes, by employing diagrammatic techniques. Furthermore, we show how imposing simple constraints on the code ensemble (that can be practically implemented in linear time), allows one to suppress the error probability for codes with more than 2 checks per bit, to an arbitrarily low power of $N$. As such we provide a practical route to a (sub-optimal){\em expurgated} ensemble., Comment: 15 pages 13 figures

The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss the merits and shortcomings of the various methods, and interpret the results obtained. We present an exact analytical expression for the 2-coloring problem as well as general replica symmetric approximated solutions for the thermodynamics of the graph coloring problem with p colors and K-body edges., Comment: 17 pages, 9 figures

We determine the critical noise level for decoding low density parity check error correcting codes based on the magnetization enumerator ($\cM$), rather than on the weight enumerator ($\cW$) employed in the information theory literature. The interpretation of our method is appealingly simple, and the relation between the different decoding schemes such as typical pairs decoding, MAP, and finite temperature decoding (MPM) becomes clear. In addition, our analysis provides an explanation for the difference in performance between MN and Gallager codes. Our results are more optimistic than those derived via the methods of information theory and are in excellent agreement with recent results from another statistical physics approach., Comment: 9 pages, 5 figures

We propose a general scheme in which disordered systems are allowed to sacrifice energy equi-partitioning and separate into a hierarchy of ergodic sub-systems (clusters) with different characteristic time-scales and temperatures. The details of the break-up follow from the requirement of stationarity of the entropy of the slower cluster, at every level in the hierarchy. We apply our ideas to the Sherrington-Kirkpatrick model, and show how the Parisi solution can be {\it derived} quantitatively from plausible physical principles. Our approach gives new insight into the physics behind Parisi's solution and its relations with other theories, numerical experiments, and short range models., Comment: 7 pages 5 figures

We propose a general quantitative scheme in which systems are given the freedom to sacrifice energy equi-partitioning on the relevant time-scales of observation, and have phase transitions by separating autonomously into ergodic sub-systems (clusters) with different characteristic time-scales and temperatures. The details of the break-up follow uniquely from the requirement of zero entropy for the slower cluster. Complex systems, such as the Sherrington-Kirkpatrick model, are found to minimise their free energy by spontaneously decomposing into a hierarchy of ergodically equilibrating degrees of freedom at different (effective) temperatures. This leads exactly and uniquely to Parisi's replica symmetry breaking scheme. Our approach, which is somewhat akin to an earlier one by Sompolinsky, gives new insight into the physical interpretation of the Parisi scheme and its relations with other approaches, numerical experiments, and short range models. Furthermore, our approach shows that the Parisi scheme can be derived quantitatively and uniquely from plausible physical principles., Comment: 6 pages, 3 figures, proceedings of international conference on "Disordered And Complex Systems", 10-14 July 2000 King's College London

A model of noise reduction (NR) for signal processing is introduced. Each noise source puts a symmetric constraint on the space of the signal vector within a tolerable overlap. When the number of noise sources increases, sequences of transitions take place, causing the solution space to vanish. We found that the transition from an extended solution space to a shrunk space is retarded because of the symmetry of the constraints, in contrast to the analogous problem of pattern storage. For low tolerance, the solution space vanishes by volume reduction, whereas for high tolerance, the vanishing becomes more and more like percolation. The model is studied in the replica symmetric, first step and full replica symmetry breaking schemes., Comment: 4 pages, 2 figures

A lattice model of a hetero-polymer with random hydrophilic-hydrophobic charges interacting with the solvent is introduced, whose continnuum counterpart has been proposed by T. Garel, L. Leibler and H. Orland {J. Phys. II France 4, 2139 (1994)]. The transfer matrix technique is used to study various constrained annealed systems which approximate at various degrees of accuracy the original quenched model. For highly hydrophobic chains an ordinary $\theta$-point transition is found from a high temperature swollen phase to a low temperature compact phase. Depending on the type of constrained averages, at very low temperatures a swollen phase or a coexistence between compact and swollen phases are found. The results are carefully compared with the corresponding ones obtained in the continuum limit, and various improvements in the original calculations are discussed., Comment: 13 pages, 8 figures; revised version with minor changes, accepted for publication in European Physical Journal B

We propose a novel method for the determination of the effective interaction potential between the amino acids of a protein. The strategy is based on the combination of a new optimization procedure and a geometrical argument, which also uncovers the shortcomings of any optimization procedure. The strategy can be applied on any data set of native structures such as those available from the Protein Data Bank (PDB). In this work, however, we explain and test our approach on simple lattice models, where the true interactions are known a priori. Excellent agreement is obtained between the extracted and the true potentials even for modest numbers of protein structures in the PDB. Comparisons with other methods are also discussed., Comment: 24 pages, 4 figures