Related papers: Asymptotics for randomly reinforced urns with rand…

We consider a collection of weighted Euclidian random balls in R^d distributed according a determinantal point process. We perform a zoom-out procedure by shrinking the radii while increasing the number of balls. We observe that the…

We consider a version of the classical P\'olya urn scheme which incorporates innovations. The space $S$ of colors is an arbitrary measurable set. After each sampling of a ball in the urn, one returns $C$ balls of the same color and…

In this note we analyze how perturbations of a ball $\mathfrak{B}_r \subset \mathbb{R}^n$ behaves in terms of their first (non-trivial) Neumann and Dirichlet $\infty-$eigenvalues when a volume constraint $\\mathscr{L}^n(\Omega) =…

We give bounds for (central) moments for balanced P\'olya urns under very general conditions. In some cases, these bounds imply that moment convergence holds in earlier known results on asymptotic distribution. The results overlap with…

A consequence of de Finetti's representation theorem is that for every infinite sequence of exchangeable 0-1 random variables $(X_k)_{k\geq1}$, there exists a probability measure $\mu$ on the Borel sets of $[0,1]$ such that $\bar X_n =…

Let $\mathbb{P}_{\kappa}(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area $1$, are in convex position, that is, form the vertex set of a…

We study a multiple-urn version of the Ehrenfest model. In this setting, we denote the n urns by Urn 1 to Urn n, where n>=2. Initially, M balls are randomly placed in the n urns. At each subsequent step, a ball is selected and put into the…

This is a research endeavor in two parts. We study a class of balanced urn schemes on balls of two colours (say white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn, and ball addition rules are applied. We…

We propose an approach to analyze the asymptotic behavior of P\'olya urns based on the contraction method. For this, a new combinatorial discrete time embedding of the evolution of the urn into random rooted trees is developed. A…

We study several exactly solvable Polya-Eggenberger urn models with a \emph{diminishing} character, namely, balls of a specified color, say $x$ are completely drawn after a finite number of draws. The main quantity of interest here is the…

We have discovered a "little" gap in our proof of the sharp conjecture that in $\mathbb{R}^n$ with volume and perimeter densities $r^m$ and $r^k$, balls about the origin are uniquely isoperimetric if $0 < m \leq k - k/(n+k-1)$, that is, if…

For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…

A tournament $H$ is said to force quasirandomness if it has the property that a sequence $(T_n)_{n\in \mathbb{N}}$ of tournaments of increasing orders is quasirandom if and only if the homomorphism density of $H$ in $T_n$ tends to…

Given a non-negative random variable $W$ and $\theta>0$, let the generalized Dickman transformation map the distribution of $W$ to that of $$ W^*=_d U^{1/\theta}(W+1), $$ where $U \sim {\cal U}[0,1]$, a uniformly distributed variable on the…

We consider a random geometric graph $G(\chi_n, r_n)$, given by connecting two vertices of a Poisson point process $\chi_n$ of intensity $n$ on the unit torus whenever their distance is smaller than the parameter $r_n$. The model is…

We study the random binary contingency tables with non-uniform margin. More precisely, for parameters $n,\delta,B,C$, we consider $X=(X_{ij})$ with $X_{ij}\in \lbrace 0,1\rbrace$, the random binary contingency tables whose first…

The unit ball random geometric graph $G=G^d_p(\lambda,n)$ has as its vertices $n$ points distributed independently and uniformly in the $d$-dimensional unit ball, with two vertices adjacent if and only if their $l_p$-distance is at most…

Let $\{B(\xi_n,r_n)\}_{n\ge1}$ be a sequence of random balls whose centers $\{\xi_n\}_{n\ge1}$ is a stationary process, and $\{r_n\}_{n\ge1}$ is a sequence of positive numbers decreasing to 0. Our object is the random covering set…

A classical P\'olya urn scheme is a Markov process whose evolution is encoded by a replacement matrix $(R_{i,j})_{1\leq i,j\leq d}$. At every discrete time-step, we draw a ball uniformly at random, denote its colour $c$, and replace it in…

The aim of this work is to expose some asymptotic series associated to some expressions involving the volume of the n-dimensional unit ball. All proofs and the methods used for improving the classical inequalities announced in the final…