Results 31 to 40 of about 19,207 (260)
A Note on k-Bonacci Random Walks
In this work, the probability of return for random walks on Z, whose increment is given by the k-bonacci sequence, is determined. Additionally, the Hausdorff, packing and box-counting dimensions of the set of these walks that return an infinite number of
Najmeddine Attia +3 more
doaj +1 more source
Some topics in random walks [PDF]
We collect a few recent results on random walks, which are ubiquitous in probability theory. The topics covered are: persistence problems for stochastic processes, large fluctuations in multi-scale modeling for rest hematopoiesis, and fine properties of ...
Berger Quentin +3 more
doaj +1 more source
Deterministic Random Walks on the Integers [PDF]
We analyze the one-dimensional version of Jim Propp's $P$-machine, a simple deterministic process that simulates a random walk on $\mathbb{Z}$. The "output'' of the machine is astonishingly close to the expected behavior of a random walk, even on long ...
Joshua Cooper +3 more
doaj +1 more source
On random walks and switched random walks on homogeneous spaces
AbstractWe prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group$G$. We introduce the switched random walk determined by a finite set of probability distributions on$G$, prove that its long-term behaviour is determined by the Fourier joint spectral radius of the ...
Elvira Moreno, Mauricio Velasco
openaire +3 more sources
Intransitiveness: From Games to Random Walks
Many games in which chance plays a role can be simulated as a random walk over a graph of possible configurations of board pieces, cards, dice or coins. The end of the game generally consists of the appearance of a predefined winning pattern; for random ...
Alberto Baldi, Franco Bagnoli
doaj +1 more source
Ranking competitors using degree-neutralized random walks. [PDF]
Competition is ubiquitous in many complex biological, social, and technological systems, playing an integral role in the evolutionary dynamics of the systems.
Seungkyu Shin +2 more
doaj +1 more source
Random walks on the random graph [PDF]
We study random walks on the giant component of the Erdős–Rényi random graph G(n,p) where p=λ/n for λ>1 fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald, to have order log2n.
Berestycki, Nathanaël +3 more
openaire +5 more sources
Heterogeneous Network Embedding Based on Random Walks of Type and Inner Constraint
In heterogeneous networks, random walks based on meta-paths require prior knowledge and lack flexibility. On the other hand, random walks based on non-meta-paths only consider the number of node types, but not the influence of schema and topology between
Xiao Chen +5 more
doaj +1 more source
Branching Random Walks in a Random Killing Environment with a Single Reproduction Source
We consider a continuous-time branching random walk on Z in a random non-homogeneous environment. The process starts with a single particle at initial time t=0.
Vladimir Kutsenko +2 more
doaj +1 more source
Critical dimensions for random walks on random-walk chains [PDF]
The probability distribution of random walks on linear structures generated by random walks in $d$-dimensional space, $P_d(r,t)$, is analytically studied for the case $ξ\equiv r/t^{1/4}\ll1$. It is shown to obey the scaling form $P_d(r,t)=ρ(r) t^{-1/2} ξ^{-2} f_d(ξ)$, where $ρ(r)\sim r^{2-d}$ is the density of the chain. Expanding $f_d(ξ)$ in powers of
Rabinovich S. +3 more
openaire +3 more sources

