A Dynamic Erd\H{o}s-R\'enyi Graph Model

zbMath1422.05094arXiv1604.05127MaRDI QIDQ5231139

Sebastian Rosengren, Pieter Trapman

Publication date: 23 August 2019

Full work available at URL: https://arxiv.org/abs/1604.05127

zbMATH Keywords

Markov processhitting timesErdős-Rényi graphstrong stationary timesfastest time to stationarity

Mathematics Subject Classification ID

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

Related Items (1)

Two-way sparsity for time-varying networks with applications in genomics

This page was built for publication: A Dynamic Erd\H{o}s-R\'enyi Graph Model