The trace-reinforced ants process does not find shortest paths

DOI10.5802/jep.188zbMath1485.60036OpenAlexW3174110581MaRDI QIDQ2118000

Daniel Kious, Cécile Mailler, Bruno Schapira

Publication date: 22 March 2022

Published in: Journal de l'École Polytechnique -- Mathématiques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5802/jep.188

zbMATH Keywords

stochastic approximationreinforced processesurn processes

Mathematics Subject Classification ID

Strong limit theorems (60F15) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items

MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly reinforced Pólya urns with graph-based competition
• A survey of random processes with reinforcement
• Vertex reinforced non-backtracking random walks: an example of path formation
• Weakly reinforced Pólya urns on countable networks
• Absence of warm percolation in the very strong reinforcement regime
• A generalized Pólya's urn with graph based interactions: convergence at linearity
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Graph-based Pólya’s urn: Completion of the linear case
• Probability on Trees and Networks
• Random Walk: A Modern Introduction
• Proof of the WARM whisker conjecture for neuronal connections
• A random hierarchical lattice: the series-parallel graph and its properties
• A generalized Pólya's urn with graph based interactions