Merging percolation onZdand classical random graphs: Phase transition

DOI10.1002/RSA.20287MaRDI QIDQ3055883zbMATH OpenOpenAlexFDO

Authors Tatyana S. Turova, Thomas Vallier

Publication date 10 November 2010

Published in Random Structures \& Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionpercolationinhomogeneous random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We study a random graph model which is a superposition of the bond percolation model on $Z^d$ with probability $p$ of an edge, and a classical random graph $G(n,c/n)$. We show that this model, being a {it homogeneous} random graph, has a natural relation to the so-called "rank 1 case" of {it inhomogeneous} random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe the phase diagram on the set of parameters $cgeq0$ and $0leqp<p_c$, where $p_c=p_c(d)$ is the critical probability for the bond percolation on $Z^d$. The phase transition is similar to the classical random graph, it is of the second order. We also find the scaled size of the largest connected component above the phase transition.

Recommendations

• Publication:4938894
• The phase transition in site percolation on pseudo-random graphs
• scientific article; zbMATH DE number 5314553
• The phase transition in the Erdős-Rényi random graph process
• Critical percolation on scale-free random graphs: new universality class for the configuration model
• Phase transition of the contact process on random regular graphs
• scientific article; zbMATH DE number 5722221
• Algorithms and Models for the Web-Graph

Cites work

• Collective dynamics of `small-world' networks
• Concentration of measure and isoperimetric inequalities in product spaces
• On a Random Graph Related to Quantum Theory
• Percolation
• Phase transitions in dynamical random graphs
• Random graphs and grammars on graphs
• The phase transition in inhomogeneous random graphs

Cited in

(4)

• Survey of scalings for the largest connected component in inhomogeneous random graphs
• Phase transitions and percolation at criticality in enhanced random connection models
• Bootstrap percolation on a graph with random and local connections
• Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs

This page was built for publication: Merging percolation onZdand classical random graphs: Phase transition

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