Related papers: On the Eigenspaces of Lamplighter Random Walks and…

We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Emphasis is on the case of the fundamental group of a closed surface, for the usual system of generators.

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…

We define a new stochastic process on general simplicial complexes which allows to study their spectral and homological properties. Some results for random walks on graphs are shown to hold in this general setting. As an application, the…

We show that for a uniformly irreducible random walk on a graph, with bounded range, there is a Floyd function for which the random walk converges to its corresponding Floyd boundary. Moreover if we add the assumptions, $p^{(n)}(v,w)\leq C…

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary. In particular, we prove that the random walk…

Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…

We use a random walk in the ensemble of impurity configurations to generate a Brownian motion model for energy levels in disordered conductors. Treating arc-length along the random walk as fictitous time, the resulting Langevin equation…

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…

We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…

We show that the lamplighter group L has a system of generators for which the spectrum of the discrete Laplacian on the Cayley graph is a union of an interval and a countable set of isolated points accumulating to a point outside this…

Let $\Gamma$ act on a countable set V with only finitely many orbits. Given a $\Gamma$-invariant random environment for a Markov chain on V and a random scenery, we exhibit, under certain conditions, an equivalent stationary measure for the…

We give a sufficient condition for the existence of the harmonic measure from infinity of transient random walks on weighted graphs. In particular, this condition is verified by the random conductance model on $\Z^d$, $d\geq 3$, when the…

We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in…

We show a norm convergence result for the Laplacian on a class of post-critically finite fractals with arbitrary Borel regular probability measure which can be approximated by a sequence of finite-dimensional graph Laplacians with…

We study the effect of random scattering in quantum walks on a finite graph and compare it with the effect of repeated measurements. To this end, a constructive approach is employed by introducing a localized and a delocalized basis for the…

We investigate the eigenvalue density in ensembles of large sparse Bernoulli random matrices. We demonstrate that the fraction of linear subgraphs just below the percolation threshold is about 95\% of all finite subgraphs, and the…