32 citations · 97 across the 48 of their papers we have counts for
22 papers · 1 filter
Random -regular graphs are not globally synchronizing
Ciro Carvallo, Pablo Groisman, Dieter Mitsche
We study the homogeneous Kuramoto model on random 3-regular graphs. A connected graph is globally synchronizing if, for almost every initial condition, the gradient flow conver…
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…
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…
Cluster-size decay in supercritical long-range percolation
Joost Jorritsma, Júlia Komjáthy, Dieter Mitsche
We study the cluster-size distribution of supercritical long-range percolation on , where two vertices are connected by an edge with probability…
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 label…