中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/92874
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78852/78852 (100%)
Visitors : 36758928      Online Users : 4734
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/92874


    Title: 一維和二維的标准以及條件隨機遊走的性質;Properties of One and Two Dimensional Random Walks: Simple and Conditioned
    Authors: 黎懷仁;Nhan, Le Hoai
    Contributors: 數學系
    Keywords: 隨機遊走;條件隨機遊走;Random walks;Conditional Random walks
    Date: 2023-07-17
    Issue Date: 2023-10-04 16:12:33 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 我們考慮在 $\ZZ^d$、$d=1,2$ 上的簡單隨機遊走 $S_n$,並考慮其限制在未到達原點,稱作 $\hat{S}_n$。 從點 $x \in \ZZ^d$ 開始的簡單隨機遊走定義為
    \begin{equation*}
    S_n = x + X_1 + X_2+ \cdots + X_n,
    \end{equation*}
    而 $\hat{S}_n$ 是
    \begin{equation*}
    \hat{S}_n = x + \hat{X}_1 + \hat{X}_2+ \cdots + \hat{X}_n.
    \end{equation*}
    它們都是具有轉移機率的馬爾可夫鏈
    \begin{equation*}
    \PP[S_n=y|S_{n-1}=x] = \frac{1}{2d} \qquad \text{if } ||y-x||=1,
    \end{equation*}

    \begin{equation*}
    \PP[\hat{S}_n = y|\hat{S}_{n-1}=x] = \left\{
    \begin{array}{ll}
    \displaystyle \dfrac{1}{2d}\frac{a(y)}{a(x)} & \text{if } x \ne 0 \text{ and } ||y-x||=1\\
    0& \text{otherwise.}
    \end{array}
    \right.
    \end{equation*}
    這裡 $a(x)$ 是 $S_n$ 的勢能核函數。
    設 $\tau$ 和 $\hat{\tau}$ 為 $\ZZ^d$ 的連通有限子集相對於 $S$ 和 $\hat{S}$ 的存活時間。 $\tau$ 和 $\hat{\tau}$ 幾乎必然是有限的。 我們將根據 $D$ 上限制的轉移矩陣和 $D$ 上的格林函數給出它們的分佈和期望值的表達式。 $S_n$ 是鞅,但 $\hat{S}_n$ 是嚴格的下鞅。 我們還給出充要條件,使得 $\hat{S}_n$ 和 $n$ 的函數是鞅。;We consider random walks on $\ZZ^d$, $d=1,2$ in case simple and conditioned on never hit the origin. The simple random walk starting at a point $x \in \ZZ^d$ is defined as
    \begin{equation*}
    S_n = x + X_1 + X_2+ \cdots + X_n
    \end{equation*}
    whereas the conditioned one is
    \begin{equation*}
    \hat{S}_n = x + \hat{X}_1 + \hat{X}_2+ \cdots + \hat{X}_n.
    \end{equation*}
    They are both Markov chains with transition probabilities
    \begin{equation*}
    \PP[S_n=y|S_{n-1}=x] = \frac{1}{2d} \qquad \text{if } ||y-x||=1,
    \end{equation*}
    and
    \begin{equation*}
    \PP[\hat{S}_n = y|\hat{S}_{n-1}=x] = \left\{
    \begin{array}{ll}
    \displaystyle \dfrac{1}{2d}\frac{a(y)}{a(x)} & \text{if } x \ne 0 \text{ and } ||y-x||=1\\
    0& \text{otherwise}
    \end{array}
    \right.
    \end{equation*}
    here $a(x)$ is the potential kernel of $S_n$.
    Let $\tau$ and $\hat{\tau}$ be the exiting time of a connected finite subset of $\ZZ^d$ with respect to $S$ and $\hat{S}$. $\tau$ and $\hat{\tau}$ are finite almost surely. We will give an expression of their distribution and expectation in terms of transition matrix restricted on $D$ and the Green function on $D$. The simple random walk are martingale but the conditioned is a strictly submartingale. We also give necessary and sufficiency condition such that a function of $\hat{S}_n$ and $n$ is a martingale.
    Appears in Collections:[Graduate Institute of Mathematics] Electronic Thesis & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML61View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明