Related papers: Source localisation in simple random walks

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Consider the model where particles are initially distributed on $\mathbb{Z}^d, \, d\geq 2$, according to a Poisson point process of intensity $\lambda>0$, and are moving in continuous time as independent simple symmetric random walks. We…

We investigate the problem of locating the source of diffusion in complex networks without complete knowledge of nodes' states. Some currently known methods assume the information travels via a single, shortest path, which by assumption is…

The class of random walks in one dimension, returning to the origin, restricted by the requirement that any site visited (different from the origin) is visited an even number of times, is analyzed in the present note. We call this class the…

In the randomly-oriented Manhattan lattice, every line in $\mathbb{Z}^d$ is assigned a uniform random direction. We consider the directed graph whose vertex set is $\mathbb{Z}^d$ and whose edges connect nearest neighbours, but only in the…

We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…

Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex, she moves to a uniformly random…

We study the average probability that a discrete-time quantum walk finds a marked vertex on a graph. We first show that, for a regular graph, the spectrum of the transition matrix is determined by the weighted adjacency matrix of an…

Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random walks are useful but have drawbacks. Random vertex sampling…

We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…

We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

A celebrated result in probability theory is that a simple symmetric random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ is recurrent for $d=1,2$ and transient for $d\geq 3$. In this note, we derive a closed-form expression, in terms…

In this article, we develop a theory for understanding the traces left by a random walk in the vicinity of a randomly chosen reference vertex. The analysis is related to interlacements but goes beyond previous research by showing weak limit…

We study the problem of estimating the source of a network cascade given a time series of noisy information about the spread. Initially, there is a single vertex affected by the cascade (the source) and the cascade spreads in discrete time…

Consider an arbitrary transient random walk on $\Z^d$ with $d\in\N$. Pick $\alpha\in[0,\infty)$ and let $L_n(\alpha)$ be the spatial sum of the $\alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range,…

On the trace of a discrete-time simple random walk on $\mathbb{Z}^d$ for $d\geq 2$, we consider the evolution of favorite sites, i.e., sites that achieve the maximal local time at a certain time. For $d=2$, we show that almost surely three…