Results 31 to 40 of about 1,809,097 (279)
Maximal dispersion of adaptive random walks
Maximum entropy random walks (MERWs) are maximally dispersing and play a key role in optimizing information spreading in various contexts. However, building MERWs comes at the cost of knowing beforehand the global structure of the network, a requirement ...
Gabriele Di Bona +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
Generalized continuous-time random walks, subordination by hitting times, and fractional dynamics [PDF]
Functional limit theorems for continuous-time random walks (CTRW) are found in the general case of dependent waiting times and jump sizes that are also position dependent.
Kolokoltsov, V. N. (Vasiliĭ Nikitich) +1 more
core +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
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
Statistical analysis of random walks on network
This paper describes an investigation of analytical formulas for parameters in random walks. Random walks are used to model situations in which an object moves in a sequence of steps in randomly chosen directions.
A. Kalikova
doaj +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
Quenched invariance principles for random walks and elliptic diffusions in random media with boundary [PDF]
Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary.
Croydon, David A. +5 more
core +1 more source

