Related papers: Phase transition without global ordering in a hier…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
We propose a general model of unweighted and undirected networks having the scale-free property and fractal nature. Unlike the existing models of fractal scale-free networks (FSFNs), the present model can systematically and widely change…
Phase transition of the Ising model is investigated on a planar lattice that has a fractal structure. On the lattice, the number of bonds that cross the border of a finite area is doubled when the linear size of the area is extended by a…
Percolation on complex networks is used both as a model for dynamics on networks, such as network robustness or epidemic spreading, and as a benchmark for our models of networks, where our ability to predict percolation measures our ability…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
A method to treat a N-component percolation model as effective one component model is presented by introducing a scaled control variable $p_{+}$. In Monte Carlo simulations on $16^{3}$, $32^{3}$, $64^{3}$ and $128^{3}$ simple cubic lattices…
We consider a large class of spatially-embedded random graphs that includes among others long-range percolation, continuum scale-free percolation and the age-dependent random connection model. We assume that the model is supercritical:…
We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all…
The random-cluster model is a dependent percolation model that has applications in the study of Ising and Potts models. In this paper, several new results are obtained for the random-cluster model on nonamenable graphs with cluster…
Networks are ubiquitous in diverse real-world systems. Many empirical networks grow as the number of nodes increases with time. Percolation transitions in growing random networks can be of infinite order. However, when the growth of large…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
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…
We present an analysis of the classical contact process on scale-free networks. A mean-field study, both for finite and infinite network sizes, yields an absorbing-state phase transition at a finite critical value of the control parameter,…
We study first- and second-order phase transitions of ferromagnetic lattice models on scale-free networks, with a degree exponent $\gamma$. Using the example of the $q$-state Potts model we derive a general self-consistency relation within…
We investigate analytically and numerically the critical line in undirected random Boolean networks with arbitrary degree distributions, including scale-free topology of connections $P(k)\sim k^{-\gamma}$. We show that in infinite…
Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that…
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
A road map to understand the relation between the onset of the superconducting state with the particular optimum heterogeneity in granular superconductors is to study a Random Tranverse Ising Model on complex networks with a scale-free…
We consider a network, bonds of which are being sequentially removed; that is done at random, but conditioned on the system remaining connected (Self-Repairing Bond Percolation SRBP). This model is the simplest representative of a class of…