Balanced allocation on graphs: a random walk approach (Q2817876)
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: Balanced allocation on graphs: a random walk approach |
scientific article; zbMATH DE number 7167821
- Balanced allocation on graphs: A random walk approach
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Balanced allocation on graphs: a random walk approach |
scientific article; zbMATH DE number 7167821 |
|
Statements
Balanced Allocation on Graphs: A Random Walk Approach (English)
0 references
Balanced allocation on graphs: A random walk approach (English)
0 references
2 September 2016
0 references
14 February 2020
0 references
maximum load
0 references
balls-into-bins model
0 references
\(d\)-regular graph
0 references
balls-into-bins models
0 references
balanced allocation
0 references
nonbacktracking random walks
0 references
0.9596649408340454
0 references
0.8651517033576965
0 references
0.8591315746307373
0 references
0.8494963049888611
0 references
0.8460344672203064
0 references
