• DocumentCode
    894934
  • Title

    Self-avoiding random loops

  • Author

    Dubins, Lester E. ; Orlitsky, Alon ; Reeds, Jim A. ; Shepp, L.A.

  • Author_Institution
    Dept. of Math., California Univ., Berkeley, CA, USA
  • Volume
    34
  • Issue
    6
  • fYear
    1988
  • fDate
    11/1/1988 12:00:00 AM
  • Firstpage
    1509
  • Lastpage
    1516
  • Abstract
    A random loop, or polygon, is a simple random walk whose trajectory is a simple Jordan curve. The study of random loops is extended in two ways. First, the probability Pn(x,y) that a random n-step loop contains a point (x,y) in the interior of the loop is studied, and (1/2, 1/2) is shown to be (1/2)-(1/ n). It is plausible that Pn(x,y) tends toward 1/2 for all ( x,y), but this is not proved even for (x,y)=(3/2,1/2) A way is offered to simulate random n-step self-avoiding loops. Numerical evidence obtained with this simulation procedure suggests that the probability Pn (3/2,1/2)≈(1/2)-(c/n), for some fixed c
  • Keywords
    information theory; probability; random processes; polygon; probability; random n-step self-avoiding loops; simple Jordan curve; simple random walk; simulation procedure; trajectory; Abstracts; Chemistry; Gaussian processes; Mathematics; Numerical analysis; Polymers; Random variables; Statistical distributions; Transaction databases;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.21290
  • Filename
    21290