Evolution of scale-free random graphs: Potts model formulation

DOI10.1016/J.NUCLPHYSB.2004.06.029MaRDI QIDQ874210zbMATH OpenOpenAlexFDO

Authors K.-I. Goh, D. Kim, Deok-Sun Lee, Byungnam Kahng

Publication date 5 April 2007

Published in Nuclear Physics B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0404126

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We study the bond percolation problem in random graphs of $N$ weighted vertices, where each vertex $i$ has a prescribed weight $P_i$ and an edge can connect vertices $i$ and $j$ with rate $P_i{P}_j$. The problem is solved by the $qo1$ limit of the $q$-state Potts model with inhomogeneous interactions for all pairs of spins. We apply this approach to the static model having $P_{i}propto{i}^{-mu}(0<mu<1)$ so that the resulting graph is scale-free with the degree exponent $lambda=1+1/mu$. The number of loops as well as the giant cluster size and the mean cluster size are obtained in the thermodynamic limit as a function of the edge density, and their associated critical exponents are also obtained. Finite-size scaling behaviors are derived using the largest cluster size in the critical regime, which is calculated from the cluster size distribution, and checked against numerical simulation results. We find that the process of forming the giant cluster is qualitatively different between the cases of $lambda>3$ and $2<lambda<3$. While for the former, the giant cluster forms abruptly at the percolation transition, for the latter, however, the formation of the giant cluster is gradual and the mean cluster size for finite $N$ shows double peaks.

Recommendations

• The Evolution of Random Graphs
• scientific article; zbMATH DE number 3168330
• An evolving random network and its asymptotic structure
• scientific article; zbMATH DE number 1792101
• The phase transition in the evolution of random digraphs
• Evolution of random graph processes with degree constraints
• Evolution of a modified binomial random graph by agglomeration
• Model for the evolution of the degree distributions of the vertices of social network graphs
• scientific article; zbMATH DE number 3902655
• scientific article; zbMATH DE number 3173143

Cites work

• scientific article; zbMATH DE number 3173143 (Why is no real title available?)
• scientific article; zbMATH DE number 3220189 (Why is no real title available?)
• A Random Graph Model for Power Law Graphs
• Connected components in random graphs with given expected degree sequences
• Emergence of Scaling in Random Networks
• Principles of statistical mechanics of uncorrelated random networks
• Statistical mechanics of complex networks
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks

Cited in

(10)

• Quantum contact process on scale-free networks
• Comparative study of the transcriptional regulatory networks of \textit{E. coli} and yeast: structural characteristics leading to marginal dynamic stability
• A program generating homogeneous random graphs with given weights
• Percolation on complex networks: theory and application
• Ferromagnetic transition in a simple variant of the Ising model on multiplex networks
• Clusters' size-degree distribution for bond percolation
• Slowly evolving random graphs II: adaptive geometry in finite-connectivity Hopfield models
• Spin glass transition in a simple variant of the Ising model on multiplex networks
• The percolation transition in correlated hypergraphs
• Spectral densities of scale-free networks

This page was built for publication: Evolution of scale-free random graphs: Potts model formulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874210)