Related papers: Upper bounds for transition probabilities on graph…
This paper is concerned about random walks on random environments in the lattice $\mathbb{Z}^d$. This model is analyzed through ergodicity in the form of the logarithmic Sobolev inequality. We assume that the environments are random…
We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the {\em principal ratio}, which is the ratio of maximum to minimum values of vertices in the stationary distribution. We give an upper…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless…
We consider laws of the iterated logarithm and the rate function for sample paths of random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.
Results regarding off-diagonal Gaussian upper heat kernel bounds on discrete weighted graphs with possibly unbounded geometry are summarized and related. After reviewing uniform upper heat kernel bounds obtained by Carlen, Kusuoka, and…
We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.
We study the inverse problem of determining a finite weighted graph $(X,E)$ from the source-to-solution map on a vertex subset $B\subset X$ for heat equations on graphs, where the time variable can be either discrete or continuous. We prove…
We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…
We consider random walks on the nonnegative integers in a space-time dependent random environment. We assume that transition probabilities are given by independent $\mathrm{Beta}(\mu,\mu)$ distributed random variables, with a specific…
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…
Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…
We present a new drift condition which implies rates of convergence to the stationary distribution of the iterates of a \psi-irreducible aperiodic and positive recurrent transition kernel. This condition, extending a condition introduced by…
We show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times of Markov chains in terms of isoperimetric properties of the state space (also known as…
We consider a left-transient random walk in a random environment on Z that will be disturbed by cookies inducing a drift to the right of strength 1. The number of cookies per site is i.i.d. and independent of the environment. Criteria for…
We establish elliptic and parabolic Harnack inequalities on graphs with unbounded weights. As an application we prove a local limit theorem for a continuous time random walk $X$ in an environment of ergodic random conductances taking values…
Recent progress on the understanding of the Random Conductance Model is reviewed. A particular emphasis is on homogenization results such as functional central limit theorems, local limit theorems and heat kernel estimates for almost every…
We introduce anchored versions of the Nash inequality. They allow to control the $L^2$ norm of a function by Dirichlet forms that are not uniformly elliptic. We then use them to provide heat kernel upper bounds for diffusions in degenerate…
Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…