T. Makai

activity

20162026

collaborators

Showing math.PRShow all

5 papers · 1 filter

math.PR2026

The critical activation density in graph bootstrap percolation

Brett Kolesnik, Tamás Makai, Rajko Nenadov +3

In graph bootstrap percolation, edges of an Erdős-Rényi random graph $G_{n, p}$ are initially active, and activation spreads to other edges of $K_{n}$ via the combinatorics…

math.PR2024

Limit Laws for Critical Dispersion on Complete Graphs

Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou +1

We consider a synchronous process of particles moving on the vertices of a graph $G$ , introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles ar…

math.PR2024

Bootstrap Percolation on the Binomial Random $k$ -uniform Hypergraph

Mihyun Kang, Christoph Koch, Tamás Makai

We investigate the behaviour of $r$ -neighbourhood bootstrap percolation on the binomial $k$ -uniform random hypergraph $H_{k} (n, p)$ for given integers $k \geq 2$ and $r \geq 2$ . In $r$ -…

math.PR2024

Do random initial degrees suppress concentration in preferential attachment graphs?

T. Makai, F. Polito, L. Sacerdote

We consider the open problem concerning the possible lack of concentration of the degree distribution in preferential attachment graphs with random initial degree, when its distrib…

math.PR2023

Dispersion on the Complete Graph

Umberto De Ambroggio, Tamás Makai, Konstantinos Panagiotou

We consider a synchronous process of particles moving on the vertices of a graph $G$ , introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles ar…

The critical activation density in graph bootstrap percolation

Limit Laws for Critical Dispersion on Complete Graphs

Bootstrap Percolation on the Binomial Random k-uniform Hypergraph

Do random initial degrees suppress concentration in preferential attachment graphs?

Dispersion on the Complete Graph

Bootstrap Percolation on the Binomial Random $k$ -uniform Hypergraph