45 citations · 70 across the 9 of their papers we have counts for
12 papers
Local limit of the random degree constrained process
Balázs Ráth, Márton Szőke, Lutz Warnke
In this paper we show that the random degree constrained process (a time-evolving random graph model with degree constraints) has a local weak limit, provided that the underlying h…
Concentration and mean field approximation results for Markov processes on large networks
Dániel Keliger, Balázs Ráth
We study Markov processes on weighted directed hypergraphs where the state of at most one vertex can change at a time. Our setting is general enough to include simplicial epidemic…
Path Percolation in Quantum Communication Networks
Xiangyi Meng, Bingjie Hao, Balázs Ráth +1
In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, commun…
Random interlacement is a factor of i.i.d
Márton Borbényi, Balázs Ráth, Sándor Rokob
The random interlacement point process (introduced by Sznitman, generalized by Teixeira) is a Poisson point process on the space of labeled doubly infinite nearest neighbour trajec…
Color-avoiding percolation in edge-colored Erdős-Rényi graphs
Balázs Ráth, Kitti Varga, Panna Tímea Fekete +1
We study a variant of the color-avoiding percolation model introduced by Krause et al., namely we investigate the color-avoiding bond percolation setup on (not necessarily properly…
Percolation of worms
Balázs Ráth, Sándor Rokob
We introduce a new correlated percolation model on the -dimensional lattice called the random length worms model. Assume given a probability distribution on the s…
A phase transition between endogeny and nonendogeny
Balázs Ráth, Jan M. Swart, Márton Szőke
The Marked Binary Branching Tree (MBBT) is the family tree of a rate one binary branching process, on which points have been generated according to a rate one Poisson point process…
Frozen percolation on the binary tree is nonendogenous
Balázs Ráth, Jan M. Swart, Tamás Terpai
In frozen percolation, i.i.d. uniformly distributed activation times are assigned to the edges of a graph. At its assigned time, an edge opens provided neither of its endvertices i…
On the threshold of spread-out voter model percolation
Balázs Ráth, Daniel Valesin
In the -spread out, -dimensional voter model, each site of has state (or 'opinion') 0 or 1 and, with rate 1, updates its opinion by copying that of some si…
On the transience of random interlacements
Balázs Ráth, Artëm Sapozhnikov
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite…
Connectivity properties of random interlacement and intersection of random walks
Balázs Ráth, Artëm Sapozhnikov
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite…
Triangle percolation in mean field random graphs -- with PDE
Balázs Ráth, Bálint Tóth
We apply a PDE-based method to deduce the critical time and the size of the giant component of the ``triangle percolation'' on the Erdős-Rényi random graph process investigated by…