activity
20102025
most citedJigsaw percolation: What social networks can collaboratively solve a puzzle?

17 citations · 67 across the 24 of their papers we have counts for

collaborators

33 papers

math.PR2025

Disks, Surfaces, and Entanglement Percolation

Paul Duncan, Benjamin Schweinhart, David Sivakoff

We study the probability that a loop is null-homotopic -- that is, bounded by the continuous image of a disk -- in plaquette percolation on Locally, the event that…

math.PR2025

The effects of individual versus community-influenced isolation on SIS epidemic persistence on finite random graphs

Shirshendu Chatterjee, David Sivakoff, Matthew Wascher

The contact process, or the SIS epidemic model, is a continuous-time Markov process used to model the spread of a recurring infection on a graph. Each vertex is either healthy or i…

math.PR2025

On the Continuity of Enhancement Percolation

Paul Duncan, Benjamin Schweinhart, David Sivakoff

We study bond percolation in with an unbounded family of enhancements that enable additional bonds to act as open. A natural question is whether percolation occurs i…

math.PR2025

Two-stage Bootstrap Percolation

Zihao Fang, Janko Gravner, David Sivakoff

We introduce and study two variants of two-stage growth dynamics in with state space . In each variant, vertices in state can be change…

math.PR2025

Polluted Modified Bootstrap Percolation

Janko Gravner, Alexander Holroyd, Sangchul Lee +1

In the polluted modified bootstrap percolation model, sites in the square lattice are independently initially occupied with probability or closed with probability . A site b…

math.PR2024

Competing deterministic growth models in two dimensions

Janko Gravner, David Sivakoff

We consider three-state cellular automata in two dimensions in which two colored states, blue and red, compete for control of the empty background, starting from low initial densit…

math.PR2023

Diffusion-limited annihilating-coalescing systems

Sungwon Ahn, Matthew Junge, Hanbaek Lyu +3

We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both…

math.PR2023

Two-dimensional supercritical growth dynamics with one-dimensional nucleation

Daniel Blanquicett, Janko Gravner, David Sivakoff +1

We introduce a class of cellular automata growth models on the two-dimensional integer lattice with finite cross neighborhoods. These dynamics are determined by a Young diagram $\m…

q-bio.PE2022

Dynamics of advantageous mutant spread in spatial death-birth and birth-death Moran models

Jasmine Foo, Einar Bjarki Gunnarsson, Kevin Leder +1

The spread of an advantageous mutation through a population is of fundamental interest in population genetics. While the classical Moran model is formulated for a well-mixed popula…

math.PR2021

Cyclic Cellular Automata and Greenberg-Hastings Models on Regular Trees

Jason Bello, David Sivakoff

We study the cyclic cellular automaton (CCA) and the Greenberg-Hastings model (GHM) with colors and contact threshold on the infinite -regular tree, .…

math.PR2020

Stretched exponential decay for subcritical parking times on

Michael Damron, Hanbaek Lyu, David Sivakoff

In the parking model on , each vertex is initially occupied by a car (with probability ) or by a vacant parking spot (with probability ). Cars perform indepen…

math.PR2020★ 2 cited

Particle density in diffusion-limited annihilating systems

Tobias Johnson, Matthew Junge, Hanbaek Lyu +1

Place an -particle at each site of a graph independently with probability and otherwise place a -particle. - and -particles perform independent continuous time rand…

math.PR2019★ 8 cited

Sampling random graph homomorphisms and applications to network data analysis

Hanbaek Lyu, Facundo Memoli, David Sivakoff

A graph homomorphism is a map between two graphs that preserves adjacency relations. We consider the problem of sampling a random graph homomorphism from a graph into a large netwo…

math.PR2019

Two-type annihilating systems on the complete and star graph

Irina Cristali, Yufeng Jiang, Matthew Junge +3

Red and blue particles are placed in equal proportion through-out either the complete or star graph and iteratively sampled to take simple random walk steps. Mutual annihilation oc…

math.PR2018

The effect of avoiding known infected neighbors on the persistence of a recurring infection process

Shirshendu Chatterjee, David Sivakoff, Matthew Wascher

We study a generalization of the classical contact process (SIS epidemic model) in a directed graph . Our model is a continuous-time interacting particle system in which at ever…

math.PR2018

Bootstrap percolation on the product of the two-dimensional lattice with a Hamming square

Janko Gravner, David Sivakoff

Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least occupied neighbors. The initiall…

math.PR2017

Parking on transitive unimodular graphs

Michael Damron, Janko Gravner, Matthew Junge +2

Place a car independently with probability at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent r…

math.PR2017★ 4 cited

Coarsening model on with biased zero-energy flips and an exponential large deviation bound for ASEP

Michael Damron, Leonid Petrov, David Sivakoff

We study the coarsening model (zero-temperature Ising Glauber dynamics) on (for ) with an asymmetric tie-breaking rule. This is a Markov process on the sta…

math.PR2017

Polluted Bootstrap Percolation in Three Dimensions

Janko Gravner, Alexander E. Holroyd, David Sivakoff

In the polluted bootstrap percolation model, vertices of the cubic lattice are independently declared initially occupied with probability or closed with probabil…

cs.SI2017★ 8 cited

Hierarchical Change Point Detection on Dynamic Networks

Yu Wang, Aniket Chakrabarti, David Sivakoff +1

This paper studies change point detection on networks with community structures. It proposes a framework that can detect both local and global changes in networks efficiently. Impo…

cs.SI2017★ 12 cited

Fast Change Point Detection on Dynamic Social Networks

Yu Wang, Aniket Chakrabarti, David Sivakoff +1

A number of real world problems in many domains (e.g. sociology, biology, political science and communication networks) can be modeled as dynamic networks with nodes representing e…

math.PR2017

Persistence of sums of correlated increments and clustering in cellular automata

Hanbaek Lyu, David Sivakoff

We consider sums of increments given by a functional of a stationary Markov chain. Letting be the first return time of the partial sums process to , under general…

cs.CG2017★ 2 cited

A quest to unravel the metric structure behind perturbed networks

Srinivasan Parthasarathy, David Sivakoff, Minghao Tian +1

Graphs and network data are ubiquitous across a wide spectrum of scientific and application domains. Often in practice, an input graph can be considered as an observed snapshot of…

math.PR2017★ 1 cited

Phase transition in one-dimensional excitable media with variable interaction range

Ander Aguirre, Hanbaek Lyu, David Sivakoff

We investigate two discrete models of excitable media on a one-dimensional integer lattice : the -color Cyclic Cellular Automaton (CCA) and the -color Firefly Cel…