Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Strong law of large numbers on graphs and groups

Strong law of large numbers on graphs and groups 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Strong law of large numbers on graphs and groups

Loading next page...
 
/lp/de-gruyter/strong-law-of-large-numbers-on-graphs-and-groups-uYCjfKhDlI
Publisher
de Gruyter
Copyright
Copyright © 2011 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc.2011.004
Publisher site
See Article on Publisher Site

Abstract

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 - Cryptologyde Gruyter

Published: May 1, 2011

There are no references for this article.