activity
20132025
most citedWeakly saturated random graphs

4 citations · 13 across the 8 of their papers we have counts for

collaborators

8 papers

math.PR2025

Sharp Fuss-Catalan thresholds in graph bootstrap percolation

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg +1

We study graph bootstrap percolation on the Erdős-Rényi random graph . For all , we locate the sharp -percolation threshold …

math.CO2023★ 1 cited

-percolation with a random

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg

In -percolation, we start with an Erdős--Rényi graph and then iteratively add edges that complete copies of . The process percolates if all edges missing…

math.PR2023★ 2 cited

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…

math.CO2021

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…

math.PR2020★ 4 cited

Weakly saturated random graphs

Zsolt Bartha, Brett Kolesnik

As introduced by Bollobás, a graph is weakly -saturated if the complete graph is obtained by iteratively completing copies of minus an edge. For all graphs , we…

math.PR2019★ 2 cited

Breaking of 1RSB in random MAX-NAE-SAT

Zsolt Bartha, Nike Sun, Yumeng Zhang

For several models of random constraint satisfaction problems, it was conjectured by physicists and later proved that a sharp satisfiability transition occurs. For random -SAT a…

math.PR2015★ 3 cited

Noise sensitivity in bootstrap percolation

Zsolt Bartha, Gábor Pete

Answering questions of Itai Benjamini, we show that the event of complete occupation in 2-neighbour bootstrap percolation on the d-dimensional box [n]^d, for d\geq 2, at its critic…

math.PR2013★ 1 cited

Quenched Invariance Principle for the Random Walk on the Penrose Tiling

Zs. Bartha, A. Telcs

We consider the simple random walk on the graph corresponding to a Penrose tiling. We prove that the path distribution of the walk converges weakly to that of a non-degenerate Brow…