Dynamic random networks and their graph limits

DOI10.1214/15-AAP1098zbMATH Open1342.60163MaRDI QIDQ292899FDOQ292899

Authors: Harry Crane 

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

Recommendations

• Dynamic Erdős-Rényi graphs
• Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model
• Dynamic random networks in dynamic populations
• Limits of randomly grown graph sequences
• Exchangeable graph-valued Feller processes

zbMATH Keywords

random graphMarkov processAldous-Hoover theoremcombinatorial stochastic processdynamic random networkgraph limitpartial exchangeability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Continuous-time Markov processes on general state spaces (60J25) Combinatorial probability (60C05) Stochastic network models in operations research (90B15) Exchangeability for stochastic processes (60G09) Foundations of stochastic processes (60G05)

Cites Work

• Limits of dense graph sequences
• Large networks and graph limits
• Time-varying network models
• A Markovian Function of a Markov Chain
• Discrete temporal models of social networks
• Title not available (Why is that?)
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
• Exchangeable graph-valued Feller processes

Cited In (15)

• RELATIVELY EXCHANGEABLE STRUCTURES
• Graphon-valued stochastic processes from population genetics
• On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
• Title not available (Why is that?)
• Combinatorial Lévy processes
• A sample-path large deviation principle for dynamic Erdős-Rényi random graphs
• The local limit of random sorting networks
• Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model
• Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
• Two-way sparsity for time-varying networks with applications in genomics
• Approximating network dynamics: some open problems
• Exploration of dynamic networks: tight bounds on the number of agents
• Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022
• Exchangeable graph-valued Feller processes
• From flip processes to dynamical systems on graphons

This page was built for publication: Dynamic random networks and their graph limits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q292899)