Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/strong-law-of-large-numbers-on-graphs-and-groups-2F9QdcEGIc
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- de Gruyter
- Copyright
- ©© de Gruyter 2011
- ISSN
- 1867-1144
- eISSN
- 1869-6104
- DOI
- 10.1515/GCC.2011.004
- Publisher site
- See Article on Publisher Site
Abstract
We consider (graph-)group-valued random element क़ξ , discuss the properties of a mean-set 𝔼( क़ξ ), and prove the generalization of the strong law of large numbers for graphs and groups. Furthermore, we prove an analogue of the classical Chebyshev's inequality for क़ξ and Chernoff-like asymptotic bounds. In addition, we prove several results about configurations of mean-sets in graphs and discuss computational problems together with methods of computing mean-sets in practice and propose an algorithm for such computation.
Journal
Groups - Complexity - Cryptology – de Gruyter
Published: May 1, 2011
Keywords: Probability measures on graphs and groups; average; expectation; mean-set; strong law of large numbers; Chebyshev inequality; Chernoff bound; configuration of mean-sets; free group; shift search problem