Branching structure for an (L-1) random walk in random environment and its applications

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

31 pages

Scientific paper

By decomposing the random walk path, we construct a multitype branching process with immigration in random environment for corresponding random walk with bounded jumps in random environment. Then we give two applications of the branching structure. Firstly, we specify the explicit invariant density by a method different with the one used in Br\'emont [3] and reprove the law of large numbers of the random walk by a method known as the environment viewed from particles". Secondly, the branching structure enables us to prove a stable limit law, generalizing the result of Kesten-Kozlov-Spitzer [11] for the nearest random walk in random environment. As a byproduct, we also prove that the total population of a multitype branching process in random environment with immigration before the first regeneration belongs to the domain of attraction of some \kappa -stable law.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Branching structure for an (L-1) random walk in random environment and its applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Branching structure for an (L-1) random walk in random environment and its applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Branching structure for an (L-1) random walk in random environment and its applications will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-354121

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.