The graph structure of a deterministic automaton chosen at random

  title={The graph structure of a deterministic automaton chosen at random},
  author={Xing Shi Cai and Luc Devroye},
  journal={Random Structures \& Algorithms},
An n‐state deterministic finite automaton over a k‐letter alphabet can be seen as a digraph with n vertices which all have k labeled out‐arcs. Grusho (Publ Math Inst Hungarian Acad Sci 5 (1960), 17–61). proved that whp in a random k‐out digraph there is a strongly connected component of linear size, i.e., a giant, and derived a central limit theorem. We show that whp the part outside the giant contains at most a few short cycles and mostly consists of tree‐like structures, and present a new… 
Diameter and Stationary Distribution of Random $r$-out Digraphs
This work establishes that for every r � 2, there existsr > 0 such that diam(D(n,r) = (1 + �r + o(1)))log r n, and determines the asymptotic behaviour of max and min, the maximum and the minimum values of the stationary distribution.
The diameter of the directed configuration model
We show that the diameter of the directed configuration model with $n$ vertices rescaled by $\log n$ converges in probability to a constant. Our assumptions are the convergence of the in- and
The giant component of the directed configuration model revisited
It is proved that a law of large numbers for the order and size of the largest strongly connected component in the directed configuration model is proved.
Heterogeneous Hybrid Neural Network for Modeling Spatially Distributed Destructive Processes
The method of modeling spatial distributed destructive processes using the proposed hybrid neural networks is presented and is intended for modeling dynamic systems with different types of simultaneously arising interacting processes with respect to their spatiotemporal aspects.
Minimum stationary values of sparse random directed graphs
The stationary distribution of the simple random walk on the directed configuration model with bounded degrees is considered and it is shown that the minimum positive stationary value is whp $n^{-(1+C+o(1)$ for some constant $C \ge 0$ determined by the degree distribution.


Distribution of the number of accessible states in a random deterministic automaton
A simple algorithm for random uniform generation of accessible deterministic and complete automata of size n of expected complexity O(n p n), which matches the best methods known so far and is the first solution of linear expected complexity.
Counting strongly‐connected, moderately sparse directed graphs
  • B. Pittel
  • Mathematics
    Random Struct. Algorithms
  • 2013
A sharp asymptotic formula for the number of strongly connected digraphs on n labelled vertices with m arcs, under the condition m ‐ n ≫ n2/3, m = O(n), is obtained; this provides a partial solution
Asymptotic normality of the k-core in random graphs
It is shown that the fluctuations around the deterministic limit converge to a Gaussian law above and near the threshold, and to a non-normal law at the threshold.
Asymptotic enumeration of strongly connected digraphs by vertices and edges
An asymptotic formula is derived for the number of strongly connected digraphs with n vertices and m arcs (directed edges), valid for m - n ∞ as n∞ provided m = O(nlog n), which fills the gap between Wright's results and the long-known threshold for m.
Random Graphs
The probability that a random multigraph is simple. II
  • S. Janson
  • Mathematics
    Journal of Applied Probability
  • 2014
Consider a random multigraph G * with given vertex degrees d 1,…, d n , constructed by the configuration model. We give a new proof of the fact that, asymptotically for a sequence of such multigraphs
The Probability That a Random Multigraph is Simple
  • S. Janson
  • Mathematics
    Combinatorics, Probability and Computing
  • 2009
It is shown that, asymptotically for a sequence of such multigraphs with the number of edges $\tfrac12\sumd\to\infty$, the probability that the multigraph is simple stays away from 0 if and only if $\sumdd=O bigpar{\sumd}$.
On the evolution of random graphs
(n) k edges have equal probabilities to be chosen as the next one . We shall 2 study the "evolution" of such a random graph if N is increased . In this investigation we endeavour to find what is the
Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
It is proved that, for both random digraphs, the joint distribution of the number of vertices and number of arcs in the giant strong component is asymptotically Gaussian with the same mean vector n (c) and two distinct 2 2 covariance matrices.
Digraphs - theory, algorithms and applications
Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science, and it will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology.