Strong law of large numbers on graphs and groups (Q2882826)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6031529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong law of large numbers on graphs and groups |
scientific article; zbMATH DE number 6031529 |
Statements
Strong law of large numbers on graphs and groups (English)
0 references
7 May 2012
0 references
probabiliy measures on metric spaces
0 references
random vertices
0 references
mean-sets of vertices
0 references
strong law of large numbers
0 references
Chebyshev inequality
0 references
Chernoff bound
0 references
configuration of mean-sets
0 references
free group
0 references
shift search problem
0 references
0 references
0.9081106
0 references
0.87914777
0 references
0.87796384
0 references
0.87292314
0 references
A random vertex \(x\) in a locally finite graph is assumed to have finite expected squared distance to any vertex \(v\) in the graph. The mean-set \(Ex\) of \(x\) is defined as the set of minimizers \(v\) of the expected squared distance. For a sample sequence of \(n\) i.i.d. random vertices, let \(Sn\) be the set of minimizers for the average of the \(n\) squared distances. The convergence of \(Sn\) is investigated when \(Ex\) consists of one or several vertices having positive probabilities. Limes superior of \(Sn\) is shown to be equal to \(Ex\) with probability one. Chebyshev and Chernoff bounds are also given for the probability that \(Sn\) is not included in \(Ex\).
0 references
