Related papers: Upper bounds for transition probabilities on graph…

We introduce a construction that gives rise to a variety of "geometric" finite random graphs, and describe connections to the Poisson boundary, Naim's kernel, and Sznitman's random interlacements.

Sub-Gaussian heat kernel estimates are typical of fractal graphs. We show that sub-Gaussian estimates on graphs follow from a Poincar\'e inequality, capacity upper bound, and a slow volume growth condition. An important feature of this work…

We study discrete time random walks in an environment of i.i.d. non-negative bounded conductances in $\mathbb{Z}^d$. We are interested in the anomaly of the heat-kernel decay. We improve recent results and techniques.

We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…

We prove that for a general diffusion process, certain assumptions on its behavior \emph{only within a fixed open subset} of the state space imply the existence and sub-Gaussian type off-diagonal upper bounds of the \emph{global} heat…

In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated are motivated by a variety of random graph models, and explanations are provided as to how they apply to…

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its…

In this paper, we develop a general machinery for finding explicit uniform probability and moment bounds on sub-additive positive functionals of random processes. Using the developed general technique, we derive uniform bounds on the…

We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

Nash or Sobolev inequalities are known to be equivalent to ultracontractive properties of Markov semigroups, hence to uniform bounds on their kernel densities. In this work we present a simple and extremely general method, based on weighted…

We consider skew extensions of expanding maps by compact Lie groups. For a class of natural invariant measures, we prove an explicit lower bound on the rate of (exponential) mixing involving topological pressure. Proof uses representation…

We prove that for recurrent, reversible graphs, the following conditions are equivalent: (a) existence and uniqueness of the potential kernel, (b) existence and uniqueness of harmonic measure from infinity, (c) a new anchored Harnack…

Assuming the heat kernel on a doubling Dirichlet metric measure space has a sub-Gaussian bound, we prove an asymptotically sharp spectral upper bound on the survival probability of the associated diffusion process. As a consequence, we can…

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

We derive large time upper bounds for heat kernels on vector bundles of differential forms on a class of non-compact Riemannian manifolds under certain curvature conditions.

Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…

We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…

We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…

Random walks are fundamental tools for analyzing complex networked systems, including social networks, biological systems, and communication infrastructures. While classical random walks focus on pairwise interactions, many real-world…