Dispersion on the complete graph

DOI10.1002/RSA.21266MaRDI QIDQ7027473zbMATH OpenFDO

Authors Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou

Publication date 14 February 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.21266

zbMATH Keywords

branching processcomplete graphdispersion of particlesphase transitiontail bounds

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• A note on dispersing particles on a line
• Dispersion on the complete graph (extended abstract)
• Dispersion processes
• First-hitting times under drift
• scientific article; zbMATH DE number 218327 (Why is no real title available?)
• Internal diffusion limited aggregation
• Introduction to Random Graphs
• Limit laws for critical dispersion on complete graphs
• Longest distance of a non-uniform dispersion process on the infinite line
• Real analysis. A comprehensive course in analysis, part 1

Cited in

(2)

• Quantitative convergence guarantees for the mean-field dispersion process
• Sticky dispersion on the complete graph: a kinetic approach

This page was built for publication: Dispersion on the complete graph

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