On the meeting of random walks on random DFA

We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with respect to the generation of the graph, the meeting time of the two walks is stochastically dominated by a geometric random variable of rate $(1+o(1))n^{-1}$, uniformly over their starting locations. Further, we prove that this upper bound is typically tight, i.e., it is also a lower bound when the locations of the two walks are selected uniformly at random. Our work takes inspiration from a recent conjecture by Fish and Reyzin in the context of computational learning, the connection with which is discussed.

[1]  Matteo Quattropani,et al.  Rankings in directed configuration models with heavy tailed in-degrees , 2021, ArXiv.

[2]  W S McCulloch,et al.  A logical calculus of the ideas immanent in nervous activity , 1990, The Philosophy of Artificial Intelligence.

[3]  Matteo Quattropani,et al.  A probabilistic proof of Cooper and Frieze's First Visit Time Lemma , 2021, Latin American Journal of Probability and Mathematical Statistics.

[4]  Guillem Perarnau,et al.  Minimum stationary values of sparse random directed graphs , 2020, ArXiv.

[5]  P. Caputo,et al.  Mixing time trichotomy in regenerating dynamic digraphs , 2019, Stochastic Processes and their Applications.

[6]  P. Caputo,et al.  Stationary distribution and cover time of sparse directed configuration models , 2019, Probability Theory and Related Fields.

[7]  Matteo Quattropani,et al.  Mixing time of PageRank surfers on sparse random digraphs , 2019, Random Struct. Algorithms.

[8]  Yuval Peres,et al.  Random walks on graphs: new bounds on hitting, meeting, coalescing and returning , 2018, ANALCO.

[9]  C. Landim,et al.  From Coalescing Random Walks on a Torus to Kingman’s Coalescent , 2018, Journal of Statistical Physics.

[10]  Lev Reyzin,et al.  Open Problem: Meeting Times for Learning Random Automata , 2017, COLT.

[11]  Thomas Sauerwald,et al.  On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? , 2016, SODA.

[12]  Justin Salez,et al.  Cutoff at the “entropic time” for sparse Markov chains , 2016, Probability Theory and Related Fields.

[13]  Justin Salez,et al.  Random walk on sparse random digraphs , 2015, Probability Theory and Related Fields.

[14]  Borja Balle,et al.  Diameter and Stationary Distribution of Random $r$-out Digraphs , 2015, Electron. J. Comb..

[15]  Cyril Nicaud,et al.  Fast Synchronization of Random Automata , 2014, APPROX-RANDOM.

[16]  Colin Cooper,et al.  Coalescing Random Walks and Voting on Connected Graphs , 2012, SIAM J. Discret. Math..

[17]  Roberto Imbuzeiro Oliveira,et al.  Mean field conditions for coalescing random walks , 2011, 1109.5684.

[18]  Roberto Imbuzeiro Oliveira,et al.  On the coalescence time of reversible random walks , 2010, 1009.0664.

[19]  Alan M. Frieze,et al.  Multiple Random Walks in Random Regular Graphs , 2009, SIAM J. Discret. Math..

[20]  Alan M. Frieze,et al.  The cover time of the giant component of a random graph , 2008, Random Struct. Algorithms.

[21]  Alan M. Frieze,et al.  The Cover Time of Random Regular Graphs , 2005, SIAM J. Discret. Math..

[22]  A. Frieze,et al.  The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence , 2004, Combinatorics, Probability and Computing.

[23]  D. Aldous.  Markov chains with almost exponential hitting times , 1982 .

[24]  Dana Angluin,et al.  A Note on the Number of Queries Needed to Identify Regular Languages , 1981, Inf. Control..

[25]  Cyril Nicaud,et al.  The Černý Conjecture Holds with High Probability , 2019, J. Autom. Lang. Comb..

[26]  Clifford D. Smyth,et al.  A simple solution to the k-core problem , 2007 .

[27]  G. Palm.  Warren McCulloch and Walter Pitts: A Logical Calculus of the Ideas Immanent in Nervous Activity , 1986 .

[28]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .