Percolation transition and distribution of connected components in generalized random network ensembles

DOI10.1088/1751-8113/42/19/195007MaRDI QIDQ3630103zbMATH OpenOpenAlexWikidataFDO

Authors Serena Bradde, Ginestra Bianconi

Publication date 2 June 2009

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0901.3225

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Percolation (82B43)

Abstract: In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree sequences, non-trivial community structure or specific spatial dependence of the link probability for networks embedded in a metric space. We find the cluster distribution of the networks in these ensembles by mapping the problem to a fully connected Potts model with heterogeneous couplings. We show that the nature of the Potts model phase transition, linked to the birth of a giant component, has a crossover from second to first order when the number of critical colors $q_c=2$ in all the networks under study. These results shed light on the properties of dynamical processes defined on these network ensembles.

Recommendations

• The percolation transition in correlated hypergraphs
• Percolation transition of random networks under a piecewise linear weighted function
• Explosive percolation in random networks
• Large-deviation properties of largest component for random graphs
• Emergence of the giant component in preferential-attachment growing networks

Cited in

(10)

• Percolation transitions in growing networks under achlioptas processes: analytic solutions
• Percolation on complex networks: theory and application
• Percolation Thresholds of the Fortuin-Kasteleyn Cluster for the Edwards-Anderson Ising Model on Complex Networks: -- Analytical Results on the Nishimori Line --
• The percolation transition in correlated hypergraphs
• Percolation transition of random networks under a piecewise linear weighted function
• Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
• Large deviation theory of percolation on multiplex networks
• Percolation phase transition in weight-dependent random connection models
• Characterizing spatial point processes by percolation transitions
• Percolation transition with changed hidden variables in complex networks

This page was built for publication: Percolation transition and distribution of connected components in generalized random network ensembles

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