Time-varying network models

DOI10.3150/14-BEJ617zbMath1323.05115arXiv1507.07664OpenAlexW3104236025MaRDI QIDQ2515513

Harry Crane

Publication date: 5 August 2015

Published in: Bernoulli (Search for Journal in Brave)

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

zbMATH Keywords

Aldous-Hoover theoremgraph limitErdős-Rényi random graphexchangeable random graphconsistency under subsamplingpartially exchangeable array

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Markov processes (60J99)

Related Items

Exchangeable graph-valued Feller processes, Dynamic random networks and their graph limits, Combinatorial Lévy processes, Optimal change point detection and localization in sparse dynamic networks, A statistical framework for modern network science

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consistency under sampling of exponential random graph models
• Interacting particle systems as stochastic social dynamics
• Limits of dense graph sequences
• Statistical analysis of network data. Methods and models
• Gibbs fragmentation trees
• Representations for partially exchangeable arrays of random variables
• The coalescent
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• What is a statistical model? (With comments and rejoinder).
• Discrete temporal models of social networks
• Emergence of Scaling in Random Networks
• A Markovian Function of a Markov Chain
• Collective dynamics of ‘small-world’ networks
• Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications