A time-invariant random graph with splitting events

We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a Poisson random number of edges are added between them. The process...

Description complète

Détails bibliographiques
Auteurs principaux: Georgakopoulos, A, Haslegrave, J
Format: Journal article
Langue:English
Publié: Institute of Mathematical Statistics 2021