Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the distribution of connected components. We determine the size of the percolation cluster above the percolation threshold. The conditional degree distribution on...

As the aspect ratio of a unit (here, a stiff high-aspect-ratio rod) increases, the tendency increases for ensembles of these units to form hierarchical structures on scales quite removed from that of the single unit (particles). This is due in large part to geometrical packing considerations (based on excluded volume analysis) arising from the non-spherical shape. Nematic ordering of rod ensemb...

A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. For many real world networks, the mechanism of preferential attachment plays a significant role in the formation of heterogeneous structures, but the network percolation in evolution process with preferential attachment has not...

Using a histogram Monte Carlo simulation method ~HMCSM!, Hu, Lin, and Chen found that bond and site percolation models on planar lattices have universal finite-size scaling functions for the existence probability Ep , the percolation probability P , and the probability Wn for the appearance of n percolating clusters in these models. In this paper we extend above study to percolation on three-di...

Multiplex networks describe a large variety of complex systems, including infrastructures, transportation networks, and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to characterize the mutually connected giant component in these networks. Here we provide a message passing theory for characterizing the percolation transit...

Consider a Poisson process X in Rd with density 1. We connect each point of X to its k nearest neighbors by undirected edges. The number k is the parameter in this model. We show that, for k = 1, no percolation occurs in any dimension, while, for k = 2, percolation occurs when the dimension is sufficiently large. We also show that if percolation occurs, then there is exactly one infinite cluste...

We investigate site percolation in a hierarchical scale-free network known as the Dorogovtsev-Goltsev-Mendes network. We use the generating function method to show that the percolation threshold is 1, i.e., the system is not in the percolating phase when the occupation probability is less than 1. The present result is contrasted to bond percolation in the same network of which the percolation t...

We show that symmetry, represented by a graph’s automorphism group, can be used to greatly reduce the computational work for the substitution method. This allows application of the substitution method over larger regions of the problem lattices, resulting in tighter bounds on the percolation threshold pc. We demonstrate the symmetry reduction technique using bond percolation on the (3, 12) latt...

Rigorous bounds for the bond percolation critical probability are determined for three Archimedean lattices: .7385 < pc((3, 12 ) bond) < .7449, .6430 < pc((4, 6, 12) bond) < .7376, .6281 < pc((4, 8 ) bond) < .7201. Consequently, the bond percolation critical probability of the (3, 12) lattice is strictly larger than those of the other ten Archimedean lattices. Thus, the (3, 12) bond percolation...

Percolation theory is of interest in problems of phase transitions in condensed matter physics, and in biology and chemistry. More recently, concepts of percolation theory have been invoked in studies of color deconfinement at high temperatures in Quantum Chromodynamics. In the present paper we briefly review the basic concept of percolation theory, exemplify its application to the Ising model,...