Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board: Ciobanu, Laura / Conder, Marston / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura / Lohrey, Markus

CiteScore 2018: 0.80

SCImago Journal Rank (SJR) 2018: 0.368
Source Normalized Impact per Paper (SNIP) 2018: 1.061

Mathematical Citation Quotient (MCQ) 2018: 0.38

See all formats and pricing
More options …

Strong law of large numbers on graphs and groups

Natalia Mosina / Alexander Ushakov
Published Online: 2011-02-03 | DOI: https://doi.org/10.1515/gcc.2011.004


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.

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

About the article

Received: 2010-12-22

Published Online: 2011-02-03

Published in Print: 2011-05-01

Citation Information: Groups – Complexity – Cryptology, Volume 3, Issue 1, Pages 67–103, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc.2011.004.

Export Citation

Comments (0)

Please log in or register to comment.
Log in