1 citations · 2 across the 3 of their papers we have counts for
5 papers
Time Scales of the Fredrickson-Andersen Model on Polluted and
Assaf Shapira, Erik Slivken
We study the Kinetically Constrained Model on the polluted square lattice, with two-neighbor constraints. For a quenched polluted environment with low pollution density we give bou…
Square permutations are typically rectangular
Jacopo Borga, Erik Slivken
We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is…
Maximal spanning time for neighborhood growth on the Hamming plane
Janko Gravner, J. E. Paguyo, Erik Slivken
We consider a long-range growth dynamics on the two-dimensional integer lattice, initialized by a finite set of occupied points. Subsequently, a site becomes occupied if the pa…
Pattern-avoiding permutations and Brownian excursion, Part II: Fixed points
Christopher Hoffman, Douglas Rizzolo, Erik Slivken
Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology…
Jigsaw Percolation on Erdos-Renyi Random Graphs
Erik Slivken
We extend the jigsaw percolation model to analyze graphs where both underlying people and puzzle graphs are Erdős-Rényi random graphs. Let and den…