Triangle percolation in mean field random graphs-with PDE

DOI10.1007/S10955-008-9499-XMaRDI QIDQ927201zbMATH OpenOpenAlexFDO

Authors Balázs Ráth, Bálint Tóth

Publication date 4 June 2008

Published in Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Rényi modelmean fieldPDErandom graphstriangle percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Dynamic and nonequilibrium phase transitions (general) in statistical mechanics (82C26) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41) Time-dependent percolation in statistical mechanics (82C43)

Abstract: We apply a PDE-based method to deduce the critical time and the size of the giant component of the ``triangle percolation on the ErdH{o}s-R'enyi random graph process investigated by Palla, Der'enyi and Vicsek

Recommendations

• Mean field frozen percolation
• Percolation in general graphs
• The random triangle model
• Percolation on dense graph sequences
• Percolation on sparse random graphs with given degree sequence

Cites work

• Approach to self‐similarity in Smoluchowski's coagulation equations
• Convergence of the Marcus-Lushnikov process
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• scientific article; zbMATH DE number 3173143 (Why is no real title available?)
• Polymers and random graphs
• The critical point of \(k\)-clique percolation in the Erdős-Rényi graph

Cited in

(2)

• Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs
• The triangle condition for percolation

This page was built for publication: Triangle percolation in mean field random graphs-with PDE

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