Random feedback shift registers and the limit distribution for largest cycle lengths
DOI10.1017/s0963548323000020zbMath1526.94016arXiv1903.09183OpenAlexW2922675531MaRDI QIDQ6085869
Richard Arratia, E. Rodney Canfield
Publication date: 8 November 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.09183
random permutationsshift register sequencesDeBruijn graphsnonlinear shift registersGEM limitlength of longest cyclePoisson-Diriclet limitrepeats in sequences
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- The interlace polynomial of a graph
- Continuity and weak convergence of ranked and size-biased permutations on the infinite simplex
- Two moments suffice for Poisson approximations: The Chen-Stein method
- On the distribution of allele frequencies in a diffusion model
- Probability approximations via the Poisson clumping heuristic
- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
- Logarithmic combinatorial structures: A probabilistic approach
- Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
- On the distribution of large prime divisors
- A Tale of Three Couplings: Poisson–Dirichlet and GEM Approximations for Random Permutations
- Generating a random permutation with random transpositions
- A note on the geometric series as a species frequency model
- On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer
- Real Analysis and Probability
This page was built for publication: Random feedback shift registers and the limit distribution for largest cycle lengths