Dynamic random networks and their graph limits
DOI10.1214/15-AAP1098zbMath1342.60163MaRDI QIDQ292899
Publication date: 9 June 2016
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aoap/1458651817
Markov processrandom graphcombinatorial stochastic processAldous-Hoover theoremdynamic random networkgraph limitpartial exchangeability
Random graphs (graph-theoretic aspects) (05C80) Continuous-time Markov processes on general state spaces (60J25) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Foundations of stochastic processes (60G05) Exchangeability for stochastic processes (60G09)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Limits of dense graph sequences
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Discrete temporal models of social networks
- Exchangeable graph-valued Feller processes
- Time-varying network models
- A Markovian Function of a Markov Chain
This page was built for publication: Dynamic random networks and their graph limits