Evolution of random graph processes with degree constraints

DOI10.1016/J.ENDM.2007.01.067MaRDI QIDQ3439624zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Random Graph Processes with Degree Restrictions
• scientific article; zbMATH DE number 3168330
• On the degree sequence of an evolving random graph process and its critical phenomenon
• The Evolution of Random Graphs
• On a random graph evolving by degrees
• scientific article; zbMATH DE number 5485245
• Evolutionary equations and random graphs
• Constrained Markovian dynamics of random graphs
• scientific article; zbMATH DE number 3173143
• Random hypergraph processes with degree restrictions

Cites work

• A critical point for random graphs with a given degree sequence
• Component behavior near the critical point of the random graph process
• Connectedness of graphs generated by a random d-process
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 944215 (Why is no real title available?)
• Random Graph Processes with Degree Restrictions
• Random graphs.
• Random Star Processes
• The connectivity threshold for the min‐degree random graph process
• The Critical Phase for Random Graphs with a Given Degree Sequence
• The Evolution of Random Graphs
• The evolution of the min-min random graph process

Cited in

(12)

• The evolution of the min-min random graph process
• On a random graph evolving by degrees
• A time-invariant random graph with splitting events
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• Continuous-time independent edge-Markovian random graph process
• scientific article; zbMATH DE number 434917 (Why is no real title available?)
• On the degree sequence of an evolving random graph process and its critical phenomenon
• scientific article; zbMATH DE number 5485245 (Why is no real title available?)
• Random Graph Processes with Degree Restrictions
• scientific article; zbMATH DE number 1948235 (Why is no real title available?)
• Evolving Shelah‐Spencer graphs
• Evolution of scale-free random graphs: Potts model formulation

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

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