Random and automatic walks

MaRDI QIDQ3128795zbMATH OpenFDO

Authors F. Michel Dekking

Publication date 20 April 1997

zbMATH Keywords

automatic walksergodicityescapeopen problemsrandom walksrecurrencescaling and self-similarity

Mathematics Subject Classification ID

Automata sequences (11B85) Sums of independent random variables; random walks (60G50)

Review text

Various ordered and random systems are interpreted as walks on graphs and investigated for properties such as recurrence, escape, scaling and self-similarity, and ergodicity. A number of conjectures and open problems in this direction are addressed. For the entire collection see [Zbl 0880.00009].

Recommendations

• Random walks on graphs: ideas, techniques and results
• Recurrence and collisions of random walks
• scientific article; zbMATH DE number 1971718
• Random walks systems on complete graphs
• scientific article; zbMATH DE number 2046058

Cited in

(7)

• Automatic walks
• Statistics of persistent events: From random walks to phase ordering
• DISCRETE SCATTERING AND SIMPLE AND NONSIMPLE FACE-HOMOGENEOUS RANDOM WALKS
• scientific article; zbMATH DE number 1971718 (Why is no real title available?)
• A note on spider walks
• Spectral analysis of transition operators, automata groups and translation in BBS
• Random walks systems on complete graphs

This page was built for publication: Random and automatic walks

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