5 papers
The multi-level friendship paradox for sparse random graphs
Rajat Subhra Hazra, Frank den Hollander, Azadeh Parvaneh
In Hazra, den Hollander and Parvaneh (2025) we analysed the friendship paradox for sparse random graphs. For four classes of random graphs we characterised the empirical distributi…
Optimal Structure of Signal Networks for Efficient Information Aggregation
Bernd Heidergott, Frank den Hollander, Ines Lindner +1
This paper develops a mathematical framework to study signal networks, in which nodes can be active or inactive, and their activation or deactivation is driven by external signals…
The friendship paradox for trees
Rajat Subhra Hazra, Frank den Hollander, Nelly Litvak +1
We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively…
The friendship paradox for sparse random graphs
Rajat Subhra Hazra, Frank den Hollander, Azadeh Parvaneh
Let be an undirected finite graph on vertices labelled by . For , let be the friendship bias of vertex , defin…
Interacting Particle Systems on Random Graphs
F. Capannoli, F. den Hollander
The present overview of interacting particle systems on random graphs collects the notes of a mini-course given by the authors at the Brazilian School of Probability, 5--9 August 2…