Evolution of random graph processes with degree constraints

DOI10.1016/J.ENDM.2007.01.067zbMath1291.05187OpenAlexW2029690202MaRDI QIDQ3439624

Mihyun Kang

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.067

zbMATH Keywords

connectednessphase transitionrandom graph process

Mathematics Subject Classification ID

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

Related Items (1)

Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The evolution of the min-min random graph process
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• Random Graph Processes with Degree Restrictions
• Connectedness of graphs generated by a random d-process
• A critical point for random graphs with a given degree sequence
• Random Star Processes
• The Critical Phase for Random Graphs with a Given Degree Sequence
• The connectivity threshold for the min‐degree random graph process

This page was built for publication: Evolution of random graph processes with degree constraints