Remco van der Hofstad
Eindhoven University of Technology
328 Papers
2K Citations
Remco van der Hofstad is an academic researcher from Eindhoven University of Technology. The author has contributed to research in topics: Random graph & Random walk. The author has an hindex of 43, co-authored 304 publications. Previous affiliations of Remco van der Hofstad include McMaster University & Delft University of Technology.
Chat about Author
Papers
Connectivity threshold for random subgraphs of the Hamming graph
TL;DR: It is found that the threshold does not depend on $d, unlike the phase transition of the giant connected component the Hamming graph (see [Bor et al, 2005]).
The winner takes it all
TL;DR: In this paper, the authors studied the first passage percolation on graphs generated by the configuration model and showed that, if the degree distribution is a power-law with exponent δ(n 2, 3), then with high probability, one of the infection types will occupy all but a finite number of vertices.
•Posted Content
Global lower mass-bound for critical configuration models in the heavy-tailed regime
TL;DR: The scaling limit of the critical percolation clusters, viewed as measured metric spaces, was established in this article with respect to the Gromov-Hausdorff-Prokhorov topology under slightly stronger assumptions on the degree distribution.
10
Diameter in ultra-small scale-free random graphs.
TL;DR: In this paper, it was shown that the diameter is of order log log n precisely when the minimal forward degree d fwd of vertices is at least 2, and the exact constant which equals that of the typical distances plus 2 / log fwd was identified.
10
Expansion of percolation critical points for hamming graphs
TL;DR: In this article, it was shown that for d ∈ ℕ fixed and n → ∞, pc(d) = 1/m + 2d2 - 1/2(d -1)2 1 /m2 + O(m-3)+O (m-1V-1/3) which extends the asymptotics found in [10] by one order.