Related papers: Random matrix minor processes related to percolati…
Higher order interactions are increasingly recognised as a fundamental aspect of complex systems ranging from the brain to social contact networks. Hypergraph as well as simplicial complexes capture the higher-order interactions of complex…
Here we prove critical exponents for Random Connections Models (RCMs) with random marks. The vertices are given by a marked Poisson point process on $\mathbb{R}^d$ and an edge exists between any pair of vertices independently with a…
It is well-known that the largest eigenvalue of an $n\times n$ GUE matrix and the length of a longest increasing subsequence in a uniform random permutation of length $n$, both converge weakly to the GUE Tracy-Widom distribution as $n\to…
We study a Markov process on a system of interlacing particles. At large times the particles fill a domain that depends on a parameter $\eps> 0$. The domain has two cusps, one pointing up and one pointing down. In the limit…
A law of the iterated logarithm is established for the last passage times of directed percolation on rectangles in the plane over exponential or geometric independent random variables, rescaled to converge to the Tracy-Widom distribution.…
In the last decade there has been increasing interest in the fields of random matrices, interacting particle systems, stochastic growth models, and the connections between these areas. For instance, several objects appearing in the limit of…
The basic question in perturbation analysis of Markov chains is: how do small changes in the transition kernels of Markov chains translate to chains in their stationary distributions? Many papers on the subject have shown, roughly, that the…
We analyze the invariant distributions of continuous-time and discrete-time random walks on randomly weighted complete digraphs. These distributions correspond to the principal left eigenvectors of the associated random Markov generators…
Motivated by the importance ascribed to correlations in random matrices used to model phenomena in various scientific disciplines, we report how algebraic correlations between matrix elements affect the eigenvalue statistics and spectral…
It has been shown that the last passage time in certain symmetrized models of directed percolation can be written in terms of averages over random matrices from the classical groups $U(l)$, $Sp(2l)$ and $O(l)$. We present a theory of such…
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$,…
A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
The distribution of the ratios of consecutive eigenvalue spacings of random matrices has emerged as an important tool to study spectral properties of many-body systems. This article numerically investigates the eigenvalue ratios…
We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message passing approach to evaluate heterogeneous, node dependent probabilities of belonging to the giant or…
We consider the first-passage percolation problem on the random graph with vertex set N\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for…
Extremal spacings between eigenvalues of random unitary matrices of size N pertaining to circular ensembles are investigated. Explicit probability distributions for the minimal spacing for various ensembles are derived for N = 4. We study…
We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…
Let $\Psi_n$ be a product of $n$ independent, identically distributed random matrices $M$, with the properties that $\Psi_n$ is bounded in $n$, and that $M$ has a deterministic (constant) invariant vector. Assuming that the probability of…
We present new probabilistic and combinatorial identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic…