Related papers: Affinity-dependent bound on the spectrum of stocha…
We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…
Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between…
We consider the symmetric inclusion process on a general finite graph. Our main result establishes universal upper and lower bounds for the spectral gap of this interacting particle system in terms of the spectral gap of the random walk on…
We consider the correlation functions of eigenvalues of a unidimensional chain of large random hermitian matrices. An asymptotic expression of the orthogonal polynomials allows to find new results for the correlations of eigenvalues of…
The spectrum of the non-hermitian asymmetric XXZ-chain with additional non-diagonal boundary terms is studied. The lowest lying eigenvalues are determined numerically. For the ferromagnetic and completely asymmetric chain that corresponds…
We derive a finite-sample probabilistic bound on the parameter estimation error of a system identification algorithm for Linear Switched Systems. The algorithm estimates Markov parameters from a single trajectory and applies a variant of…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…
We propose a method to approximate continuous-time, continuous-state stochastic processes by a discrete-time Markov chain defined on a nonuniform grid. Our method provides exact moment matching for processes whose first and second moments…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…
Using spectral embedding based on the signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In…
We study the problem of approximating the eigenspectrum of a symmetric matrix $\mathbf A \in \mathbb{R}^{n \times n}$ with bounded entries (i.e., $\|\mathbf A\|_{\infty} \leq 1$). We present a simple sublinear time algorithm that…
We propose to study echo dynamics in a random matrix framework, where we assume that the perturbation is time independent, random and orthogonally invariant. This allows to use a basis in which the unperturbed Hamiltonian is diagonal and…
Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
We show bounds on total variation and $L^{\infty}$ mixing times, spectral gap and magnitudes of the complex valued eigenvalues of a general (non-reversible non-lazy) Markov chain with a minor expansion property. This leads to the first…
We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, such as reachability and full linear temporal logic. The main idea is that we monitor each simulation run on the…
We study the limiting behavior of smooth linear statistics of the spectrum of random permutation matrices in the mesoscopic regime, when the permutation follows one of the Ewens measures on the symmetric group. If we apply a smooth enough…