On the connectivity threshold of Achlioptas processes

DOI10.4310/JOC.2014.V5.N3.A2zbMATH Open1307.05206MaRDI QIDQ482273FDOQ482273

Authors: Mihyun Kang, Konstantinos Panagiotou 

Publication date: 22 December 2014

Published in: Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• The connectivity threshold for the min‐degree random graph process
• Hamiltonicity thresholds in Achlioptas processes
• Percolation transitions in growing networks under achlioptas processes: analytic solutions
• Percolation thresholds for robust network connectivity
• Connectivity threshold for random chordal graphs
• Connectivity properties of Mandelbrot's percolation process
• The probability of connectivity in a hyperbolic model of complex networks
• Connectivity in fractal percolation
• scientific article; zbMATH DE number 4048834

zbMATH Keywords

thresholdconnectivityAchlioptas process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)

Cited In (3)

• Creating small subgraphs in Achlioptas processes with growing parameter
• The evolution of subcritical Achlioptas processes
• The Kőnig graph process

This page was built for publication: On the connectivity threshold of Achlioptas processes

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