Evolution of random graph processes with degree constraints
From MaRDI portal
Publication:3439624
DOI10.1016/j.endm.2007.01.067zbMath1291.05187MaRDI QIDQ3439624
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
05C80: Random graphs (graph-theoretic aspects)
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Related Items
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