On Distributions Computable by Random Walks on Graphs

DOI10.1137/S089548010343106XzbMath1081.65009OpenAlexW2040426645MaRDI QIDQ4652612

Dan Romik, Guy Kindler

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s089548010343106x

zbMATH Keywords

finite automatadistribution functionsrandom number generationrandom walks on graphs

Mathematics Subject Classification ID

Multivariate distribution of statistics (62H10) Sums of independent random variables; random walks (60G50) Probability distributions: general theory (60E05) Formal languages and automata (68Q45) Combinatorial probability (60C05) Algebraic theory of languages and automata (68Q70) Random number generation in numerical analysis (65C10)

Related Items (1)

Binary decompositions of probability densities and random-bit simulation

This page was built for publication: On Distributions Computable by Random Walks on Graphs