1 citations · 2 across the 4 of their papers we have counts for
4 papers
Long running times for hypergraph bootstrap percolation
Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg +1
Consider the hypergraph bootstrap percolation process in which, given a fixed -uniform hypergraph and starting with a given hypergraph , at each step we add to al…
Speeding up random walk mixing by starting from a uniform vertex
Alberto Espuny Díaz, Patrick Morris, Guillem Perarnau +1
The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initia…
Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
Alberto Espuny Díaz, Joseph Hyde
Let be a graph obtained as the union of some -vertex graph with minimum degree and a -dimensional random geometric graph . We investigate u…
Path decompositions of random directed graphs
Alberto Espuny Díaz, Viresh Patel, Fabian Stroh
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decompo…