Graph-based Pólya's urn: completion of the linear case (Q2797922)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph-based Pólya's urn: completion of the linear case |
scientific article; zbMATH DE number 6562013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph-based Pólya's urn: completion of the linear case |
scientific article; zbMATH DE number 6562013 |
Statements
1 April 2016
0 references
Pólya's urn
0 references
balanced bipartite graphs
0 references
almost sure convergence
0 references
gradient-like system
0 references
reinforcement
0 references
stochastic approximation algorithm
0 references
Graph-based Pólya's urn: completion of the linear case (English)
0 references
0.9346906542778016
0 references
0.9037028551101683
0 references
0.82382732629776
0 references
0.7861072421073914
0 references
0.7827533483505249
0 references
