Results 71 to 80 of about 5,578,868 (115)
Random walk on random walks [PDF]
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density 2 (0;1).
M. Hil'ario +4 more
semanticscholar +1 more source
On the trace of branching random walks [PDF]
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s.
Benjamini, Itai, Müller, Sebastian
core
Bindweeds or random walks in random environments on multiplexed trees and their asympotics [PDF]
We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree.The term multiplexed means that the model can be viewed as a nearest neighbours random walk ...
Mikhail Menshikov +2 more
doaj +1 more source
Counting planar random walk holes
We study two variants of the notion of holes formed by planar simple random walk of time duration $2n$ and the areas associated with them. We prove in both cases that the number of holes of area greater than $A(n)$, where $\{A(n)\}$ is an increasing ...
Beneš, Christian
core +2 more sources
Intra-fraction motion of the prostate is a random walk
A random walk model for intra-fraction motion has been proposed, where at each step the prostate moves a small amount from its current position in a random direction.
H. Ballhausen +4 more
semanticscholar +1 more source
Self-avoiding pruning random walk on signed network
A signed network represents how a set of nodes are connected by two logically contradictory types of links: positive and negative links. In a signed products network, two products can be complementary (purchased together) or substitutable (purchased ...
Huijuan Wang +3 more
doaj +1 more source
Steady state and mean recurrence time for random walks on stochastic temporal networks
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 random walks on
Aihara, Kazuyuki +3 more
core +1 more source
Comparing mixing times on sparse random graphs
It is natural to expect that nonbacktracking random walk will mix faster than simple random walks, but so far this has only been proved in regular graphs.
Ben-Hamou, Anna +2 more
core +1 more source
Motif-aware Adaptive Cross-layer Random Walk Community Detection [PDF]
In recent years,multi-layer network community detection using high order interactive information has become a hot spot.In order to solve this problem,a MACLCD algorithm is proposed.The algorithm considers high order interaction and interlayer correlation
WANG Beibei, XIN Junchang, CHEN Jinyi, WANG Zhiqiong
doaj +1 more source
On the speed of once-reinforced biased random walk on trees
We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root.
Collevecchio, Andrea +2 more
core +1 more source

