Related papers: Mixing Time Bounds via the Spectral Profile

By projecting onto complex optical mode profiles, it is possible to estimate arbitrarily small separations between objects with quantum-limited precision, free of uncertainty arising from overlapping intensity profiles. Here we extend these…

Let $\{X_n\}_{n\in\N}$ be a Markov chain on a measurable space $\X$ with transition kernel $P$ and let $V:\X\r[1,+\infty)$. The Markov kernel $P$ is here considered as a linear bounded operator on the weighted-supremum space $\cB_V$…

Let $(X,d,\mu)$ be a $RCD^\ast(K, N)$ space with $K\in \mathbb{R}$ and $N\in [1,\infty]$. For $N\in [1,\infty)$, we derive the upper and lower bounds of the heat kernel on $(X,d,\mu)$ by applying the parabolic Harnack inequality and the…

In this paper, we establish novel concentration inequalities for additive functionals of geometrically ergodic Markov chains similar to Rosenthal inequalities for sums of independent random variables. We pay special attention to the…

Exponential random graphs are used extensively in the sociology literature. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than expected number of triangles and other small subgraphs.…

Fokker-Planck equations represent a suitable description of the finite-time behavior for a large class of particle systems as the size of the population tends to infinity. Recently, the theory of graph limits has been introduced in the…

In this paper we study the transition densities for a large class of non-symmetric Markov processes whose jumping kernels decay exponentially or subexponentially. We obtain their upper bounds which also decay at the same rate as their…

Markov chains are one of the well-known tools for modeling and analyzing stochastic systems. At the same time, they are used for constructing random walks that can achieve a given stationary distribution. This paper is concerned with…

We prove that for a sequence of finite vertex-transitive graphs of increasing sizes, the cover times are asymptotically concentrated if and only if the product of the spectral-gap and the expected cover time diverges. In fact, we prove this…

For continuous-time Markov jump processes on irreducible networks with time-independent rate constants, we employ a transition-based formalism to express the long-time precision of a single integrated current over an observable channel in…

We analyze the vertex Zff in the framework of models that add a new bottom quark in a nonsequential way and we evaluate the tree level contribution to LEP/SLC data $R_{b}$, $R_{l}$ and the total Z width $\Gamma_{Z}$. We obtain bounds for…

In this paper we characterize the mixing properties in the advection of passive tracers by exploiting the extreme value theory for dynamical systems. With respect to classical techniques directly related to the Poincar\'e recurrences…

We study the existence and uniqueness of the heat kernel on infinite, locally finite, connected graphs. For general graphs, a uniqueness criterion, shown to be optimal, is given in terms of the maximal valence on spheres about a fixed…

We consider generic finite range percolation models on $\mathbb{Z}^d$ under a high temperature assumption (exponential decay of connection probabilities and exponential ratio weak mixing). We prove that the rate of decay of point-to-point…

We present an improved coupling technique for analyzing the mixing time of Markov chains. Using our technique, we simplify and extend previous results for sampling colorings and independent sets. Our approach uses properties of the…

In finite mixture models, apart from underlying mixing measure, true kernel density function of each subpopulation in the data is, in many scenarios, unknown. Perhaps the most popular approach is to choose some kernel functions that we…

The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the graphs of several communication networks at the IP-layer, which are subgraphs of the much larger global IP-layer network. We show that the…

The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly…

We define a discrete-time Markov chain for abstract polymer models and show that under sufficient decay of the polymer weights, this chain mixes rapidly. We apply this Markov chain to polymer models derived from the hard-core and…

In this note we prove a spectral gap for various Markov chains on various functional spaces. While proving that a spectral gap exists is relatively common, explicit estimates seems somewhat rare.These estimates are then used to apply the…