搜索结果: 1-15 共查到“数学 random walks”相关记录48条 . 查询时间(0.144 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Branching random walks driven by products of random matrices
随机矩阵 乘积驱动 分支随机 游走
2023/4/18
Some sufficient conditions for infinite collisions of simple random walks on a wedge comb
wedge comb simple random walk infinite collision property local time
2016/1/19
In this paper, we give some sufficient conditions for the infinite collisions of independent simple random walks on a wedge comb with profile {f(n),n ∈ Z}.One interesting result is that two independen...
LIMIT THEOREMS FOR RANDOM WALKS ON A STRIP IN SUBDIFFUSIVE REGIMES
RWRE random walks on a strip quenched random environments
2015/9/29
We study the asymptotic behaviour of occupation times of a transient random walk in a
quenched random environment on a strip in a sub-diusive regime. The asymptotic behaviour of hitting
times, whic...
Local Limit Theorems for Random Walks in a 1D Random Environment
RWRE quenched random environments
2015/9/29
We consider random walks (RW) in a one-dimensional i.i.d.
random environment with jumps to the nearest neighbours. For almost
all environments, we prove a quenched Local Limit Theorem (LLT) for
the...
CENTRAL LIMIT THEOREM FOR RECURRENT RANDOM WALKS ON A STRIP WITH BOUNDED POTENTIAL
RANDOM WALKS CENTRAL LIMIT THEOREM
2015/9/29
We prove that a recurrent random walk (RW) in i.i.d. random
environment (RE) on a strip which does not obey the Sinai law exhibits the
Central Limit asymptotic behaviour.
SCALING LIMITS OF RECURRENT EXCITED RANDOM WALKS ON INTEGERS
Limit random walk RECURRENT EXCITED
2015/9/29
We describe scaling limits of recurrent excited random walks (ERWs) on
Z in i.i.d. cookie environments with a bounded number of cookies per site. We allow
both positive and negative excitations.
EXCURSIONS AND OCCUPATION TIMES OF CRITICAL EXCITED RANDOM WALKS
EXCURSIONS AND OCCUPATION TIMES EXCITED RANDOM WALKS
2015/9/29
We consider excited random walks (ERWs) on integers in i.i.d. environments with a bounded number of excitations per site. The emphasis is primarily on
the critical case for the transition between rec...
QUENCHED LIMIT THEOREMS FOR NEAREST NEIGHBOUR RANDOM WALKS IN 1D RANDOM ENVIRONMENT
NEIGHBOUR RANDOM WALKS IMIT THEOREMS
2015/9/29
It is well known that random walks in one dimensional random environment can exhibit subdiffusive behavior due
to presence of traps. In this paper we show that the passage times
of diffe...
Random Walks on Finite Groups
Finite Groups Random
2015/8/26
Markov chains on finite sets are used in a great variety of situations
to approximate, understand and sample from their limit distribution. A familiar
example is provided by card shuffling methods. ...
Wreath products are a type of semidirect product. They play an important
role in group theory. This paper studies the basic behavior of simple random
walks on such groups and shows that these walks ...
Random walks on finite rank solvable groups
random walk heat kernel decay asymptotic invariants of infinite groups Prüfer rank – solvable group
2015/8/26
We establish the lower bound p2t (e, e) exp(−t1/3), for the large times asymptotic
behaviours of the probabilities p2t (e, e) of return to the origin at even times 2t, for
random walks assoc...
second moment but satisfying some weaker finite moment condition. For
any locally compact unimodular group G and any positive function :G→
[0,+∞], we introduce a function G, which describes the ...
A Gaussian upper bound for the iterated kernels of Markov chains is obtained under some natural conditions. This result applies in particular to simple random walks on any locally compact unimodular g...
Probability on Groups: Random Walks and Invariant Diffusions
Invariant Diffusions Random Walks
2015/8/26
What do card shuffling, volume
growth, and Harnack inequalities
have to do with each other? They all
arise in the study of random walks
on groups. Probability on groups is
concerned with probabil...
Mixing times for random walks on geometric random graphs
Random geometric random graph nodes wireless network model and threshold properties random walk figure d dimension
2015/8/11
A geometric random graph, G^d(n,r), is formed as follows: place n nodes uniformly at random onto the surface of the d-dimensional unit torus and connect nodes which are within a distance r of each oth...