Related papers: Restricted Maximum of Non-Intersecting Brownian Br…
Bollob\'as-Riordan random pairing model of a preferential attachment graph $G_m^n$ is studied. Let $\{W_j\}_{j\le mn+1}$ be the process of sums of independent exponentials with mean $1$. We prove that the degrees of the first…
This work examines various statistical distributions in connection with random Vandermonde matrices and their extension to $d$--dimensional phase distributions. Upper and lower bound asymptotics for the maximum singular value are found to…
We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…
We consider $N$ non-intersecting Brownian bridges conditioned to stay below a fixed threshold. We consider a scaling limit where the limit shape is tangential to the threshold. In the large $N$ limit, we determine the limiting distribution…
We study the line ensembles of non-crossing Brownian bridges above a hard wall, each tilted by the area of the region below it with geometrically growing pre-factors. This model, which mimics the level lines of the $(2+1)$D SOS model above…
Let $U$ be a Haar distributed matrix in $\mathbb U(n)$ or $\mathbb O (n)$. In a previous paper, we proved that after centering, the two-parameter process \[T^{(n)} (s,t) = \sum_{i \leq \lfloor ns \rfloor, j \leq \lfloor nt\rfloor}…
We study the least-energy way to reshape a probability distribution when motion is constrained to a horizontal bundle, that is, optimal transport and distribution steering in sub-Riemannian geometry, motivated by density control over…
In this paper we study fluctuations of extreme particles of nonintersecting Brownian bridges starting from $a_1\leq a_2\leq \cdots \leq a_n$ at time $t=0$ and ending at $b_1\leq b_2\leq \cdots\leq b_n$ at time $t=1$, where…
Functionals of Brownian bridge arise as limiting distributions in nonparametric statistics. In this paper we will give a derivation of distributions of extrema of the Brownian bridge based on excursion theory for Brownian motion. Only the…
We investigate the statistics of the largest eigenvalue, $\lambda_{\rm max}$, in an ensemble of $N\times N$ large ($N\gg 1$) sparse adjacency matrices, $A_N$. The most attention is paid to the distribution and typical fluctuations of…
Consider~\(n\) nodes~\(\{X_i\}_{1 \leq i \leq n}\) independently distributed in the unit square~\(S,\) each according to a distribution~\(f.\) Nodes~\(X_i\) and~\(X_j\) are joined by an edge if the Euclidean distance~\(d(X_i,X_j)\) is less…
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probability, T is precisely the minimum between delta and…
We observe that the probability distribution of the Brownian motion with drift $-c \frac x {1-t}$ where $c\not =1$ is singular with respect to that of the classical Brownian bridge measure on $[0,1]$, while their Cameron-Martin spaces are…
We present schemes for simulating Brownian bridges on complete and connected Lie groups and homogeneous spaces. We use this to construct an estimation scheme for recovering an unknown left- or right-invariant Riemannian metric on the Lie…
We investigate the extreme value statistics of a one-dimensional Brownian motion (with the diffusion constant $D$) during a time interval $\left[0, t \right]$ in the presence of a reflective boundary at the origin, starting from a positive…
A well-known result across information theory, machine learning, and statistical physics shows that the maximum entropy distribution under a mean constraint has an exponential form called the Gibbs-Boltzmann distribution. This is used for…
In this paper, we introduce an extension of a Brownian bridge with a random length by including uncertainty also in the pinning level of the bridge. The main result of this work is that unlike for deterministic pinning point, the bridge…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
As an example for the fast calculation of distributional parameters of Gaussian processes, we propose a new Monte Carlo algorithm for the computation of quantiles of the supremum norm of weighted Brownian bridges. As it is known, the…
In this paper we study the problem of stopping a Brownian bridge $X$ in order to maximise the expected value of an exponential gain function. In particular, we solve the stopping problem $$\sup_{0\le \tau\le…