Open Access
April 2016 Dynamic random networks and their graph limits
Harry Crane
Ann. Appl. Probab. 26(2): 691-721 (April 2016). DOI: 10.1214/15-AAP1098

Abstract

We study a broad class of stochastic process models for dynamic networks that satisfy the minimal regularity conditions of (i) exchangeability and (ii) càdlàg sample paths. Our main theorems characterize these processes through their induced behavior in the space of graph limits. Under the assumption of time-homogeneous Markovian dependence, we classify the discontinuities of these processes into three types, prove bounded variation of the sample paths in graph limit space and express the process as a mixture of time-inhomogeneous, exchangeable Markov processes with càdlàg sample paths.

Citation

Download Citation

Harry Crane. "Dynamic random networks and their graph limits." Ann. Appl. Probab. 26 (2) 691 - 721, April 2016. https://doi.org/10.1214/15-AAP1098

Information

Received: 1 October 2014; Revised: 1 December 2014; Published: April 2016
First available in Project Euclid: 22 March 2016

zbMATH: 1342.60163
MathSciNet: MR3476622
Digital Object Identifier: 10.1214/15-AAP1098

Subjects:
Primary: 60G05 , 60G09 , 60J25 , 90B15

Keywords: Aldous–Hoover theorem , combinatorial stochastic process , complex network , dynamic network , exchangeable random graph , graph limit , graphon , Markov process , Partial exchangeability , Time-varying network

Rights: Copyright © 2016 Institute of Mathematical Statistics

Vol.26 • No. 2 • April 2016
Back to Top