Loading...
Search
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
Digital Object List
Bookmark
Review List
1283 viewed
قدم زدن تصادفی اریب روی درخت های گالتون‐واتسون برگ دار
خانیها، سایه Khaniha, Sayeh
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 50827 (02)
- University: Sharif University of Technology
- Department: Mathematical Sciences
- Advisor(s): Haji Mirsadeghi, Mir Omid
- Abstract:
- We consider a biased random walk Xn on a Galton-watson tree with leaves in the subballistic regime. We prove that there exists an explicit constant ϒ = ϒ(β) ε (0,1),such that |Xn| is of order n. If Δn be the hitting time of level n, we prove that Δn{n1{ is tight. More ever we show thatΔn{n1{ does not converge in law. We prove that along the sequences npkq Xk\ , Δn{n1{ converges to certain infinity divisible laws. Key tools for the proof are the classical Harris decomposition for Galton-Watson trees, a new variant of regeneration times and the careful analysis of triangular arrays of i.i.d. random variables
- Keywords:
- Branching Proccess ; Random Walk ; Random Walk on Random Environment ; Electrical Network ; Infinitly Divisible Distribution
محتواي کتاب