Tamás Makai

activity

20102024

most citedNo Dense Subgraphs Appear in the Triangle-free Graph Process

1 citations · 3 across the 6 of their papers we have counts for

collaborators

6 papers

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.PR2016

A phase transition regarding the evolution of bootstrap processes in inhomogeneous random graphs

Nikolaos Fountoulakis, Mihyun Kang, Christoph Koch +1

A bootstrap percolation process on a graph with infection threshold $r \geq 1$ is a dissemination process that evolves in time steps. The process begins with a subset of infected ver…

math.CO2016★ 1 cited

A simple proof of almost percolation on G(n;p)

Mihyun Kang, Tamás Makai

We consider bootstrap percolation on the binomial random graph $G (n, p)$ with infection threshold $r \in N$ , an infection process which starts from a set of initially infect…

math.CO2014★ 1 cited

Properties of stochastic Kronecker graphs

Mihyun Kang, Michał Karoński, Christoph Koch +1

The stochastic Kronecker graph model introduced by Leskovec et al. is a random graph with vertex set $Z_{2}^{n}$ , where two vertices $u$ and $v$ are connected with probability…

math.CO2010★ 1 cited

No Dense Subgraphs Appear in the Triangle-free Graph Process

Stefanie Gerke, Tamás Makai

Consider the triangle-free graph process, which starts from the empty graph on $n$ vertices and a random ordering of the possible $(2 n)$ edges; the edges are added in this…