Related papers: Random Walks and Effective Resistances on Toroidal…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…
We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
This paper contains results relating currents and voltages in resistive networks to appropriate random trees or forests in those networks.
A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…
Random walks behave very differently for classical and quantum particles. Here we unveil a ubiquitous distinctive behavior of random walks of a photon in a one-dimensional lattice in the presence of a finite number of traps, at which the…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.
This paper examines various ways of improving the impact resilience of protective structures. Such structures' purpose is to dissipate an impact's energy while avoiding cracking and failure. We have tested the reaction of plane…
We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…
Cascading failures are one of the main reasons for blackouts in power transmission grids. The topology of a power grid, together with its operative state determine, for the most part, the robustness of the power grid against cascading…
We study the recurrence behaviour of random walks on partially oriented honeycomb lattices. The vertical edges are undirected while the orientation of the horizontal edges is random: depending on their distribution, we prove a.s. transience…
The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph $G$. We consider two optimization problems of adding $k$ new edges to $G$ such that the resulting graph has minimal total effective…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
In this paper we study the tightness of solutions for a family of recursion equations. These equations arise naturally in the study of random walks on tree-like structures. Examples include the maximal displacement of a branching random…
This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.