2 citations · 3 across the 7 of their papers we have counts for
6 papers · 1 filter
Large deviation principle for friendship-biases in Galton--Watson trees
Frank den Hollander, Azadeh Parvaneh
In this paper we consider the friendship-bias of the vertices in an infinite rooted Galton--Watson tree. The friendship-bias of a vertex is the difference between the average degre…
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…
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 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…
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 , define…
A drainage network with dependence and the Brownian web
Azadeh Parvaneh, Afshin Parvardeh, Rahul Roy
We study a system of coalescing random walks on the integer lattice in which the walk is oriented in the -th direction and follows certain specified rules. We f…