Related papers: On Dirichlet eigenvectors for neutral two-dimensio…
This paper provides full classification of dynamics for continuous time Markov chains (CTMCs) on the non-negative integers with polynomial transition rate functions. Such stochastic processes are abundant in applications, in particular in…
We consider a simple but important class of metastable discrete time Markov chains, which we call perturbed Markov chains. Basically, we assume that the transition matrices depend on a parameter $\varepsilon$, and converge as $\varepsilon$.…
Chatterjee (2016) proved, as an application of his general framework relating superconcentration and chaos, that after the entries of an $n \times n$ matrix drawn from the Gaussian unitary ensemble undergo an entrywise Ornstein-Uhlenbeck…
A two-offspring branching annihilating random walk model, with finite reaction rates, is studied in one-dimension. The model exhibits a transition from an active to an absorbing phase, expected to belong to the $DP2$ universality class…
We study the asymptotic behavior of the principal eigenvector and eigenvalue of the random conductance Laplacian in a large domain of $\mathbb{Z}^d$ ($d\geq 2$) with zero Dirichlet condition. We assume that the conductances $w$ are positive…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
We extend the Dirichlet principle to non-reversible Markov processes on countable state spaces. We present two variational formulas for the solution of the Poisson equation or, equivalently, for the capacity between two disjoint sets. As an…
Consider $D$ random systems that are modeled by independent $N\times N$ complex Hermitian Wigner matrices. Suppose they are lying on a circle and the neighboring systems interact with each other through a deterministic matrix $A$. We prove…
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.…
Adaptive Markov chains are an important class of Monte Carlo methods for sampling from probability distributions. The time evolution of adaptive algorithms depends on past samples, and thus these algorithms are non-Markovian. Although there…
We consider a Markov chain $(x_n)$ whose kernel is indexed by a scaling parameter $\gamma>0$, refered to as the step size. The aim is to analyze the behavior of the Markov chain in the doubly asymptotic regime where $n\to\infty$ then…
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…
The Kuramoto model was recently extended to arbitrary dimensions by reinterpreting the oscillators as particles moving on the surface of unit spheres in a D-dimensional space. Each particle is then represented by a D-dimensional unit…
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…
Non-Hermitian random matrices provide a useful framework for understanding universal characteristics of dissipative quantum chaotic systems with loss or gain. We consider a model of two such system represented by two independent $N\times N$…
We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via…
A discrete time branching process where the offspring distribution is generation-dependent, and the number of reproductive individuals is controlled by a random mechanism is considered. This model is a Markov chain but, in general, the…
The aim of this paper is to study some continuous-time bivariate Markov processes arising from group representation theory. The first component (level) can be either discrete (quasi-birth-and-death processes) or continuous (switching…
It is proven that the eigenvalue process of Dyson's random matrix process of size two becomes non-Markov if the common coefficient $1/\sqrt{2}$ in the non-diagonal entries is replaced by a different positive number.
We consider the adjacency matrix associated with a graph that describes transitions between $2^{N}$ states of the discrete Preisach memory model. This matrix can also be associated with the last-in-first-out inventory management rule. We…