Related papers: Almost sure and moment convergence for triangular …
For the partial sums formed from a sequence of i.i.d. random variables having a finite absolute p'th moment for some p in (0,2), we extend the recent and striking discovery of Hechner and Heinkel (Journal of Theoretical Probability (2010))…
We study the almost sure convergence of the normalized columns in an infinite product of nonnegative matrices, and the almost sure rank one property of its limit points. Given a probability on the set of $2\times2$ nonnegative matrices,…
Strong converse theorems refer to the study of impossibility results in information theory. In particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing [Comm. Math. Phys, 334(3), 2014], which…
An urn scheme is a probabilistic model in which balls are placed into urns sequentially and independently of each other. All balls share the same probability distribution for hitting the urns. In the simplest case, there is a finite number…
We study an urn process with two urns, initialized with a ball each. Balls are added sequentially, the urn being chosen independently with probability proportional to the $\alpha^{th}$ power $(\alpha >1)$ of the existing number of balls. We…
We complete the study of the model introduced in [11]. It is a two-color urn model with multiple drawing and random (non-balanced) time-dependent reinforcement matrix. The number of sampled balls at each time-step is random. We identify the…
Interacting urns with exponential reinforcement were introduced and studied in Launay (2011). As its parameter $\rho$ tends to $\iy$, this reinforcement mechanism converges to the "generalized" reinforcement, in which the probability of…
Recently it has been shown that cumulants significantly simplify the analysis of multipartite weak measurements. Here we consider the mathematical structure that underlies this, and find that it can be formulated in terms of what we call…
The fringe of a B-tree with parameter $m$ is considered as a particular P\'olya urn with $m$ colors. More precisely, the asymptotic behaviour of this fringe, when the number of stored keys tends to infinity, is studied through the…
We study the approximability of Max Ones when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number…
This paper introduces and analyzes a particular class of Polya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color…
In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…
In previous papers, we studied the asymptotic behaviour of $S_N(A,X)=(2N+1)^{-d/2}\sum_{n \in A_N} X_n,$ where $X$ is a centered, stationary and weakly dependent random field, and $A_N=A \cap [-N,N]^d$, $A \subset \mathbb{Z}^d$. This leads…
We take a unified approach to central limit theorems for a class of irreducible urn models with constant replacement matrix. Depending on the eigenvalue, we consider appropriate linear combinations of the number of balls of different…
We give a short, self-contained, and elementary proof of the strong law of large numbers under a power law decay hypothesis for joint second moments. The result is related to the classical one by Lyons. However, we also provide a rate of…
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…
A new approach to Nori's weak Lefschetz theorem is described. The new approach, which involves the dbar-method, avoids moving arguments and gives much stronger results. In particular, it is proved that if X and Y are connected smooth…
Sanov's Theorem and the Conditional Limit Theorem (CoLT) are established for a multicolor Polya Eggenberger urn sampling scheme, giving the Polya divergence and the Polya extension to the Maximum Relative Entropy (MaxEnt) method. Polya…
The purpose of this article is to construct a toolbox, in Dynamical Systems, to support the idea that ``whenever we can prove a limit theorem in the classical sense for a dynamical system, we can prove a suitable almost-sure version based…
The present paper aims at describing in details the asymptotic composition of a class of d-colour P\'olya urn: namely balanced, tenable and irreducible urns. We decompose the composition vector of such urns according to the Jordan…