[PDF] Top 20 ONE-DIMENSIONAL RANDOM WALKS 1. SIMPLE RANDOM WALK
Has 10000 "ONE-DIMENSIONAL RANDOM WALKS 1. SIMPLE RANDOM WALK" found on our website. Below are the top 20 most common "ONE-DIMENSIONAL RANDOM WALKS 1. SIMPLE RANDOM WALK".
ONE-DIMENSIONAL RANDOM WALKS 1. SIMPLE RANDOM WALK
... for simple random walk was based on Stirling’s ...the one-dimensional case is based on a second important theorem about random walk discovered by Kesten, Spitzer, and ... See full document
29
Random walk on the range of random walk
... the random walk on the range of random walk is provided by the following result, which demonstrates that the quenched probability that the process X returns to the origin after 2n steps decays ... See full document
26
Random walks on finite lattices with multiple traps: Application to particle cluster aggregation
... For random walks on finite lattices with multiple (completely adsorbing) traps, one is interested in the mean walk length until trapping and in the probability of capture for the various traps ... See full document
20
Multi point correlations for two dimensional coalescing random walks
... rate one simple random walks on Z 2 , started from the initial condition with all sites in Z 2 ...coalescing random walks are a ‘critical’ model of interacting particle systems: ... See full document
27
On the Pfaffian property of annihilating random walk and coalescing random walk
... Coalescing random walk (CRW) is a system of n particles performing independent random walk on a one-dimensional discrete lattice Z + ...into one particle and continue to ... See full document
121
Biased randomly trapped random walks and applications to random walks on Galton Watson trees
... trapped random walk in the sub- diffusive regime; that is, when the trapping is too strong to obtain a central limit ...the walk is ...the walk converges, after suitable rescaling, to the ... See full document
201
First hitting times of simple random walks on graphs with congestion points
... Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to ... See full document
12
Random walks and the contact process
... There has also been work on more general RWDRE models with poorly mixing dynamics which, however, require other (strong) properties of either the dynamics or the random walk. Besides the work of [9] ... See full document
150
Choice and bias in random walks
... a random walk on a graph with the hope of speeding up the cover and hitting ...times. One motivation behind this is to improve the efficiency of random walks used in algorithmic ... See full document
21
Random walks on complex trees
... the one-dimensional set of links and vertices connecting the starting vertex to the ...= 1 vertex) of the sub-tree the random walker is ... See full document
10
Random walks in random environments
... symmetric random walks in d ≥ 3 (Bricmont and Kupiainen 1991), and some examples based on combining components of ordi- nary random walks and RWRE in d ≥ 7 (Bolthausen et ...i.i.d. ... See full document
21
Stock Market Prices Do Not Follow Random Walks: Evidence from a Simple SpecificationTest
... the random walk model does not necessarily imply the inefficiency of stock-price ...consequence. One specific implication of our empirical findings is that the standard Black-Scholes pricing formula ... See full document
26
Random walk in a high density dynamic random environment
... the walk stands still for a long time, allowing the environment to lose ...independent random walks are not ...dynamic random environments that are not cone-mixing for which a strong law of ... See full document
14
Random walk in random environment with asymptotically zero perturbation
... In this paper we study a problem with a classical flavour that lies in the intersection of two well-studied problems, those of random walks in one-dimensional random environments and ... See full document
23
Symmetric exclusion as a model of non-elliptic dynamical random conductances
... a random walk in random media is represented by a random walk among (time-independent) random ...relatively simple due to the reversibility properties of the ...such ... See full document
8
Analysis of random walks in dynamic random environments via L2-perturbations
... Random walks. We give here three simple though non–trivial examples of different nature for which our results ...any random walk choice satisfying our basic assumptions, provided that ... See full document
41
Connectivity of Random 1-Dimensional Networks
... of random networks or graphs are summarized in [10]. One-dimensional networks are simple, but are widely used in practice for monitoring roads, rivers, coasts and boundaries of restricted ... See full document
24
Logarithmic speeds for one-dimensional perturbed random walk in random environment
... = 1/2: for α < 1/2 the perturbation is large enough to disturb the null-recurrent behaviour; for α ≥ 1/2 it is too ...< 1/2 then η t (ω) is transient for ... See full document
30
Slow movement of a random walk on the range of a random walk in the presence of an external field
... underlying simple random walk S has loops, and so it is necessary to estimate how much time the biased random walk X spends in ...a random path that is non-self intersecting, ... See full document
21
Statistics of Projected Motion in One Dimension of a D Dimensional Random Walker
... Nowadays random walk in higher dimensions is a challenging ...a random walker was started with Pearson ...study random walk in 3 dimensions (known as random flight) ...Then ... See full document
16
Related subjects