The length distribution for burn-off chip-firing games on complete graphs

MaRDI QIDQ4604191zbMATH OpenFDO

Authors Dave Perkins, P. Mark Kayll

Publication date 23 February 2018

zbMATH Keywords

Markov chaincomplete graphlimiting distributionchip-firingburn-off gamegame-length probabilityrelaxed legal configuration

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Trees (05C05) Combinatorial probability (60C05) Limit theorems in probability theory (60F99) Enumeration in graph theory (05C30) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• On lengths of burn-off chip-firing games
• Properties of chip-firing games on complete graphs
• A chip-firing variation and a new proof of Cayley's formula
• Polynomial Bound for a Chip Firing Game on Graphs
• A chip-firing variation and a Markov chain with uniform stationary distribution

Cited in

(4)

• Combinatorial proof of an Abel-type identity
• A chip-firing variation and a new proof of Cayley's formula
• A chip-firing variation and a Markov chain with uniform stationary distribution
• On lengths of burn-off chip-firing games

This page was built for publication: The length distribution for burn-off chip-firing games on complete graphs

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