Continuum graph dynamics via population dynamics: Well-posedness, duality and equilibria
Andreas Greven,
Frank den Hollander,
Anton Klimovsky and
Anita Winter
Stochastic Processes and their Applications, 2025, vol. 188, issue C
Abstract:
This paper introduces graphemes, a novel framework for constructing and analysing stochastic processes that describe the evolution of large dynamic graphs. Unlike graphons, which are well-suited for studying static dense graphs and which are closely related to the Aldous–Hoover representation of exchangeable random graphs, graphemes allow for a modelling of the full space–time evolution of dynamic dense graphs, beyond the exchangeability and the subgraph frequencies used in graphon theory. A grapheme is defined as an equivalence class of triples, consisting of a Polish space, a symmetric {0,1}-valued connection function on that space (representing edges connecting vertices), and a sampling probability measure.
Keywords: Graph-valued Markov processes; Graphemes; Marked graphemes; Duality; Martingale problem; Genealogy; Population genetics (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304414925001115
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:188:y:2025:i:c:s0304414925001115
Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01
DOI: 10.1016/j.spa.2025.104670
Access Statistics for this article
Stochastic Processes and their Applications is currently edited by T. Mikosch
More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().