Related papers: Random gap processes and asymptotically complete s…

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

We define a growing model of random graphs. Given a sequence of nonnegative integers $\{d_n\}_{n=0}^\infty$ with the property that $d_i\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\ldots$ by the…

We consider several stochastic service systems, and study the asymptotic behavior of the moments of various quantities that have application to models for random interval graphs and algorithms for searching for an idle server or empty…

Based on the primes less than $4 \times 10^{18}$, Oliveira e Silva et al. (2014) conjectured an asymptotic formula for the sum of the $k$th power of the gaps between consecutive primes less than a large number $x$. We show that the…

We consider the problem of sequentially testing a simple null hypothesis versus a composite alternative hypothesis that consists of a finite set of densities. We study sequential tests that are based on thresholding of mixture-based…

We consider the self-normalized sums $T_{n}=\sum_{i=1}^{n}X_{i}Y_{i}/\sum_{i=1}^{n}Y_{i}$, where ${Y_{i} : i\geq 1}$ are non-negative i.i.d. random variables, and ${X_{i} : i\geq 1} $ are i.i.d. random variables, independent of ${Y_{i} : i…

For a numerical sequence ${a_n}$ satisfying broad assumptions on its "behaviour on average" and a random walk $S_n=\xi_1 +...+\xi_n$ with i.i.d. jumps $\xi_j$ with positive mean $\mu$, we establish the asymptotic behaviour of the sums…

We consider a multi-type Galton-Watson branching processes, where the largest in magnitude positive eigenvalue $\rho$ of the first moments matrix is close to unity. Specifically, we examine the random vector representing the number of…

In the paper, we investigate the asymptotic behaviors of the randomly weighted sums with upper tail asymptotically independent increments under new conditions without requiring moment assumptions on random weights.An application of the…

Spatially homogeneous random walks in $(\mathbb{Z}_{+})^{2}$ with non-zero jump probabilities at distance at most 1, with non-zero drift in the interior of the quadrant and absorbed when reaching the axes are studied. Absorption…

We consider the probability of two large gaps (intervals without eigenvalues) in the bulk scaling limit of the Gaussian Unitary Ensemble of random matrices. We determine the multiplicative constant in the asymptotics. We also provide the…

Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erd\H{o}s-R\'enyi graphs, are usually derived with very specific choices for defining parameters. The question arises to which…

This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…

We investigate the properties of a sequential Monte Carlo method where the particle weight that appears in the algorithm is estimated by a positive, unbiased estimator. We present broadly-applicable convergence results, including a central…

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…

Exact formulas are derived for the probability density functions of the sum and difference of two independent non-central gamma distributed random variables, with both series and integral representations of the density presented. These…

Let $G$ be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex $u$ can be moved to a neighbouring vertex $v$, provided that the weight on $v$ is at least as large as the weight on $u$. The total…

For $0 < \lambda < 1$ and $n \rightarrow \infty$ pick uniformly at random $\lambda n$ vectors in $\{0,1\}^n$ and let $C$ be the orthogonal complement of their span. Given $0 < \gamma < \frac12$ with $0 < \lambda < h(\gamma)$, let $X$ be the…

We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…