Related papers: Random Additions in Urns of Integers

We investigate the connections between patterns in permutations and forbidden configurations in restricted elections, first discovered by Lackner and Lackner, in order to enhance the approach initiated by the two mentioned authors. More…

We consider the averaging process on an infinite connected graph with bounded degree and independent, identically distributed starting values or initial opinions. Assuming that the law of the initial opinion of a vertex has a finite second…

The four moment theorem asserts, roughly speaking, that the joint distribution of a small number of eigenvalues of a Wigner random matrix (when measured at the scale of the mean eigenvalue spacing) depends only on the first four moments of…

We consider the distinct elements problem, where the goal is to estimate the number of distinct colors in an urn containing $ k $ balls based on $n$ samples drawn with replacements. Based on discrete polynomial approximation and…

This work is devoted to P\'olya-Young urns, a class of periodic P\'olya urns of importance in the analysis of Young tableaux. We provide several extension of the previous results of Banderier, Marchal and Wallner [Ann. Prob. (2020)] on…

We consider transient random walks on a strip in a random environment. The model was introduced by Bolthausen and Goldsheid [Comm. Math. Phys. 214 (2000) 429--447]. We derive a strong law of large numbers for the random walks in a general…

The superconvergence phenomenon is shown for products of free, identically distributed random variables. We also show that a certain Holder regularity, first demonstrated by Biane for the density of a free additive convolution with a…

We consider a type of pull voting suitable for discrete numeric opinions which can be compared on a linear scale, for example, 1 ('disagree strongly'), 2 ('disagree'), $\ldots,$ 5 ('agree strongly'). On observing the opinion of a random…

Stochastic approximation algorithms have been the subject of an enormous body of literature, both theoretical and applied. Recently, Laruelle and Pag\`es (2013) presented a link between the stochastic approximation and response-adaptive…

We introduce the notion of a random mean generated by a random variable and give a construction of its expected value. We derive some sufficient conditions under which strong laws of large numbers and some limit theorems hold for random…

We consider a system of urns of Polya-type, with balls of two colors; the reinforcement of each urn depends both on the content of the same urn and on the average content of all urns. We show that the urns synchronize almost surely, in the…

We consider the probability theory, and in particular the moment problem and universality theorems, for random groups of the sort of that arise or are conjectured to arise in number theory, and in related situations in topology and…

We consider diffraction at random point scatterers on general discrete point sets in $\R^\nu$, restricted to a finite volume. We allow for random amplitudes and random dislocations of the scatterers. We investigate the speed of convergence…

We study the problem of predicting numeric labels that are constrained to the integers or to a subrange of the integers. For example, the number of up-votes on social media posts, or the number of bicycles available at a public rental…

We consider a time-dependent version of a P\'olya urn containing black and white balls. At each time $n$ a ball is drawn from the urn at random and replaced in the urn along with $\sigma_n$ additional balls of the same colour. The…

We prove a central limit theorem for a sequence of random variables whose means are ambiguous and vary in an unstructured way. Their joint distribution is described by a set of measures. The limit is (not the normal distribution and is)…

We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $\mu^{(r)}(d)$ as the density of integers $n\in…

The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance)…

A functional central limit theorem is established for weighted occupancy processes of the Karlin model. The weighted occupancy processes take the form of, with $D_{n,j}$ denoting the number of urns with $j$-balls after the first $n$…

We consider systems of interacting Generalized Friedman's Urns (GFUs) having irreducible mean replacement matrices. The interaction is modeled through the probability to sample the colors from each urn, that is defined as convex combination…