Related papers: Conductance and Eigenvalue
In the context of the Ginzburg--Landau theory for critical phenomena, we consider the Euclidean $\lambda \phi ^4+\eta \phi^6$ model bounded by two parallel planes, a distance $L$ separating them. This is supposed to describe a sample of a…
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…
We show that there exists an ergodic conductance environment such that the weak (annealed) invariance principle holds for the corresponding continuous time random walk but the quenched invariance principle does not hold. In the present…
Let T be an infinite homogenous tree of homogeneity $q+1$. Attaching to each edge the conductance $1$, the tree will became an electric network. The reversible Markov chain associated to this network is the simple random walk on the…
The conductance G of a pair of single-channel point contacts in series, one of which is a spin filter, increases from 1/2 to 2/3 x e^2/h with more and more spin-flip scattering. This excess conductance was observed in a quantum dot by…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…
It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the…
A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…
Let f be a self-map of a compact manifold M, admitting an global SRB measure \mu. For a continuous test function \phi on M and a constant \alpha>0, consider the set of the initial points for which the Birkhoff time averages of the function…
We study the statistics of the conductance $g$ through one-dimensional disordered systems where electron wavefunctions decay spatially as $|\psi| \sim \exp (-\lambda r^{\alpha})$ for $0 <\alpha <1$, $\lambda$ being a constant. In contrast…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
A $\delta$ once-reinforced random walk ($\delta$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges…
We consider a continuous time Markov chain on a countable state space. We prove a joint large deviation principle (LDP) of the empirical measure and current in the limit of large time interval. The proof is based on results on the joint…
We introduce and study the permanence properties of the class of linear transfers between probability measures. This class contains all cost minimizing mass transports, but also martingale mass transports, the Schrodinger bridge associated…
For a connected graph $G$, we denote by $L(G)$, $m_{G}(\lambda)$, $c(G)$ and $p(G)$ the line graph of $G$, the eigenvalue multiplicity of $\lambda$ in $G$, the cyclomatic number and the number of pendant vertices in $G$, respectively. In…
We study the analogues of irreducibility, period, and communicating classes for open quantum random walks, as defined by Attal et al. (J. Stat. Phys., 2012). We recover results similar to the standard ones for Markov chains, in terms of…
After a brief review of the key theorems concerning recurrent sequences, we give an explicit computation of the inverse of the Vandermonde matrix. This will then be used to derive sub-exponential decay error terms in the ergodic theorem of…
Let $\{X_n\}$ be a stationary and ergodic time series taking values from a finite or countably infinite set ${\cal X}$. Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times $\lambda_n$…
Motivated by the notion of resistance distance on graph, we define a new resistance distance between two states on a given finite ergodic Markov chain based on its fundamental matrix. We prove a few equivalent formulations and discuss its…
Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…