Related papers: Spectral analysis of random-to-random Markov chain…
The embedding problem for Markov chains is a famous problem in probability theory and only partial results are available up till now. In this paper, we propose a variant of the embedding problem called the reversible embedding problem which…
The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…
We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the…
Markov matrices have an important role in the filed of stochastic processes. In this paper, we will show and prove a series of conclusions on Markov matrices and transformations rather than pay attention to stochastic processes although…
Often in applications such as rare events estimation or optimal control it is required that one calculates the principal eigen-function and eigen-value of a non-negative integral kernel. Except in the finite-dimensional case, usually…
We consider the problem of computing ratings using the results of games played between a set of n players, and show how this problem can be reduced to computing the positive eigenvectors corresponding to the dominant eigenvalues of certain…
This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models,…
The eigenvalues and eigenvectors of the connectivity matrix of complex networks contain information about its topology and its collective behavior. In particular, the spectral density $\rho(\lambda)$ of this matrix reveals important network…
In this paper we develop a statistical estimation technique to recover the transition kernel $P$ of a Markov chain $X=(X_m)_{m \in \mathbb N}$ in presence of censored data. We consider the situation where only a sub-sequence of $X$ is…
Markov chain Monte Carlo (MCMC) algorithms provide a very general recipe for estimating properties of complicated distributions. While their use has become commonplace and there is a large literature on MCMC theory and practice, MCMC users…
In this paper we investigate the kernel estimator of the density for a stationary reversible Markov chain. The proofs are based on a new central limit theorem for a triangular array of reversible Markov chains obtained under conditions…
The Eynard-Orantin recursion formula provides an effective tool for certain enumeration problems in geometry. The formula requires a spectral curve and the recursion kernel. We present a uniform construction of the spectral curve and the…
We consider the Gaussian ensembles of random matrices and describe the normal modes of the eigenvalue spectrum, i.e., the correlated fluctuations of eigenvalues about their most probable values. The associated normal mode spectrum is…
A deck of $n$ cards are shuffled by repeatedly taking off the top card, flipping it with probability $1/2$, and inserting it back into the deck at a random position. This process can be considered as a Markov chain on the group $B_n$ of…
Random feature maps are ubiquitous in modern statistical machine learning, where they generalize random projections by means of powerful, yet often difficult to analyze nonlinear operators. In this paper, we leverage the "concentration"…
Estimating the eigenvalues of a population covariance matrix from a sample covariance matrix is a problem of fundamental importance in multivariate statistics; the eigenvalues of covariance matrices play a key role in many widely…
Markov chains are fundamental models for stochastic dynamics, with applications in a wide range of areas such as population dynamics, queueing systems, reinforcement learning, and Monte Carlo methods. Estimating the transition matrix and…
Network representations are useful for describing the structure of a large variety of complex systems. Although most studies of real-world networks suppose that nodes are connected by only a single type of edge, most natural and engineered…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
In this article we study the fluctuation of linear statistics of eigenvalues of circulant, symmetric circulant, reverse circulant and Hankel matrices. We show that the linear spectral statistics of these matrices converges to the Gaussian…