The Hilbert-Galton board

MaRDI QIDQ4580331zbMATH OpenFDO

Authors A. Ayyer, Sanjay Ramassamy

Publication date 15 August 2018

Full work available at URL https://arxiv.org/abs/1711.08525, http://alea.impa.br/articles/v15/15-28.pdf

zbMATH Keywords

Markov chainGalton boardtriangle of numbers

Mathematics Subject Classification ID

Combinatorial probability (60C05) Continuous-time Markov processes on discrete state spaces (60J27) Exactly solvable dynamic models in time-dependent statistical mechanics (82C23)

Abstract: We introduce the Hilbert-Galton board as a variant of the classical Galton board. Balls fall into a row of bins at a rate depending on the bin, and at random times, each bin gets shifted one unit to the right and an empty bin is added to the left. We compute the stationary distribution of this Markov chain and show the existence of an enriched Markov chain on triangular arrays of numbers which projects down to the Hilbert-Galton board. We also define finite-ball projections of the Hilbert-Galton board, for which we compute the stationary distribution, the full spectrum and the grand coupling time.

Recommendations

• The Galton board: Limit theorems and recurrence
• Experimental, simulation and nonlinear dynamics of Galton's board
• Information dimension of Galton board
• Coupling any number of balls in the infinite-bin model
• Mathematical modelling and symbolic dynamics analysis of three new Galton board models

Cites work

• scientific article; zbMATH DE number 3789647 (Why is no real title available?)
• scientific article; zbMATH DE number 2051870 (Why is no real title available?)
• scientific article; zbMATH DE number 3049486 (Why is no real title available?)
• Combinatorial Markov chains on linear extensions
• Coupling any number of balls in the infinite-bin model
• Directed nonabelian sandpile models on trees
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
• Stochastic Sequences with a Regenerative Structure that May Depend Both on the Future and on the Past

Cited in

(3)

• The Galton board: Limit theorems and recurrence
• Information dimension of Galton board
• Experimental, simulation and nonlinear dynamics of Galton's board

This page was built for publication: The Hilbert-Galton board

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580331)