2 citations · 2 across the 2 of their papers we have counts for
4 papers
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…
Synchronizing non-deterministic finite automata
Henk Don, Hans Zantema
In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that Černý's conjecture generalizes to CNF…