Related papers: Weak Laws in Geometric Probability
For a real or complex one-dimensional map satisfying a weak hyperbolicity assumption, we study the existence and statistical properties of physical measures, with respect to geometric reference measures. We also study geometric properties…
Let $k$ be a field, $V$ a $k$-vector space and $X$ be a subset of $V $. A function $f:X\to k$ is weakly polynomial of degree $\leq a$, if the restriction of $f$ on any affine subspace $L\subset X$ is a polynomial of degree $\leq a$. In this…
Vaidman pointed out the importance of modular values, and related the modular value of a Pauli spin operator to its weak value for specific coupling strengths [Phys. Rev. Lett. 105, 230401 (2010)]. It would be useful if this relationship is…
As the extension of uncorrelated single-valued random variables, set-valued case is studied in this paper. When the underlying space is of finite dimension, by using the support function, We shall prove the weak and strong laws of large…
Topological measures and deficient topological measures are defined on open and closed subsets of a topological space, generalize regular Borel measures, and correspond to (non-linear in general) functionals that are linear on singly…
We analyze the average of weak values over statistical ensembles of pre- and post-selected states. The protocol of weak values, proposed by Aharonov et al., is the result of a weak measurement conditional on the outcome of a subsequent…
The k-d tree was one of the first spatial data structures proposed for nearest neighbor search. Its efficacy is diminished in high-dimensional spaces, but several variants, with randomization and overlapping cells, have proved to be…
A weak measurement consists in coupling a system to a probe in such a way that constructive interference generates a large output. So far, only the average output of the probe and its variance were studied. Here, the characteristic function…
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…
We use an inequality of Sidorenko to show a general relation between local and global subgraph counts and degree moments for locally weakly convergent sequences of sparse random graphs. This yields an optimal criterion to check when the…
The empirical copula process plays a central role in the asymptotic analysis of many statistical procedures which are based on copulas or ranks. Among other applications, results regarding its weak convergence can be used to develop…
We show weak convergence of quantile and expectile processes to Gaussian limit processes in the space of bounded functions endowed with an appropriate semimetric which is based on the concepts of epi- and hypo convergence as introduced in…
In a digraph with $n$ vertices, a minuscule construct is a subdigraph with $m<<n$ vertices. We study the number of copies of a minuscule constructs in $k$ nearest neighbor ($k$NN) digraph of the data from a random point process in…
One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the…
The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This…
In the past decades, weak convergence theory for stochastic processes has become a standard tool for analyzing the asymptotic properties of various statistics. Routinely, weak convergence is considered in the space of bounded functions…
We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…
Under the unifying umbrella of a general result of Penrose & Yukich [Ann. Appl. Probab., (2003) 13, 277--303] we give laws of large numbers (in the $L^p$ sense) for the total power-weighted length of several nearest-neighbour type graphs on…
This paper develops Rio's method [C. R. Acad. Sci. Paris S\'{e}r. I Math., 1995] to prove the weak law of large numbers for maximal partial sums of pairwise independent random variables. The method allows us to avoid using the Kolmogorov…
The Cram\'er-Wold device characterises weak convergence of probability measures on $\mathbb{R}^d$ through convergence of all one-dimensional projected laws. We prove that, if the target projected laws are moment-determinate for…