The connectivity threshold for the min‐degree random graph process

DOI10.1002/RSA.20125MaRDI QIDQ5486310zbMATH OpenOpenAlexFDO

Authors Mihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Łuczak

Publication date 6 September 2006

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

Full work available at URL https://doi.org/10.1002/rsa.20125

zbMATH Keywords

minimum degreeprobabilityrandom multigraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• A note on thresholds and connectivity in random directed graphs
• Connectivity threshold for random chordal graphs
• The connectivity threshold of random geometric graphs with Cantor distributed vertices
• Connectedness of graphs generated by a random d-process
• scientific article; zbMATH DE number 15665
• Bounds on probability of connectedness of a random graph
• Lower bounds of connectedness probability for some classes of random graphs
• \(k\)-connectivity in random graphs
• On the connectedness of a random graph
• Connectedness of certain random graphs

Cites work

• Cycles in a Uniform Graph Process

Cited in

(10)

• Continuous-time independent edge-Markovian random graph process
• Phase transition of the minimum degree random multigraph process
• scientific article; zbMATH DE number 2076150 (Why is no real title available?)
• On the connectivity threshold of Achlioptas processes
• The evolution of the min-min random graph process
• GHS algorithm on a graph with random weights
• Connectivity threshold for random chordal graphs
• On resilience of connectivity in the evolution of random graphs
• On the normality of giant components
• Evolution of random graph processes with degree constraints

This page was built for publication: The connectivity threshold for the min‐degree random graph process

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