Random walks systems on complete graphs

DOI10.1007/S00574-006-0028-8MaRDI QIDQ870473zbMATH OpenOpenAlexFDO

Authors Oswaldo S. M. Alves, Elcio Lebensztayn, Mauricio Z. Martinez, Fábio P. Machado

Publication date 12 March 2007

Published in Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00574-006-0028-8

zbMATH Keywords

mean field approximation

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Applications of branching processes (60J85) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• Random walks systems with finite lifetime on \(\mathbb {Z}\)
• Limit theorems for an epidemic model on the complete graph
• scientific article; zbMATH DE number 1001514
• Random walks systems with killing on ℤ
• Random walks on graphs: ideas, techniques and results

Cited in

(11)

• A connection between a system of random walks and rumor transmission
• Random walks on complete multipartite graphs
• Information Transmission under Random Emission Constraints
• scientific article; zbMATH DE number 1001514 (Why is no real title available?)
• Frog models on trees through renewal theory
• Out-of-equilibrium random walks
• Laws of large numbers for the frog model on the complete graph
• The lifetime of a random set
• The coverage ratio of the frog model on complete graphs
• On the mean absorption time of multiple coalescing particles with removal at previously visited vertices
• Critical conditions for the coverage of complete graphs with the frog model

This page was built for publication: Random walks systems on complete graphs

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