4 citations · 16 across the 18 of their papers we have counts for
18 papers
Random walks on with metastable Gaussian distribution caused by linear drift with application to the contact process on the complete graph
O. S. Awolude, E. Cator, H. Don
We study random walks on which have a linear (or almost linear) drift towards 0 in a range around 0. This drift leads to a metastable Gaussian distribution centered at…
An OSSS-type inequality for uniformly drawn subsets of fixed size
Jacob van den Berg, Henk Don
The OSSS inequality [O'Donnell, Saks, Schramm and Servedio, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), Pittsburgh (2005)] gives an upper bound for the…
Extremal Binary PFAs with Small Number of States
Stijn Cambie, Michiel de Bondt, Henk Don
The largest known reset thresholds for DFAs are equal to , where is the number of states. This is conjectured to be the maximum possible. PFAs (with partial transition…
A lower bound for point-to-point connection probabilities in critical percolation
J. van den Berg, H. Don
Consider critical site percolation on with . We prove a lower bound of order for point-to-point connection probabilities, where is the dist…
Counting symbol switches in synchronizing automata
Henk Don, Hans Zantema
Instead of looking at the lengths of synchronizing words as in Černý's conjecture, we look at the switch count of such words, that is, we only count the switches from one letter to…
Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs
Eric Cator, Henk Don
We introduce a method to prove metastability of the contact process on Erdős-Rényi graphs and on configuration model graphs. The method relies on uniformly bounding the total infec…