Related papers: Growth models, random matrices and Painleve transc…
We consider the behavior of extremal particles in $K$-symmetric exclusion on $\mathbb{Z}$ when the process starts from certain infinite-particle step configurations where there are no particles to the right of a maximal one. In such a…
We recast the persistence probability for the spin located at the origin of a half-space arbitrarily $m$-magnetized Glauber-Ising chain as a Fredholm Pfaffian gap probability generating function with a sech-kernel. This is then spelled out…
A construction as a growth process for sampling of the uniform infinite planar triangulation (UIPT), defined in a previous paper, is given. The construction is algorithmic in nature, and is an efficient method of sampling a portion of the…
The paper deals with a new class of random walks strictly connected with the Pareto distribution. We consider stochastic processes in the sense of generalized convolution or weak generalized convolution following the idea given in [1]. The…
The transition density of a diffusion process does not admit an explicit expression in general, which prevents the full maximum likelihood estimation (MLE) based on discretely observed sample paths. A\"{\i}t-Sahalia [J. Finance 54 (1999)…
Consider a realization of a Poisson process in R^2 with intensity 1 and take a maximal up/right path from the origin to (N,N) consisting of line segments between the points, where maximal means that it contains as many points as possible.…
The sequence of random probability measures $\nu_n$ that gives a path of length $n$, $\unsur{n}$ times the sum of the random weights collected along the paths, is shown to satisfy a large deviations principle with good rate function the…
The universality of the directed polymer model and the analogous KPZ equation is supported by numerical simulations using non-Gaussian random probability distributions in two, three and four dimensions. It is shown that although in the…
In these lecture notes I will give a pedagogical introduction to some common aspects of 4 different problems: (i) random matrices (ii) the longest increasing subsequence problem (also known as the Ulam problem) (iii) directed polymers in…
We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We develop dependent hierarchical normalized random measures and apply them to dynamic topic modeling. The dependency arises via superposition, subsampling and point transition on the underlying Poisson processes of these measures. The…
We study various methods to generate ensembles of random density matrices of a fixed size N, obtained by partial trace of pure states on composite systems. Structured ensembles of random pure states, invariant with respect to local unitary…
These notes describe several loop soup models and their {\it universal behaviour} in dimensions greater or equal to 3. These loop models represent certain classical or quantum statistical mechanical systems. These systems undergo phase…
We show that, for a stationary version of Hammersley's process, with Poisson sources on the positive x-axis and Poisson sinks on the positive y-axis, the variance of the length of a longest weakly North--East path $L(t,t)$ from $(0,0)$ to…
We describe the behavior of the expectation of the maximum for a random assignment process built upon a square matrix with independent entries. Under mild assumptions on the underlying distribution, the answer is expressed in terms of its…
The Renyi, Shannon and Fisher spreading lengths of the classical or hypergeometric orthogonal polynomials, which are quantifiers of their distribution all over the orthogonality interval, are defined and investigated. These…
We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…
We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with parameter $0<q(n)\leq…
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…