G. Hooghiemstra

most citedDistances in random graphs with finite variance degrees

84 citations · 89 across the 2 of their papers we have counts for

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2004★ 84 cited

Distances in random graphs with finite variance degrees

Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem

In this paper we study a random graph with $N$ nodes, where node $j$ has degree $D_{j}$ and ${D_{j}}_{j = 1}^{N}$ are i.i.d. with $\prob(D_j\leq x)=F(x)$. We assume that $1-F(x)\leq c x^…

math.PR2004★ 5 cited

Distances in random graphs with infinite mean degrees

Remco van der Hofstad, Gerard Hooghiemstra, Dmitri Znamenski

We study random graphs with an i.i.d. degree sequence of which the tail of the distribution function $F$ is regularly varying with exponent $τ \in (1, 2)$ . Thus, the degrees have inf…