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

We study the one dimensional branching Brownian motion starting at the origin and investigate the correlation between the rightmost ($X_{\max}\geq 0$) and leftmost ($X_{\min} \leq 0$) visited sites up to time $t$. At each time step the…

We consider a directed random walk making either 0 or $+1$ moves and a Brownian bridge, independent of the walk, conditioned to arrive at point $b$ on time $T$. The Hamiltonian is defined as the sum of the square of increments of the bridge…

Consider a discrete-time martingale, and let $V^2$ be its normalized quadratic variation. As $V^2$ approaches 1, and provided that some Lindeberg condition is satisfied, the distribution of the rescaled martingale approaches the Gaussian…

For a Brownian bridge from $0$ to $y$ we prove that the mean of the first exit time from interval $(-h,h), \,\, h>0,$ behaves as $O(h^2)$ when $h \downarrow 0.$ Similar behavior is seen to hold also for the 3-dimensional Bessel bridge. For…

The maximum entropy method (MEM) and the Gaussian process (GP) regression, which are both well-suited for the treatment of inverse problems, are used to reconstruct net-baryon number distributions based on a finite number of cumulants of…

We present evidence for a conjectural relationship between absorption times for discrete Whittaker processes and maximal heights of non-intersecting Brownian bridges.

We study the phenomenon of "crowding" near the largest eigenvalue $\lambda_{\max}$ of random $N \times N$ matrices belonging to the Gaussian Unitary Ensemble (GUE) of random matrix theory. We focus on two distinct quantities: (i) the…

This paper proves joint convergence of the approximation error for several stochastic integrals with respect to local Brownian semimartingales, for nonequidistant and random grids. The conditions needed for convergence are that the Lebesgue…

Given two graphs $G$ and $H$, we investigate for which functions $p=p(n)$ the random graph $G_{n,p}$ (the binomial random graph on $n$ vertices with edge probability $p$) satisfies with probability $1-o(1)$ that every red-blue-coloring of…

Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $[n]:=\left\{1, \ldots, n\right\}$ with $m=m(n)$ edges. We show that in the sparse regime, when $m/n\leq 1$, with high probability the…

We analyze eigenvalues fluctuations of the Laplacian of various networks under the random matrix theory framework. Analyses of random networks, scale-free networks and small-world networks show that nearest neighbor spacing distribution of…

Gaussian Belief Propagation (BP) algorithm is one of the most important distributed algorithms in signal processing and statistical learning involving Markov networks. It is well known that the algorithm correctly computes marginal density…

Maximum entropy network ensembles have been very successful in modelling sparse network topologies and in solving challenging inference problems. However the sparse maximum entropy network models proposed so far have fixed number of nodes…

The study of spectrum statistics, such as the consecutive-gap ratio distribution, has revealed many interesting properties of many-body complex systems. Here we propose a two-parameter surmise expression for such distribution to describe…

In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also…

A watermelon is a set of $p$ Bernoulli paths starting and ending at the same ordinate, that do not intersect. In this paper, we show the convergence in distribution of two sorts of watermelons (with or without wall condition) to processes…

The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a $k$-element node set $C$ that maximizes the probability of detecting communication between a pair of nodes $s$ and $t$ chosen uniformly at…

This paper quantifies the asymptotic order of the largest singular value of a centered random matrix built from the path of a Block Markov Chain (BMC). In a BMC there are $n$ labeled states, each state is associated to one of $K$ clusters,…

We consider the problem of optimally stopping a Brownian bridge with an unknown pinning time so as to maximise the value of the process upon stopping. Adopting a Bayesian approach, we assume the stopper has a general continuous prior and is…

We consider a system of $N$ particles interacting through their empirical distribution on a finite state space in continuous time. In the formal limit as $N\to\infty$, the system takes the form of a nonlinear (McKean--Vlasov) Markov chain.…