1 citations · 1 across the 1 of their papers we have counts for
5 papers · 1 filter
On the jump of the cover time in random geometric graphs
Carlos Martinez-Arevalo, Dieter Mitsche
In this paper we study the cover time of the simple random walk on the giant component of supercritical -dimensional random geometric graphs on vertices. We sh…
Large deviations of the giant in supercritical kernel-based spatial random graphs
Joost Jorritsma, Júlia Komjáthy, Dieter Mitsche
We study cluster sizes in supercritical -dimensional inhomogeneous percolation models with long-range edges -- such as long-range percolation -- and/or heavy-tailed degree distr…
On the first and second largest components in the percolated Random Geometric Graph
Lyuben Lichev, Bas Lodewijks, Dieter Mitsche +1
The percolated random geometric graph has vertex set given by a Poisson Point Process in the square , and every pair of vertices at distance at most 1…
Label propagation on binomial random graphs
Marcos Kiwi, Lyuben Lichev, Dieter Mitsche +1
We study the behavior of a label propagation algorithm (LPA) on the ErdÅs-Rényi random graph . Initially, given a network, each vertex starts with a random labe…
Cluster-size decay in supercritical kernel-based spatial random graphs
Joost Jorritsma, Júlia Komjáthy, Dieter Mitsche
We consider a large class of spatially-embedded random graphs that includes among others long-range percolation, continuum scale-free percolation and the age-dependent random conne…