Continuous-time independent edge-Markovian random graph process

DOI10.1007/S11401-015-0941-5zbMath1333.05270OpenAlexW2262762266MaRDI QIDQ270157

Yunbin Fu, Ruijie Du, Han-xing Wang

Publication date: 7 April 2016

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11401-015-0941-5

zbMATH Keywords

stationary distributionrandom graphcomplex networksindependent edge-Markovian random graph processrandom 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)

Data aggregation in mobile wireless sensor networks represented as stationary edge-Markovian evolving graphs

Cites Work

• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• Flooding time in edge-Markovian dynamic graphs
• The degree sequences and spectra of scale-free random graphs
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Parsimonious flooding in dynamic graphs

This page was built for publication: Continuous-time independent edge-Markovian random graph process