概率论
In this paper, we present a technically simple method to establish upper bounds on the expected injective norm of real and complex random tensors. Our approach is somewhat analogous to the moment method in random matrix theory, and is based…
Given n independent Bernoulli(p) random variables X_i, i = 1, ..., n, representing the opinions of individuals connected by an underlying random k-regular graph G_n on {1, ..., n}, we show that when conditioned on an atypical empirical…
We consider a class of random permutations of the interval $[-n,n]$, in which points are typically displaced a distance $O(W)$. We show the cycles are localized on the scale $W^3$, with an exponentially decaying tail bound. Analogous to…
Single-server queues with customer abandonment arise in call centers and many service systems, but steady-state performance measures remain analytically intractable beyond Markovian assumptions. This paper develops Robust Queueing (RQ)…
Quadratic Wiener functionals are investigated systematically through transformations of order one on the Wiener space with the help of Malliavin calculus. The bi-directional relationship between quadratic Wiener functionals and…
We consider stochastic lattice gases with stationary product weights and a polynomial perturbation vanishing with the system size that leads to condensation. If the density of particles exceeds a critical value the system phase separates…
For an arbitrary diffusion process $X$ with time-homogeneous drift and variance parameters $\mu(x)$ and $\sigma^2(x)$, let $V_\varepsilon$ be $1/\varepsilon$ times the total time $X(t)$ spends in the strip…
We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree…
In this paper, we study the uniform random covering problem in general metric space $(X,d)$. Let $\omega=(\omega_n)_{n\in\mathbb N}$ be a sequence of independent identically distributed random variables on $(X,\mu)$, and…
In parallel-server systems with a single stream of arrivals (a.k.a. load balancing), Join-the-Shortest-Queue (JSQ) is a popular routing algorithm. There is extensive literature studying this system in various asymptotic regimes, but all…
Aldous' spectral gap conjecture, proven by Caputo, Liggett and Richthammer, states the following: for any set of transpositions in the symmetric group $\mathrm{Sym}(n)$, the spectral gap of the corresponding random walk on the group -- an…
In this paper, we investigate the asymptotic behavior of individual-based models describing the evolution of a population structured by a real trait, subject to selection and mutation. We consider two different sets of assumptions: first,…
We carry out the asymptotic analysis of repulsive ensembles of N particles which are discrete analogues of continuous 1d log-gases or beta-ensembles of random matrix theory. The ensembles that we study have several groups of particles which…
We study the fluctuation behavior of individual eigenvalues of kernel matrices arising from dense graphon-based random graphs. Under minimal integrability and boundedness assumptions on the graphon, we establish distributional limits for…
In this paper, we derive the asymptotic distribution of the number of copies of a fixed graph $H$ in a random graph $G_n$ sampled from a sparse graphon model. Specifically, we provide a refined analysis that separates the contributions of…
Binomial distributions capture the probabilities of `heads' outcomes when a (biased) coin is tossed multiple times. The coin may be identified with a distribution on the two-element set {0,1}, where the 1 outcome corresponds to `head'. One…
We introduce and analyze a novel class of inverse problems for stochastic dynamics: Given the ergodic invariant measure of a stochastic process governed by a nonlinear stochastic ordinary or partial differential equation (SODE or SPDE), we…
We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…
We establish a general framework to study the rate of convergence of a Euler type approximation scheme with decreasing time steps to the invariant measure, for a general class of stochastic systems. The error is measured in general…
It is well known that a Lorenz curve, derived from the distribution function of a random variable, can itself be viewed as a probability distribution function of a new random variable [4]. In a previous work of ours [26], we proved the…