Related papers: Heat kernel estimates for strongly recurrent rando…
Given suitable functions $V, \Psi:[0,\infty) \to [0,\infty)$, we obtain necessary and sufficient conditions on $V,\Psi$ for the existence of a metric measure space and a symmetric diffusion process that satisfies sub-Gaussian heat kernel…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
We show that the Plancherel measure of the lamplighter random walk on a graph coincides with the expected spectral measure of the absorbing random walk on the Bernoulli percolation clusters. In the subcritical regime the spectrum is pure…
In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
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…
In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…
We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…
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$…
We consider the hierarchic tree Random Energy Model with continuous branching and calculate the moments of the corresponding partition function. We establish the multifractal properties of those moments. We derive formulas for the normal…
A number of papers have examined various aspects of "random random" walks on finite groups; the purpose of this article is to provide a survey of this work and to show, bring together, and discuss some of the arguments and results in this…
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning…
Let $\mathcal{U}$ be the uniform spanning tree on $\mathbb{Z}^{3}$. We show the occurrence of log-logarithmic fluctuations around the leading order for the volume of intrinsic balls in $\mathcal{U}$. As an application, we obtain similar…
In the uniformly discrete case of virtual persistence diagram groups $K(X,A)$, we construct a translation-invariant heat semigroup. The kernels are supported on a countable subgroup $H$, and the restriction to $H$ has Fourier exponent…
We completely characterize when the free effective resistance of an infinite graph can be expressed in terms of simple hitting probabilities of the graphs random walk.
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
We develop techniques to obtain rigorous bounds on the behaviour of random walks on combs. Using these bounds we calculate exactly the spectral dimension of random combs with infinite teeth at random positions or teeth with random but…
Graphs on lattice points are studied whose edges come from a finite set of allowed moves of arbitrary length. We show that the diameter of these graphs on fibers of a fixed integer matrix can be bounded from above by a constant. We then…
In this article, universal concentration estimates are established for the local times of random walks on weighted graphs in terms of the resistance metric. As a particular application of these, a modulus of continuity for local times is…
In this work, we study open quantum random walks, as described by S. Attal et al. These objects are given in terms of completely positive maps acting on trace-class operators, leading to one of the simplest open quantum versions of the…