Limit distributions of certain characteristics of random automaton graphs

@article{Grusho1973LimitDO,
  title={Limit distributions of certain characteristics of random automaton graphs},
  author={Alexander A. Grusho},
  journal={Mathematical notes of the Academy of Sciences of the USSR},
  year={1973},
  volume={14},
  pages={633-637}
}
  • A. Grusho
  • Published 1 July 1973
  • Mathematics
  • Mathematical notes of the Academy of Sciences of the USSR
The paper deals with the following characteristics of random automaton graphs: the numbers of recurrent and nonrecurrent vertices, the number and dimensions of the components of strong connectivity, and the number of vertices attainable from a given one. Limit theorems are found for the distributions of these characteristics. 
The graph structure of a deterministic automaton chosen at random
TLDR
It is shown that whp the part outside the giant contains at most a few short cycles and mostly consists of overlapping tree-like structures, thus the directed acyclic graph (DAG) of a random digraph is almost the same as the digraph with the giant contracted into one vertex.
Ergodicity of Random Walks on Random DFA
TLDR
This paper shows that for typical DFA this random walk induces an ergodic Markov chain, and it is shown that the same result applies to DFA obtained by minimizing typical D FA.
Learning Random Regular Graphs
TLDR
This paper presents a comprehensive study of the problem of learning random regular graphs from random paths in the statistical query model, and proves positive results on the convergence of random walks on many types of random regular graph.
Diameter and Stationary Distribution of Random $r$-out Digraphs
TLDR
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 state complexity of random DFAs
Learning a Random DFA from Uniform Strings and State Information
TLDR
This paper proposes a computationally efficient algorithm for learning and recovering a random DFA from uniform input strings and state information in the statistical query model and presents a theoretical guarantee on the maximum absolute error of the algorithm.
Learning Regular Languages and Automaton Graphs
TLDR
Learning Regular Languages and Automaton Graphs is a course to learn regular languages and automaton graphs through the lens of graph theory.