32 citations · 97 across the 48 of their papers we have counts for
63 papers
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…
Zero-sum Random Games on Directed Graphs
Luc Attia, Lyuben Lichev, Dieter Mitsche +2
This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players. Starting from…
Sharp threshold for embedding balanced spanning trees in random geometric graphs
Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche +1
A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of…
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…