Pages that link to "Item:Q341627"
From MaRDI portal
The following pages link to Strongly reinforced Pólya urns with graph-based competition (Q341627):
Displaying 14 items.
- Weakly reinforced Pólya urns on countable networks (Q2064809) (← links)
- Finding geodesics on graphs using reinforcement learning (Q2090610) (← links)
- The trace-reinforced ants process does not find shortest paths (Q2118000) (← links)
- Vertex reinforced random walks with exponential interaction on complete graphs (Q2132542) (← links)
- Extremal linkage networks (Q2135579) (← links)
- Absence of warm percolation in the very strong reinforcement regime (Q2240813) (← links)
- Nonlinear randomized urn models: a stochastic approximation viewpoint (Q2274219) (← links)
- Phase transitions in non-linear urns with interacting types (Q2676930) (← links)
- Proof of the WARM whisker conjecture for neuronal connections (Q4642578) (← links)
- Interacting urns on a finite directed graph (Q5880991) (← links)
- Infinite WARM graphs III: strong reinforcement regime (Q6039285) (← links)
- MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023 (Q6076082) (← links)
- Multi-colour competition with reinforcement (Q6616035) (← links)
- Positive reinforced generalized time-dependent Pólya urns via stochastic approximation (Q6633163) (← links)
