Related papers: Heat kernel estimates for strongly recurrent rando…
We consider the operator associated to a random walk on finite volume surfaces with hyperbolic cusps. We study the spectral gap (upper and lower bound) associated to this operator and deduce some rate of convergence of the iterated kernel…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
Consider a random walk $S_n=\sum_{i=1}^n X_i$ with independent and identically distributed real-valued increments with zero mean, finite variance and moment of order $2 + \delta$ for some $\delta>0$. For any starting point $x\in \mathbb R$,…
It is shown in this paper that the transition kernel corresponding to a spatially inhomogeneous random walk on ${\mathbf{Z}}^d$ admits upper and lower Gaussian estimates.
A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional…
We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…
We study a continuous time random walk $X$ in an environment of i.i.d. random conductances $\mu_e\in[1,\infty)$. We obtain heat kernel bounds and prove a quenched invariance principle for $X$. This holds even when…
Asymptotic estimates of the hitting distribution of a long segment on the real axis for two dimensional random walks on ${\bf Z}^2$ of zero mean and finite variances are obtained: some are general and exhibit its apparent similarity to the…
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
Consider a simple random walk on a realization of an Erd\H{o}s-R\'enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture, we prove a Central Limit Theorem (CLT)…
A probabilistic construction for the solution of a general class of high order heat-type equations is constructed in terms of the scaling limit of random walks in the complex plane.
Results have been moved to a published article, see arXiv:0812.2669v4[math.PR]
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We consider random walks among random conductances on $\mathbb{Z}^2$ and establish precise asymptotics for the associated potential kernel and the Green's function of the walk killed upon exiting balls. The result is proven for random walks…