4 citations · 12 across the 8 of their papers we have counts for
8 papers
From local giants to locality in long-range percolation
Yago Moreno Alonso, Júlia Komjáthy
We prove the analogue of Schramm's locality conjecture for long-range percolation on transitive graphs of polynomial growth with . In this setting, we also prove the jo…
Degree-dependent and distance-dependent contact rates interpolate between explosive, exponential and polynomial epidemic growth
Zylan Benjert, Júlia Komjáthy, Johannes Lengler +2
It is a fundamental question in epidemiology to estimate, model and predict the growth rate of a pandemic. Analogously, analysing the diffusion of innovation, (fake) news, memes, a…
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…
Degree-penalized contact processes
Zsolt Bartha, Júlia Komjáthy, Daniel Valesin
We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph…
Polynomial growth in degree-dependent first passage percolation on spatial random graphs
Júlia Komjáthy, John Lapinskas, Johannes Lengler +1
In this paper we study a version of (non-Markovian) first passage percolation on graphs, where the transmission time between two connected vertices is non-iid, but increases by a p…
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…
Sharp bound on the threshold metric dimension of trees
Zsolt Bartha, Júlia Komjáthy, Järvi Raes
The threshold- metric dimension () of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the gra…