Related papers: Conductance and Eigenvalue

We consider continuous-space, discrete-time Markov chains on $\mathbb{R}^d$, that admit a finite number $N$ of metastable states. Our main motivation for investigating these processes is to analyse random Poincar\'e maps, which describe…

In this article we study generalization of the classical Talagrand transport-entropy inequality in which the Wasserstein distance is replaced by the entropic transportation cost. This class of inequalities has been introduced in the recent…

The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…

We use the quasiclassical theory of superconductivity to calculate the electronic contribution to the thermal conductivity. The theory is formulated for low temperatures when heat transport is limited by electron scattering from random…

Let $(X_t)$ be a discrete time Markov chain on a general state space. It is well-known that if $(X_t)$ is aperiodic and satisfies a drift and minorization condition, then it converges to its stationary distribution $\pi$ at an exponential…

We study the individual behavior of the eigenvalues of the laplacian matrices of the cyclic graph of order $n$, where one edge has weight $\alpha\in\mathbb{C}$, with $\operatorname{Re}(\alpha)<0$, and all the others have weights $1$. This…

Let $(X, \cal B, \nu)$ be a probability space and let $\Gamma$ be a countable group of $\nu$-preserving invertible maps of $X$ into itself. To a probability measure $\mu$ on $\Gamma$ corresponds a random walk on $X$ with Markov operator $P$…

We study some mesoscopic properties of electron transport by employing one-dimensional chains and Anderson tight-binding model. Principal attention is paid to the resistance of finite-length chains with disordered white-noise potential. We…

We characterize partial data uniqueness for the inverse fractional conductivity problem with $H^{s,n/s}$ regularity assumptions in all dimensions. This extends the earlier results for $H^{2s,\frac{n}{2s}}\cap H^s$ conductivities by Covi and…

A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are…

If $A$ is an $n\times n$ matrix whose $n$ eigenvalues are ordered in terms of decreasing modules, $|\lambda_1 | \geq |\lambda_2| \geq ... |\lambda_n|$, it is often of interest to estimate $\frac{|\lambda_2|}{|\lambda_1|}$. If $A$ is a row…

Let $\nu$ be a probability distribution over the semi-group of square matrices of size $d \ge 2$ over a locally compact field $\mathbb{K}$, \textit{e.g.} $\mathbb{R}$. We consider the random walk $\overline{\gamma}_n :=…

In the proof of the invariance principle for locally perturbed periodic Lorentz process with finite horizon, a lot of delicate results were needed concerning the recurrence properties of its unperturbed version. These were analogous to the…

We fix $d \geq 2$ and denote $\mathcal S$ the semi-group of $d \times d$ matrices with non negative entries. We consider a sequence $(A_n, B_n)_{n \geq 1} $ of i. i. d. random variables with values in $\mathcal S\times \mathbb R_+^d$ and…

Let $\Gamma$ be a graph and $P$ be a reversible random walk on $\Gamma$. From the $L^2$ analyticity of the Markov operator $P$, we deduce that an iterate of odd exponent of $P$ is `lazy', that is there exists an integer $k$ such that the…

For ${1/2}<\alpha<1$, we propose the MDP analysis for family $$ S^\alpha_n=\frac{1}{n^\alpha}\sum_{i=1}^nH(X_{i-1}), n\ge 1, $$ where $(X_n)_{n\ge 0}$ be a homogeneous ergodic Markov chain, $X_n\in \mathbb{R}^d$, when the spectrum of…

The motivation of this work is to extend the techniques of higher order random walks on simplicial complexes to analyze mixing times of Markov chains for combinatorial problems. Our main result is a sharp upper bound on the second…

Let $S(n)$ be a centered random walk with finite second moment. We consider the integrated random walk $T(n) = S(0)+S(1)+\dots+S(n)$. We prove invariance principles for the meander and for the bridge of this process, under the condition…

Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…

Consider $n$ linearly independent vectors in $\mathbb{C}^n$ which form columns of a matrix $A$. The recursive evaluation of eigen directions (normalized eigenvectors) of $A$ is the solution of an eigenvalue problem of the form…