Related papers: Restricted Maximum of Non-Intersecting Brownian Br…

Let $T$ be a finite tree graph, $T^N$ be the Cartesian power graph of $T$, and $d^N$ be the graph distance metric on $T^N$. Also let \[ \mathbb S_r^N(x) := \{v \in T^N: d^N(x,v) = r\} \] be the sphere of radius $r$ centered at $x$ and $M$…

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

We study matricial approximations of master fields we constructed in a previous work. These approximations (in non-commutative distribution) are obtained by extracting blocks of a Brownian unitary diffusion (with entries in $\mathbb{R},…

We consider three different models of N non-intersecting Brownian motions on a line segment [0,L] with absorbing (model A), periodic (model B) and reflecting (model C) boundary conditions. In these three cases we study a properly normalized…

We consider the optimal stopping problem for a Gauss-Markov process conditioned to adopt a prescribed terminal distribution. By applying a time-space transformation, we show it is equivalent to stopping a Brownian bridge pinned at a random…

We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube…

We study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at…

We consider a one dimensional L\'evy bridge x_B of length n and index 0 < \alpha < 2, i.e. a L\'evy random walk constrained to start and end at the origin after n time steps, x_B(0) = x_B(n)=0. We compute the distribution P_B(A,n) of the…

In this article the statistical properties of symmetrical random matrices whose elements are drawn from a q-parametrized non-extensive statistics power-law distribution are investigated. In the limit as q->1 the well known Gaussian…

We study the correlations between the maxima $m$ and $M$ of a Brownian motion (BM) on the time intervals $[0,t_1]$ and $[0,t_2]$, with $t_2>t_1$. We determine exact forms of the distribution functions $P(m,M)$ and $P(G = M - m)$, and…

For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…

We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…

Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…

We consider tightness for families of non-colliding Brownian bridges above a hard wall, which are subject to geometrically growing self-potentials of tilted area type. The model is introduced in order to mimic level lines of $2+1$ discrete…

We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…

In this paper non-asymptotic exact rearrangement invariant norm estimates are derived for the maximum distribution of the family elements of some rearrangement invariant (r.i.) space over unbounded measure in the entropy terms and in the…

We consider a variant of the radial spanning tree introduced by Baccelli and Bordenave. Like the original model, our model is a tree rooted at the origin, built on the realization of a planar Poisson point process. Unlike it, the paths of…

In this article we study the convex hull spanned by the union of trajectories of a standard planar Brownian motion, and an independent standard planar Brownian bridge. We find exact values of the expectation of perimeter and area of such a…

In the context of order statistics of discrete time random walks (RW), we investigate the statistics of the gap, $G_n$, and the number of time steps, $L_n$, between the two highest positions of a Markovian one-dimensional random walker,…

The spread of a graph $G$ is the difference $\lambda_1 - \lambda_n$ between the largest and smallest eigenvalues of its adjacency matrix. Breen, Riasanovsky, Tait and Urschel recently determined the graph on $n$ vertices with maximum spread…