VRRW on complete-like graphs: almost sure behavior (Q614128)
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: VRRW on complete-like graphs: almost sure behavior |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | VRRW on complete-like graphs: almost sure behavior |
scientific article |
Statements
VRRW on complete-like graphs: almost sure behavior (English)
0 references
27 December 2010
0 references
The authors study the vertex-reinforced random walk (VRRW) on complete-like graphs, i.e., complete graphs ornamented with finitely many leaves at each vertex. They combine martingale and large deviation techniques to prove that almost surely such VRRW spends positive and equal proportions of time on each of its nonleaf vertices. Previously [\textit{S. Volkov}, Ann. Probab. 29, No.~1, 66--91 (2001; Zbl 1031.60089)], it was shown that this behavior occurs only up to an event of positive probability. The convergence rate of the empirical occupation measure is studied as well.
0 references
vertex-reinforced random walks
0 references
complete graph
0 references
urn model
0 references
martingales
0 references
large deviations
0 references
0 references
