Related papers: Growth models, random matrices and Painleve transc…
The problem of estimating the parameters of a linear regression model $Z(s,t)=m_1g_1(s,t)+ \cdots + m_pg_p(s,t)+U(s,t)$ based on observations of $Z$ on a spatial domain $G$ of special shape is considered, where the driving process $U$ is a…
In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic…
We follow the evolution with sample thickness, of intensity statistics for localized light transmitted through layered media in a crossover from one to three dimensions occasioned by transverse disorder. The probability distribution of…
We introduce the headway exclusion process which is an exclusion process with $N$ particles on the one-dimensional discrete torus with $L$ sites with jump rates that depend only on the distance to the next particle in the direction of the…
We study the asymptotic behavior of the partition function and the correlation kernel in random matrix ensembles of the form $\frac{1}{Z_n} \big|\det \big( M^2-tI \big)\big|^{\alpha} e^{-n\operatorname{Tr} V(M)}dM$, where $M$ is an $n\times…
Superslow diffusion, i.e., the long-time diffusion of particles whose mean-square displacement (variance) grows slower than any power of time, is studied in the framework of the decoupled continuous-time random walk model. We show that this…
The extended Airy kernel describes the space-time correlation functions for the Airy process, which is the limiting process for a polynuclear growth model. The Airy functions themselves are given by integrals in which the exponents have a…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
We study the model of the totally asymmetric exclusion process with generalized update, which compared to the usual totally asymmetric exclusion process, has an additional parameter enhancing clustering of particles. We derive the exact…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
We introduce the notion of Bartlett spectral measure for isometrically invariant random measures on proper metric commutative spaces. When the underlying Gelfand pair corresponds to a higher-rank, connected, simple matrix Lie group with…
In this paper, we study a certain linear statistics of the unitary Laguerre ensembles, motivated in part by an integrable quantum field theory at finite temperature. It transpires that this is equivalent to the characterization of a…
We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or…
Time-homogeneous Markov chains are often used as disease progression models in studies of cost-effectiveness and optimal decision-making. Maximum likelihood estimation of these models can be challenging when data are collected at a time…
We determine the stationary two-point correlation function of the one-dimensional KPZ equation through the scaling limit of a solvable microscopic model, the polynuclear growth model. The equivalence to a directed polymer problem with…
The tacnode process is a universal behavior arising in nonintersecting particle systems and tiling problems. For Dyson Brownian bridges, the tacnode process describes the grazing collision of two packets of walkers. We consider such a Dyson…
In this paper we are interested in a version of the All-pairs Shortest Paths problem (APSP) that fits neither in the exact nor in the approximate case. We define a measure of centrality of a shortest path, related to the ``importance'' of…
The distribution function for the first eigenvalue spacing in the Laguerre unitary ensemble of finite size may be expressed in terms of a solution of the fifth Painleve transcendent. The generating function of a certain discontinuous linear…