相关论文: Activated Random Walks
Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes…
These are lecture notes for a minicourse on applications of microlocal analysis in inverse problems, given in Helsinki and Shanghai in June 2019.
Those are notes of a mini-course the author gave in July 2010 at the university Paris 6 (Jussieu) during the summer school of the ANR (Agence nationale de la recherche) BERKO.
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
We consider random walks, say $W_n=(M_0, M_1,\dots, M_n)$, of length $n$ starting at 0 and based on the martingale sequence $M_k$ with differences $X_m=M_m-M_{m-1}$. Assuming that the differences are bounded, $|X_m|\leq 1$, we solve the…
We link questions by Abdelkader about a class of random walks to \emph{Moran walks}.
We provide some first experimental data about generating functions of restricted lattice walks with small steps in NN^4.
This note illustrates how a simple random walk with possibly long jumps is related to fractional powers of the Laplace operator. The exposition is elementary and self-contained.
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We introduce a class of nearest-neighbor integer random walks in random and non-random media, which includes excited random walks considered in the literature. At each site the random walker has a drift to the right, the strength of which…
Notes of the lectures delivered in Les Houches during the Summer School on Complex Systems (July 2006).
We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…
The 11th Summer Workshop on Multimodal Interfaces eNTERFACE 2015 was hosted by the Numediart Institute of Creative Technologies of the University of Mons from August 10th to September 2015. During the four weeks, students and researchers…
Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each network node.…
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 consider laws of the iterated logarithm and the rate function for sample paths of random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.
Initial steps are presented towards understanding which finitely generated groups are almost surely generated as semigroups by the path of a random walk on the group.
A new class of one-dimensional, discrete time random walk model with memory, termed "Random walk with $n$ memory channels" (RW$n$MC) is proposed. In this model the information of $n$ ($n\in \mathbb{Z}$) previous steps from the walker's…
This is an introductory level survey of some topics from a new branch of fractal analysis -- the theory of self-similar groups. We discuss recent works on random walks on self-similar groups and their applications to the problem of…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…