The multi-level friendship paradox for sparse random graphs

DOI10.1016/J.SPA.2026.104873MaRDI QIDQ6851243zbMATH OpenFDO

Authors Rajat Subhra Hazra, F. den Hollander, Azadeh Parvaneh

Publication date 27 February 2026

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

zbMATH Keywords

mixinglocal convergenceexplorationsparse random graphmulti-level friendship bias

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Sums of independent random variables; random walks (60G50) Strong limit theorems (60F15) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Density (toughness, etc.) (05C42) Random walks on graphs (05C81)

This page was built for publication: The multi-level friendship paradox for sparse random graphs

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