The probabilistic abacus
From MaRDI portal
Publication:1216103
DOI10.1007/BF00590021zbMath0303.60056WikidataQ56603006 ScholiaQ56603006MaRDI QIDQ1216103
Publication date: 1975
Published in: Educational Studies in Mathematics (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (14)
Dynamic graph models and their properties ⋮ A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case ⋮ A greedy chip‐firing game ⋮ Compatible recurrent identities of the sandpile group and maximal stable configurations ⋮ Reviews ⋮ Chip-firing games on directed graphs ⋮ A note on the Abelian sandpile in \(\mathbb Z^d\) ⋮ Passing the Buck and Firing Fibonacci: Adventures with the Stochastic Abacus ⋮ Goldbug variations ⋮ Why does the probabilistic abacus work? ⋮ Generalized ARRIVAL problem for rotor walks in path multigraphs ⋮ Root system chip-firing. I: Interval-firing ⋮ Discrete analog computing with rotor-routers ⋮ The chip-firing game
Cites Work
This page was built for publication: The probabilistic abacus
