activity
20132020
most citedMaximum percolation time in two-dimensional bootstrap percolation

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

collaborators

9 papers

math.CO2020

Algebraic and combinatorial expansion in random simplicial complexes

Nikolaos Fountoulakis, Michał Przykucki

In this paper we consider the expansion properties and the spectrum of the combinatorial Laplace operator of a -dimensional Linial-Meshulam random simplicial complex, above the…

math.PR2019

High-dimensional bootstrap processes in evolving simplicial complexes

Nikolaos Fountoulakis, Michał Przykucki

We study bootstrap percolation processes on random simplicial complexes of some fixed dimension . Starting from a single simplex of dimension , we build our complex dy…

math.CO2019

Shotgun reconstruction in the hypercube

Michał Przykucki, Alexander Roberts, Alex Scott

Mossel and Ross raised the question of when a random colouring of a graph can be reconstructed from local information, namely the colourings (with multiplicity) of balls of given r…

math.PR2019

Parking on the integers

Michał Przykucki, Alexander Roberts, Alex Scott

Models of parking in which cars are placed randomly and then move according to a deterministic rule have been studied since the work of Konheim and Weiss in the 1960s. Recently, Da…

math.CO2018

Vertex-isoperimetric stability in the hypercube

Michał Przykucki, Alexander Roberts

Harper's Theorem states that, in a hypercube, among all sets of a given fixed size the Hamming balls have minimal closed neighbourhoods. In this paper we prove a stability-like res…

math.CO2017

On the critical densities of minor-closed classes

Colin McDiarmid, Michał Przykucki

Given a minor-closed class of graphs, let denote the supremum over all graphs in of the ratio of edges to vertices. We investigate the…