Related papers: Random matrix minor processes related to percolati…
This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…
In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…
A time-dependent finite-state Markov chain that uses doubly stochastic transition matrices, is considered. Entropic quantities that describe the randomness of the probability vectors, and also the randomness of the discrete paths, are…
We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…
We study directed last-passage percolation on the planar square lattice whose weights have general distributions, or equivalently, queues in series with general service distributions. Each row of the last passage model has its own randomly…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
We consider the eigenvalues and eigenvectors of small rank perturbations of random $N\times N$ matrices. We allow the rank of perturbation $M$ increases with $N$, and the only assumption is $M=o(N)$. In both additive and multiplicative…
Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
The diffusion and bootstrap percolation models were studied in regular random and Erd\H{o}s-R\'{e}nyi networks using the modified Newman-Ziff algorithms. We calculated the percolation threshold and the order parameter of the percolation…
This contribution to the proceedings of the Cracow meeting on `Applications of Random Matrix Theory' summarizes a series of studies, some old and others more recent on financial applications of Random Matrix Theory (RMT). We first review…
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
It has been observed that the statistical distribution of the eigenvalues of random matrices possesses universal properties, independent of the probability law of the stochastic matrix. In this article we find the correlation functions of…
The use of higher-order stochastic processes such as nonlinear Markov chains or vertex-reinforced random walks is significantly growing in recent years as they are much better at modeling high dimensional data and nonlinear dynamics in…
We consider the eigenvectors of the principal minor of dimension $n< N$ of the Dyson Brownian motion in $\mathbb{R}^{N}$ and investigate their asymptotic overlaps with the eigenvectors of the full matrix in the limit of large dimension. We…
We study last passage percolation in a half-quadrant, which we analyze within the framework of Pfaffian Schur processes. For the model with exponential weights, we prove that the fluctuations of the last passage time to a point on the…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
In this work, we study a class of random matrices which interpolate between the Wigner matrix model and various types of patterned random matrices such as random Toeplitz, Hankel, and circulant matrices. The interpolation mechanism is…
In this paper, we consider the singular values and singular vectors of finite, low rank perturbations of large rectangular random matrices. Specifically, we prove almost sure convergence of the extreme singular values and appropriate…