A stopping criterion for Markov chains when generating independent random graphs
From MaRDI portal
Publication:4689355
DOI10.1093/comnet/cnu041zbMath1397.60105arXiv1210.8184OpenAlexW2963327890MaRDI QIDQ4689355
C. Seshadhri, Jaideep Ray, Ali Pınar
Publication date: 16 October 2018
Published in: Journal of Complex Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.8184
Random graphs (graph-theoretic aspects) (05C80) Monte Carlo methods (65C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (1)
This page was built for publication: A stopping criterion for Markov chains when generating independent random graphs
