Related papers: Non-intersecting squared Bessel paths and multiple…

In a previous paper we studied the double scaling limit of unitary random matrix ensembles of the form Z_{n,N}^{-1} |\det M|^{2\alpha} e^{-N \Tr V(M)} dM with \alpha > -1/2. The factor |\det M|^{2\alpha} induces critical eigenvalue behavior…

We consider a totally asymmetric exclusion process on the positive half-line. When particles enter in the system according to a Poisson source, Liggett has computed all the limit distributions when the initial distribution has an asymptotic…

We consider a variant of the continuous and discrete Ulam-Hammersley problems: we study the maximal length of an increasing path through a Poisson point process (or a Bernoulli point process) with the restriction that there must be minimal…

A family of random matrix ensembles interpolating between the GUE and the Ginibre ensemble of $n\times n$ matrices with iid centered complex Gaussian entries is considered. The asymptotic spectral distribution in these models is uniform in…

We study the totally asymmetric simple exclusion process with open boundaries in the high density and the low density phase. In the bulk of the two phases, we show that the process on a segment of length $N$ exhibits cutoff at order $N$,…

Intersection graphs of planar geometric objects such as intervals, disks, rectangles and pseudo-disks are well studied. Motivated by various applications, Butman et al. in SODA 2007 considered algorithmic questions in intersection graphs of…

We study $n$ non-intersecting Brownian motions, corresponding to the eigenvalues of an $n\times n$ Hermitian Brownian motion. At the boundary of their limit shape we find that only three universal processes can arise: the Pearcey process…

We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…

For any $\varepsilon > 0$, we give a polynomial-time $n^\varepsilon$-approximation algorithm for Max Independent Set in graphs of bounded twin-width given with an $O(1)$-sequence. This result is derived from the following time-approximation…

Let $X$ be a squared Bessel process. Following a Feynman-Kac approach, the Laplace transforms of joint laws of $(U, \int_0^{R_y}X_s^p\,ds)$ are studied where $R_y$ is the first hitting time of $y$ by $X$ and $U$ is a random variable…

We introduce and analyse a new family of multiple orthogonal polynomials of hypergeometric type with respect to two measures supported on the positive real line which can be described in terms of confluent hypergeometric functions of the…

Let $X=(X_t)_{t\geq 0}$ be a known process and $T$ an unknown random time independent of $X$. Our goal is to derive the distribution of $T$ based on an iid sample of $X_T$. Belomestny and Schoenmakers (2015) propose a solution based the…

We analyze the mixing behavior of the biased exclusion process on a path of length $n$ as the bias $\beta_n$ tends to $0$ as $n \to \infty$. We show that the sequence of chains has a pre-cutoff, and interpolates between the unbiased…

The purpose of this article is to develop a theory behind the occurrence of "path-integral" kernels in the study of extended determinantal point processes and non-intersecting line ensembles. Our first result shows how determinants…

A new stochastic process is introduced and considered - squared Bessel process with special stochastic time. The analogues of fundamental properties for Brownian motion are deduced for squared Bessel process. In particular an analogue of…

We devise a polynomial-time approximation scheme for the classical geometric problem of finding an approximate short path amid weighted regions. In this problem, a triangulated region P comprising of n vertices, a positive weight associated…

Iterated Bessel processes R^\gamma(t), t>0, \gamma>0 and their counterparts on hyperbolic spaces, i.e. hyperbolic Brownian motions B^{hp}(t), t>0 are examined and their probability laws derived. The higher-order partial differential…

This paper is about the problem of finding a shortest $s$-$t$ path using at most $h$ edges in edge-weighted graphs. The Bellman--Ford algorithm solves this problem in $O(hm)$ time, where $m$ is the number of edges. We show that this running…

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with…

We propose a Bayesian nonparametric model for mixed-type bounded data, where some variables are compositional and others are interval-bounded. Compositional variables are non-negative and sum to a given constant, such as the proportion of…