FHFrank Den Hollander

Frank Den Hollander

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Frank Den Hollander has a total of 104 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Triangle Friendship Paradox

    by Bishakh Bhattacharya, Nitya Gadhiwala, Frank Den Hollander, Pradeeptha R Jain, Tejashree Subramanya

    We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges at a vertex, the average friendship-bias of the number of triangles at a vertex is not always non-negative. We identify classes of finite deterministic graphs for which the bias is non-negative, and provide examples of finite deterministic graphs for which it is not. For certain classes of sparse and dense random graphs, we compute the scaling of the bias in the limit as the number of vertices tends to infinity.

  • Open Access

    Infection models on dense dynamic random graphs

    by Simone Baldassarri, Peter Braunsteins, Frank Den Hollander, Michel Mandjes

    We consider Susceptible-Infected-Recovered (SIR) models on dense dynamic random graphs, in which the joint dynamics of vertices and edges are co-evolutionary, i.e., they influence each other bidirectionally. In particular, edges appear and disappear over time depending on the states of the two connected vertices, on how long they have been infected, and on the total density of susceptible and infected vertices. Our main results establish functional laws of large numbers for the densities of susceptible, infected, and recovered vertices, jointly with the underlying evolving random graphs in the graphon space. Our results are supported by simulations, which characterize the limiting size of the epidemics, i.e., the limiting density of susceptible vertices, and how the peak of the epidemics depends on the rate of the evolution of the underlying graph. The proofs of our main results rely on the careful construction of a mimicking process, obtained by approximating the two-way feedback interaction between vertex and edge dynamics with a mean-field type interaction, acting only as one-way feedback, that remains sufficiently close to the original co-evolutionary process. To treat the more general setting in which edge dynamics are affected by the proportions of susceptible and infected individuals, we introduce a methodological extension of existing techniques. We thus show that our model exhibits multiple epidemic peaks -- a phenomenon observed in real-world epidemics -- which can emerge in models that incorporate mutual feedback between vertex and edge dynamics.

  • Open Access

    Sparse random graphs with many triangles

    by Suman Chakraborty, Remco van der Hofstad, Frank Den Hollander


  • Open Access

    The multi-level friendship paradox for sparse random graphs

    by Rajat Subhra Hazra, Frank Den Hollander, Azadeh Parvaneh


  • Open Access

    Evolution of Discordance

    by F. Den Hollander

    The present paper is a brief overview of random opinion dynamics on random graphs based on the Ising Lecture given by the author at the World Congress in Probability and Statistics, 12–16 August 2024, Bochum, Germany. The content is a snapshot of an interesting area of research that is developing rapidly.


  • Open Access

    Self-Reinforced Preferential Attachment

    by Yogesh Dahiya, Frank Den Hollander

    We consider a preferential attachment random graph with self-reinforcement. Each time a new vertex comes in, it attaches itself to an old vertex with a probability that is proportional to the sum of the degrees of that old vertex at all prior times. The resulting growing graph is a random tree whose vertices have degrees that grow polynomially fast in time. We compute the growth exponent, show that it is strictly larger than the growth exponent in the absence of self-reinforcement, and develop insight into how the self-reinforcement affects the growth. Proofs are based on a stochastic approximation scheme.

  • Open Access

    The Triangle Friendship Paradox

    by Bishakh Bhattacharya, Nitya Gadhiwala, Frank Den Hollander, Pradeeptha R Jain, Tejashree Subramanya

    We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges at a vertex, the average friendship-bias of the number of triangles at a vertex is not always non-negative. We identify classes of finite deterministic graphs for which the bias is non-negative, and provide examples of finite deterministic graphs for which it is not. For certain classes of sparse and dense random graphs, we compute the scaling of the bias in the limit as the number of vertices tends to infinity.

  • Open Access

    Continuum graph dynamics via population dynamics: Well-posedness, duality and equilibria

    by Andreas Greven, Frank Den Hollander, Anton Klimovsky, Anita Winter

  • Open Access

    Mixing of fast random walks on dynamic random permutations

    by Luca Avena, Remco van der Hofstad, Frank Den Hollander, Oliver Nagy

    We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one allows for coagulation of permutation cycles only, the other allows for both coagulation and fragmentation. We show that for both types, after scaling time by the length of the permutation and letting this length tend to infinity, the total variation distance between the current distribution and the uniform distribution converges to a limit process that drops down in a single jump. This jump is similar to a one-sided cut-off, occurs after a random time whose law we identify, and goes from the value 1 to a value that is a strictly decreasing and deterministic function of the time of the jump, related to the size of the largest component in Erdős–Rényi random graphs. After the jump, the total variation distance follows this function down to 0.


  • Open Access

    The friendship paradox for sparse random graphs

    by Rajat Subhra Hazra, Frank Den Hollander, Azadeh Parvaneh

    Let $$G_n$$ G n be an undirected finite graph on $$n\in {\mathbb {N}}$$ n ∈ N vertices labelled by $$[n] = \{1,\ldots ,n\}$$ [ n ] = { 1 , … , n } . For $$i \in [n]$$ i ∈ [ n ] , let $$\Delta _{i,n}$$ Δ i , n be the friendship bias of vertex i , defined as the difference between the average degree of the neighbours of vertex i and the degree of vertex i itself when i is not isolated, and zero when i is isolated. Let $$\mu _n$$ μ n denote the friendship-bias empirical distribution , i.e., the measure that puts mass $$\frac{1}{n}$$ 1 n at each $$\Delta _{i,n}$$ Δ i , n , $$i \in [n]$$ i ∈ [ n ] . The friendship paradox says that $$\int _{\mathbb {R}}x\mu _n(\textrm{d}x) \ge 0$$ ∫ R x μ n ( d x ) ≥ 0 , with equality if and only if in each connected component of $$G_n$$ G n all the degrees are the same. We show that if $$(G_n)_{n\in {\mathbb {N}}}$$ ( G n ) n ∈ N is a sequence of sparse random graphs that converges to a rooted random tree in the sense of convergence locally in probability, then $$\mu _n$$ μ n converges weakly to a limiting measure $$\mu $$ μ that is expressible in terms of the law of the rooted random tree. We study $$\mu $$ μ for four classes of sparse random graphs: the homogeneous Erdős-Rényi random graph, the inhomogeneous Erdős-Rényi random graph, the configuration model and the preferential attachment model. In particular, we compute the first two moments of $$\mu $$ μ , identify the right tail of $$\mu $$ μ , and argue that $$\mu ([0,\infty ))\ge \tfrac{1}{2}$$ μ ( [ 0 , ∞ ) ) ≥ 1 2 , a property we refer to as friendship paradox significance .