Related papers: Strong law of large numbers on graphs and groups

Given $n$ independent random marked $d$-vectors (points) $X_i$ distributed with a common density, define the measure $\nu_n=\sum_i\xi_i$, where $\xi_i$ is a measure (not necessarily a point measure) which stabilizes; this means that $\xi_i$…

The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…

We present a Law of Large Numbers principle for uniformly continuous random quantum dynamical semigroups. Random iterates of independent copies of these semigroups are shown to be Chernoff equivalent to the quantum dynamical semigroup by…

We prove a strong law of large numbers for a class of strongly mixing processes. Our result rests on recent advances in understanding of concentration of measure. It is simple to apply and gives finite-sample (as opposed to asymptotic)…

In this paper we analyze the practical implications of Szemer\'edi's regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a heuristic algorithm to find regular partitions. Our…

In this paper we extend the notion of $\varphi$-mixing to set-valued random sequences that take values in the family of closed subsets of a Banach space. Several strong laws of large numbers for such $\varphi$-mixing sequences are stated…

Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…

The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…

Let $f(n)$ be a strongly additive complex valued arithmetic function. Under mild conditions on $f$, we prove the following weighted strong law of large numbers: if $ X,X_1,X_2,... $ is any sequence of integrable i.i.d. random variables,…

We establish the strong law of large numbers for Betti numbers of random \v{C}ech complexes built on $\mathbb R^N$-valued binomial point processes and related Poisson point processes in the thermodynamic regime. Here we consider both the…

The strong law of large numbers for linear combinations of functions of order statistics ($L$-statistics) based on weakly dependent random variables is proven. We also establish the Glivenko--Cantelli theorem for $\phi$-mixing sequences of…

In a recent paper, Chernikov and Starchenko prove that graphs defined in distal theories have strong regularity properties, generalizing previous results about graphs defined by semi-algebraic relations. We give a shorter, purely…

We prove a general noncommutative law of large numbers. This applies in particular to random walks on any locally finite homogeneous graph, as well as to Brownian motion on Riemannian manifolds which admit a compact quotient. It also…

This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the theory of large deviations. This is followed…

This paper establishes complete convergence for weighted sums and the Marcinkiewicz--Zygmund-type strong law of large numbers for sequences of negatively associated and identically distributed random variables $\{X,X_n,n\ge1\}$ with general…

We prove a strong law of large numbers for random sets with bounded and closed values contained in an arbitrary (not necessarily separable) Banach space. We make use of a notion of convergence of sets introduced by Fisher, which is stronger…

Szemeredi's regularity lemma is one instance in a family of regularity lemmas, replacing the definition of density of a graph by a more general coefficient. Recently, Fan Chung proved another instance, a regularity lemma for clustering…

Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…

Strong laws of large numbers are established for random fields with weak or strong dependence. These limit theorems are applicable to random fields with heavy-tailed distributions including fractional stable random fields. The conditions…

In 1969 V.V.~Petrov found a new sufficient condition for the applicability of the strong law of large numbers to sequences of independent random variables. He proved the following theorem: let $\{X_{n}\}_{n=1}^{\infty}$ be a sequence of…