Related papers: A Hitting Time Formula for the Discrete Green's Fu…
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. Cooper and Spencer (Comb. Probab. Comput. (2006)) show a…
Several variants of the graph Laplacian have been introduced to model non-local diffusion processes, which allow a random walker to {\textquotedblleft jump\textquotedblright} to non-neighborhood nodes, most notably the transformed path…
We consider a quantum walk model on a finite graph which has an interaction with the outside. Here a quantum walker from the outside penetrates the graph and also a quantum walker in the graph goes out to the outside at every time step.…
In this paper we study subdiffusion in a system with a thin membrane. At the beginning, the random walk of a particle is considered in a system with a discrete time and space variable and then the probability describing the evolution of the…
The fixing number of a graph $G$ is the order of the smallest subset $S$ of its vertex set $V(G)$ such that stabilizer of $S$ in $G$, $\Gamma_{S}(G)$ is trivial. Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$, and let…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…
A new expression for the Green's function of a finite one-dimensional lattice with nearest neighbor interaction is derived via discrete Fourier transform. Solution of the Heisenberg spin chain with periodic and open boundary conditions is…
A mated-CRT map is a random planar map obtained as a discretized mating of correlated continuum random trees. Mated-CRT maps provide a coarse-grained approximation of many other natural random planar map models (e.g., uniform triangulations…
We consider a general one-particle Hamiltonian H = - \Delta_r + u(r) defined in a d-dimensional domain. The object of interest is the time-independent Green function G_z(r,r') = < r | (z-H)^{-1} | r' >. Recently, in one dimension (1D), the…
Green's functions in Physics have proven to be a valuable tool for understanding fundamental concepts in different branches, such as electrodynamics, solid-state and many -body problems. In quantum mechanics advanced courses, Green's…
Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…
We study a discrete model of the Laplacian in $\mathbb{R}^2$ that preserves the geometric structure of the original continual object. This means that, speaking of a discrete model, we do not mean just the direct replacement of differential…
We consider discrete (time and space) random walks confined to the quarter plane, with jumps only in directions $(i,j)$ with $i+j \geq 0$ and small negative jumps, i.e., $i,j \geq -1$. These walks are called singular, and were recently…
It has been known for some time that the Green's function of a planar domain can be defined in terms of the exit time of Brownian motion, and this definition has been extended to stopping times more general than exit times. In this paper,…
In this paper, we derive explicit formulas for the surface averaged first exit time of a discrete random walk on a finite lattice. We consider a wide class of random walks and lattices, including random walks in a non-trivial potential…
The electron Green's functions $G({\bf k},\omega)$ within the t-J model and in the regime of intermediate doping is studied analytically using equations of motion for projected fermionic operators and the decoupling of the self energy into…
We consider the generalised PageRank walk on a digraph $G$, with refresh probability $\alpha$ and resampling distribution $\lambda$. We analyse convergence to stationarity when $G$ is a large sparse random digraph with given degree…
In this paper, we compute an explicit analytic expression for the Green function of the wave operator on the $2$-regular lattice called the "Bethe lattice" equipped with its standard metric. In particular, we exhibit a phenomena of abnormal…
Random walks have wide application in real lives, ranging from target search, reaction kinetics, polymer chains, to the forecast of the arrive time of extreme events, diseases or opinions. In this paper, we consider discrete random walks on…