Related papers: Random Walks and Effective Resistances on Toroidal…
Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes sampling, etc.…
Given a resistive electrical network, we would like to determine whether all the resistances (edges) in the network are working, and if not, identify which edge (or edges) are faulty. To make this determination, we are allowed to measure…
We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…
Considerable progress has recently been made in the development of techniques to exactly determine two-point resistances in networks of various topologies. In particular, two types of method have emerged. One is based on potentials and the…
In this paper we give a survey of methods used to calculate values of resistance distance (also known as effective resistance) in graphs. Resistance distance has played a prominent role not only in circuit theory and chemistry, but also in…
It is shown that the resistance between the origin and any lattice point (l,m,n) in an infinite perfect Simple Cubic (SC) is expressed rationally in terms of the known value of G0(0,0,0). The resistance between arbitrary sites in a SC is…
Effective resistance is an important metric that measures the similarity of two vertices in a graph. It has found applications in graph clustering, recommendation systems and network reliability, among others. In spite of the importance of…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
We study the winding behavior of random walks on two oriented square lattices. One common feature of these walks is that they are bound to revolve clockwise. We also obtain quantitative results of transience/recurrence for each walk.
We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
Refining previous results, we establish a sharp asymptotic estimate on the expected graph distance between the origin and the terminal point of the trace of the first $n$ steps of the walk. A similar conclusion is drawn for the resistance…
A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…
We study random walks in random environments generated by the two-dimensional Gaussian free field. More specifically, we consider a rescaled lattice with a small mesh size and view it as a random network where each edge is equipped with an…
Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…
In this paper we consider the \emph{fully-dynamic} All-Pairs Effective Resistance problem, where the goal is to maintain effective resistances on a graph $G$ among any pair of query vertices under an intermixed sequence of edge insertions…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
We investigate the behavior of two dimensional resistor networks, with finite sizes and different kinds (rectangular, hexagonal, and triangular) of lattice geometry. We construct the network by having a network-element repeat itself $L_x$…
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.