email:  dsivakoff (at) stat.osu.edu 
office:  204A Cockins Hall 
My CV [Apr 2019]
Research
Interacting Particle Systems and Cellular Automata
An interacting particle system is a network of dynamic units in which the state of each vertex evolves stochastically in continuous time according to a local rule. Cellular automata are the deterministic, discrete time analogues of interacting particle systems. Both paradigms are commonly used as models for discrete, spatial processes, and we are typically interested in the emergence of global structure or longtime behavior as these systems evolve from a disordered initial state. Classically, the underlying topology is taken to be a lattice (such as ℤ^{d}) or an infinite tree, while more recently, researchers have focused on more heterogeneous stuctures, such as random graphs. I have studied a variety of systems, which include models for epidemics [11], coupled oscillators [17, 20], opinion spreading [4], ferromagnetic spin systems [16], and systems of ballistic and annihilating particles [15, 18]. The image to the left depicts the 8color cyclic cellular automaton [15] on a uniform random spanning tree of the 150 x 150 torus. Most vertices cease to be active early on, while rare regions of activity appear to nucleate and eventually force the entire graph to fluctuate.
An interacting particle system is a network of dynamic units in which the state of each vertex evolves stochastically in continuous time according to a local rule. Cellular automata are the deterministic, discrete time analogues of interacting particle systems. Both paradigms are commonly used as models for discrete, spatial processes, and we are typically interested in the emergence of global structure or longtime behavior as these systems evolve from a disordered initial state. Classically, the underlying topology is taken to be a lattice (such as ℤ^{d}) or an infinite tree, while more recently, researchers have focused on more heterogeneous stuctures, such as random graphs. I have studied a variety of systems, which include models for epidemics [11], coupled oscillators [17, 20], opinion spreading [4], ferromagnetic spin systems [16], and systems of ballistic and annihilating particles [15, 18]. The image to the left depicts the 8color cyclic cellular automaton [15] on a uniform random spanning tree of the 150 x 150 torus. Most vertices cease to be active early on, while rare regions of activity appear to nucleate and eventually force the entire graph to fluctuate.
Neighborhood growth models
This is a class of growth models in which an occupied subset of the vertices of a graph grows iteratively by including vertices whose neighborhoods contain certain patterns of occupied vertices. The simplest example is a threshold growth model called bootstrap percolation, which has a long history in both physics and mathematics. This model has received the most attention on lattices and trees with nearest neighbor connectivity. My collaborators and I initiated the study of bootstrap percolation [8] and more general neighborhood growth models [14] on subsets of the lattice with connectivity of the Hamming graph. In this setting we observe vastly different behavior than in the localconnectivity case, such as gradual phase transitions. I have also investigated bootstrap percolation on graphs with overlapping community structure [12,19], and observed that sharp, gradual and hybrid phase transitions are possible, depending on scaling between the intra and intercommunity connectivity and on the parity of the threshold parameter.
The effects of heterogeneity in the growth rule or environment remain poorly understood, and I recently analyzed a bootstrap percolation model in the presence of randomly placed obstacles [21]. In three dimensions and with occupation threshold 3, we use the technology of oriented surfaces to identify a blocking structure (image to the left courtesy of A. Holroyd), which prevents occupation of the origin when the density of obstacles exceeds the cube of the density of occupied sites.
Papers

Preprints and Submitted Manuscripts
 S. Chatterjee, D. Sivakoff and M. Wascher. The contact process with avoidance. [arXiv].
 J. Gravner, A. E. Holroyd and D. Sivakoff. Polluted bootstrap percolation in three dimensions. [arXiv].
 H. Lyu and D. Sivakoff. Synchronization of finitestate pulsecoupled oscillators on Z. [arXiv].
 J. Gravner and D. Sivakoff. Bootstrap percolation on the product of the twodimensional lattice with a Hamming square. Accepted in Annals of Applied Probability. [arXiv].
 M. Damron, J. Gravner, M. Junge, H. Lyu and D. Sivakoff. Parking on transitive unimodular graphs. Accepted in Annals of Applied Probability. [arXiv].
 H. Lyu and D. Sivakoff. Persistence of sums of correlated increments and clustering in cellular automata. Stochastic Processes and their Applications, 2019; 129(4), 11321152. [Journal].
 M. Damron, L. Petrov and D. Sivakoff. Coarsening model on ℤ^{d} with biased zeroenergy flips and an exponential large deviation bound for ASEP. Communications in Mathematical Physics, 2018; 362(1), 185217. [Journal].
 J. Gravner, H. Lyu and D. Sivakoff. Limiting behavior of 3color excitable media on arbitrary graphs. Annals of Applied Probability, 2018; 28(6), 33243357. [journal].
 J. Gravner, D. Sivakoff and E. Slivken. Neighborhood growth dynamics on the Hamming plane. Electronic Journal of Combinatorics, 2017; 24(4) #P4.29, 155. [journal].
 J. Gravner and D. Sivakoff. Nucleation scaling in jigsaw percolation. Annals of Applied Probability, 2017; 27(1), 395438. [journal].
 J. Gravner and D. Sivakoff. Bootstrap percolation on products of cycles and complete graphs. Electronic Journal of Probability, 2017; 22(29), 20pp. [journal].
 D. Sivakoff. Contact process on a graph with communities. ALEA: Latin American Journal of Probability and Statistics, 2017; 14, 931. [journal].
 C. D. Brummitt, S. Chatterjee, P. S. Dey and D. Sivakoff. Jigsaw percolation: What social networks can collaboratively solve a puzzle? Annals of Applied Probability, 2015; 25(4), 20132038. [journal].
 M. D. Ryser, K. McGoff, D. P. Herzog, D. Sivakoff and E. R. Myers. Impact of coveragedependent marginal costs on optimal HPV vaccination strategies. Epidemics, June 2015; 11, 32–47. [journal].
 J. Gravner, C. Hoffman, J. Pfeiffer and D. Sivakoff. Bootstrap percolation on the Hamming torus. Annals of Applied Probability, 2015; 25(1), 287323. [journal].
 I. Matic and D. Sivakoff. Excited deterministic walk in a random environment. Electronic Journal of Probability, 2015; 20(44), 19pp. [journal].
 S. Magura, V. Pong, R. Durrett and D. Sivakoff. Two evolving social network models. ALEA: Latin American Journal of Probability and Statistics, 2015; 12(2), 699715. [journal]
 D. Sivakoff. Site percolation on the ddimensional Hamming torus. Combinatorics, Probability and Computing, 2014; 23(02), 290315. [journal].
 R. Durrett, J. P. Gleeson, A. L. Lloyd, P. J. Mucha, F. Shi, D. Sivakoff, J. E. S. Socolar and C. Varghese. Graph fission in an evolving voter model. Proceedings of the National Academy of Science, 2012; 109(10), 36823687. [journal].
 S. Parthasarathy, D. Sivakoff, M. Tian and Y. Wang. A quest to unravel the metric structure behind perturbed networks. Proceedings of Symposium on Computational Geometry (SoCG), 2017. [arXiv].
 Y. Wang, A. Chakrabarti, D. Sivakoff and S. Parthasarathy. Hierarchical change point detection on dynamic networks. Proceedings of ACM WebSci, 2017. [arXiv].
 Y. Wang, A. Chakrabarti, D. Sivakoff and S. Parthasarathy. Fast change point detection on dynamic social networks. Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2017. [arXiv].
Journal Articles
Conference Proceedings
Teaching
I have taught:
At OSU:
Real Analysis I (Math 6211) in Autumn 2017
Probability (Stat 7201) in Autumn 2013, 2015, 2016, 2018
Probability (Math 4530) in Autumn 2016 (2 sections)
Probability I (Math 6251) in Autumn 2015
Real Analysis II (Math 6212) in Spring 2015
Mathematical Statistics I (Stat 4201) in Spring 2014
At Duke:
Probability (Math 135) in Fall 2011, Spring 2012
Advanced Calculus (Math 431) in Spring 2013
Applied Stochastic Processes (Math 541) in Fall 2012
Stochastic Networks Graduate MiniCourse (Math 690) in Fall 2012