相关论文: A random walk on Area Restricted Search

Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less…

We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks…

The recent availability of large databases allows to study macroscopic properties of many complex systems. However, inferring a model from a fit of empirical data without any knowledge of the dynamics might lead to erroneous interpretations…

Given a real-world graph, how can we measure relevance scores for ranking and link prediction? Random walk with restart (RWR) provides an excellent measure for this and has been applied to various applications such as friend recommendation,…

We study the relaxation time in the random walk with jumps. The random walk with jumps combines random walk based sampling with uniform node sampling and improves the performance of network analysis and learning tasks. We derive various…

Exploration is a difficult challenge in reinforcement learning and even recent state-of-the art curiosity-based methods rely on the simple epsilon-greedy strategy to generate novelty. We argue that pure random walks do not succeed to…

We discuss the quenched tail estimates for the random walk in random scenery. The random walk is the symmetric nearest neighbor walk and the random scenery is assumed to be independent and identically distributed, non-negative, and has a…

We study a random walk model in which the jumping probability to a site is dependent on the number of previous visits to the site, as a model of the mobility with memory. To this end we introduce two parameters called the memory parameter…

In this paper we consider a random walk in random environment on a tree and focus on the boundary case for the underlying branching potential. We study the range $R\_n$ of this walk up to time $n$ and obtain its correct asymptotic in…

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously…

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…

With the ease of deployment, capabilities of evading the jammers and obscuring their existence, unmanned aerial vehicles (UAVs) are one of the most suitable candidates to perform surveillance. There exists a body of literature in which the…

In the last decade remarkable progress has been made in development of suitable proof techniques for analysing randomised search heuristics. The theoretical investigation of these algorithms on classes of functions is essential to the…

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…

The Random Walks (RW) algorithm is one of the most e - cient and easy-to-use probabilistic segmentation methods. By combining contrast terms with prior terms, it provides accurate segmentations of medical images in a fully automated manner.…

The integer points (sites) of the real line are marked by the positions of a standard random walk. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the standard random walk are…

We consider transient one-dimensional random walks in random environment with zero asymptotic speed. An aging phenomenon involving the generalized Arcsine law is proved using the localization of the walk at the foot of "valleys" of height…

We introduce range-controlled random walks with hopping rates depending on the range $\mathcal{N}$, that is, the total number of previously distinct visited sites. We analyze a one-parameter class of models with a hopping rate…

For a one-dimensional random walk in random scenery (RWRS) on Z, we determine its quenched weak limits by applying Strassen's functional law of the iterated logarithm. As a consequence, conditioned on the random scenery, the one-dimensional…