Related papers: Random walks with long-range steps generated by fu…
Self-propelled particles serve as minimal models for emulating the dynamic self-organization of microorganisms, yet most synthetic systems remain limited to a single mode of motion, namely active Brownian particles (ABPs). Here, we present…
We carry out comparative studies of random walks on deterministic Apollonian networks (DANs) and random Apollonian networks (RANs). We perform computer simulations for the mean first passage time, the average return time, the mean-square…
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…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
This paper investigates the asymptotic behavior of Green functions associated to partially homogeneous random walks in the quadrant $Z_+^2$. There are four possible distributions for the jumps of these processes, depending on the location…
1. Understanding how to find targets with very limited information is a topic of interest in many disciplines. In ecology, such research has often focused on the development of two movement models: i) the L\'evy walk and; ii) the composite…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited…
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…
We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global first passage times, which allow us to characterize the effect…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
Random walks have been proven to be useful for constructing various algorithms to gain information on networks. Algorithm node2vec employs biased random walks to realize embeddings of nodes into low-dimensional spaces, which can then be…
We consider a 1-dimensional Brownian motion whose diffusion coefficient varies when it crosses the origin. We study the long time behavior and we establish different regimes, depending on the variations of the diffusion coefficient:…
In natural foraging, many organisms seem to perform two different types of motile search: directed search (taxis) and random search. The former is observed when the environment provides cues to guide motion towards a target. The latter…
This paper studies long range random walks on ${\mathbb{Z}_q}^d$. $X_{t+1} = X_t + Z_t \mod q$, with $(Z_t)$ independent and identically distributed. Multiple entries of $Z_t$ can be non-zero in a transition. An emphasis is on finding the…
We study systems of interacting Brownian particles in one dimension constructed as the diffusion scaling limits of Fisher's vicious walk models. We define two types of nonintersecting Brownian motions, in which we impose no condition (resp.…
Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…