Proof of the WARM whisker conjecture for neuronal connections

DOI10.1063/1.4978683zbMath1387.60143OpenAlexW2604583671WikidataQ47866923 ScholiaQ47866923MaRDI QIDQ4642578

No author found.

Publication date: 23 May 2018

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/801dfcc13de69c13392410cd927a238dce3c567a

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Neural networks for/in biological studies, artificial life and related topics (92B20) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (7)

Extremal linkage networks ⋮ Infinite WARM graphs III: strong reinforcement regime ⋮ MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023 ⋮ Absence of warm percolation in the very strong reinforcement regime ⋮ Weakly reinforced Pólya urns on countable networks ⋮ Finding geodesics on graphs using reinforcement learning ⋮ The trace-reinforced ants process does not find shortest paths

Cites Work

• Unnamed Item
• Strongly reinforced Pólya urns with graph-based competition
• A survey of random processes with reinforcement
• Pólya urns with immigration at random times
• Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs
• Strongly Vertex-Reinforced-Random-Walk on the complete graph
• A generalized Pólya's urn with graph based interactions
• Infinite WARM graphs III: strong reinforcement regime

This page was built for publication: Proof of the WARM whisker conjecture for neuronal connections