相关论文: Restricted Maximum of Non-Intersecting Brownian Br…

We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…

We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish…

We show that at any location away from the spectral edge, the eigenvalues of the Gaussian unitary ensemble and its general beta siblings converge to Sine_beta, a translation invariant point process. This process has a geometric description…

Given a sequence \xi_1, \xi_2,... of X-valued, exchangeable random elements, let q(\xi^(n)) and p_m(\xi^(n)) stand for posterior and predictive distribution, respectively, given \xi^(n) = (\xi_1,..., \xi_n). We provide an upper bound for…

The free positive multiplicative Brownian motion $(h_t)_{t\geq0}$ is the large $N$ limit in non-commutative distribution of matrix geometric Brownian motion. It can be constructed by setting $h_t:=g_{t/2}g_{t/2}^*$, where $(g_t)_{t\geq0}$…

The problem of determining the joint probability distributions for correlated random variables with pre-specified marginals is considered. When the joint distribution satisfying all the required conditions is not unique, the "most unbiased"…

The Multimarginal Schr\"odinger Bridge (MSB) finds the optimal coupling among a collection of random vectors with known statistics and a known correlation structure. In the MSB formulation, this correlation structure is specified \emph{a…

Let $X_1, \ldots, X_n$ be independent random points drawn from an absolutely continuous probability measure with density $f$ in $\mathbb{R}^d$. Under mild conditions on $f$, we derive a Poisson limit theorem for the number of large…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…

The main message in this paper is that there are surprisingly many different Brownian bridges, some of them - familiar, some of them - less familiar. Many of these Brownian bridges are very close to Brownian motions. Somewhat loosely…

We consider one-dimensional branching Brownian motion in spatially random branching environment (BBMRE) and show that for almost every realisation of the environment, the distributions of the maximal particle of the BBMRE re-centred around…

In spite of its simplicity, the central limit theorem captures one of the most outstanding phenomena in mathematical physics, that of universality. While this classical result is well understood it is still not very clear what happens to…

Let $ n\geqslant t\geqslant 1$ and $ \mathcal{A}_1, \mathcal{A}_2, \ldots, \mathcal{A}_m \subseteq 2^{[n]}$ be non-empty families. We say that they are pairwise cross $t$-intersecting if $|A_i\cap A_j|\geqslant t$ holds for any $A_i\in…

We study the height of the maximal particle at time $t$ of a one dimensional branching Brownian motion with a space-dependent branching rate. The branching rate is set to zero in finitely many intervals (obstacles) of order $t$. We obtain…

For probability distributions on $\mathbb{R}^n$, we study the optimal sample size N = N(n,p) that suffices to uniformly approximate the pth moments of all one-dimensional marginals. Under the assumption that the marginals have bounded 4p…

We derive efficient recursive formulas giving the exact distribution of the largest eigenvalue for finite dimensional real Wishart matrices and for the Gaussian Orthogonal Ensemble (GOE). In comparing the exact distribution with the…

Given a directed graph $G$, the spread of $G$ is the largest distance between any two eigenvalues of its adjacency matrix. In 2022, Breen, Riasanovsky, Tait, and Urschel asked what $n$-vertex directed graph maximizes spread, and whether…

We consider the diffusion scaling limit of the one-dimensional vicious walker model of Fisher and derive a system of nonintersecting Brownian motions. The spatial distribution of $N$ particles is studied and it is described by use of the…

Inhomogeneous Erd\H{o}s-R\'enyi random graphs $\mathbb G_N$ on $N$ vertices in the non-dense regime are considered in this paper. The edge between the pair of vertices $\{i,j\}$ is retained with probability…