Related papers: A Hitting Time Formula for the Discrete Green's Fu…

Let $G_S$ be a graph with loops attached at each vertex in $S \subseteq V(G).$ In this article, we develop exact formulae for the number of closed $3$- and $4$-walks on $G_S$ in terms of vertex degrees and certain elementary subgraphs of…

We study hitting times in simple random walks on graphs, which measure the time required to reach specific target vertices. Our main result establishes a sharp lower bound for the variance of hitting times. For a simple random walk on a…

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

Structure and coordinate dependence of the reflected wave, as well as boundary conditions for quasi-particles of graphene and the two dimensional electron gas in sheets with abrupt lattice edges are obtained and analyzed by the Green's…

We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…

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…

It is a classical result due to Jacobi in algebraic combinatorics that the generating function of closed walks at a vertex $u$ in a graph $G$ is determined by the rational function \[ \frac{\phi_{G-u}(t)}{\phi_G(t)} \] where $\phi_G(t)$ is…

It is known that the generating function associated with the enumeration of non-backtracking walks on finite graphs is a rational matrix-valued function of the parameter; such function is also closely related to graph-theoretical results…

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…

In this paper we are interested in obtaining the exact expression and the study of the constant sign of the Green's function related to a second order perturbed periodic problem coupled with integral boundary conditions at the extremes of…

The electromagnetic Green's function is a crucial ingredient for the theoretical study of modern photonic quantum devices, but is often difficult or even impossible to calculate directly. We present a numerically efficient framework for…

It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…

We introduce a new technique for bounding the cover time of random walks by relating it to the runtime of randomized broadcast. In particular, we strongly confirm for dense graphs the intuition of Chandra et al. \cite{CRRST97} that "the…

We study the random walk on a finite dihedral group $G$ driven by the uniform measure on $k$ independently and uniformly chosen elements. We show that the walk exhibits cutoff with high probability throughout nearly the entire regime $1 \ll…

We propose a geometric approach for bounding average stopping times for stopped random walks in discrete and continuous time. We consider stopping times in the hyperspace of time indexes and stochastic processes. Our techniques relies on…

We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\log n$, where $h$ is a…

The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…

We study estimates of the Green's function in $\mathbb{R}^d$ with $d \ge 2$, for the linear second order elliptic equation in divergence form with variable uniformly elliptic coefficients. In the case $d \ge 3$, we obtain estimates on the…

In the present paper, we give the exact formula for the average hitting time (HT, as an abbreviation) of random walks from one vertex to any other vertex on the some weighted Cayley graphs.

It is proved that the Green's function of the simple random walk on a surface group of large genus decays exponentially at the spectral radius. It is also shown that Ancona's inequalities extend to the spectral radius R, and therefore that…