The probabilistic abacus

DOI10.1007/BF00590021MaRDI QIDQ1216103zbMATH OpenWikidataFDO

Authors Arthur Engel

Publication date 1975

Published in Educational Studies in Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01)

Cited in

(14)

• Compatible recurrent identities of the sandpile group and maximal stable configurations
• A note on the Abelian sandpile in \(\mathbb Z^d\)
• Dynamic graph models and their properties
• Goldbug variations
• Chip-firing games on directed graphs
• Root system chip-firing. I: Interval-firing
• Why does the probabilistic abacus work?
• Discrete analog computing with rotor-routers
• A greedy chip‐firing game
• Generalized ARRIVAL problem for rotor walks in path multigraphs
• The chip-firing game
• A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case
• Reviews
• Passing the Buck and Firing Fibonacci: Adventures with the Stochastic Abacus

This page was built for publication: The probabilistic abacus

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