Gør som tusindvis af andre bogelskere
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.Du kan altid afmelde dig igen.
A more accurate title for this book would be "Problems dealing with the non-intersection of paths of random walks. " These include: harmonic measure, which can be considered as a problem of nonintersection of a random walk with a fixed set; the probability that the paths of independent random walks do not intersect; and self-avoiding walks, i. e. , random walks which have no self-intersections. The prerequisite is a standard measure theoretic course in probability including martingales and Brownian motion. The first chapter develops the facts about simple random walk that will be needed. The discussion is self-contained although some previous expo­ sure to random walks would be helpful. Many of the results are standard, and I have made borrowed from a number of sources, especially the ex­ cellent book of Spitzer [65]. For the sake of simplicity I have restricted the discussion to simple random walk. Of course, many of the results hold equally well for more general walks. For example, the local central limit theorem can be proved for any random walk whose increments have mean zero and finite variance. Some of the later results, especially in Section 1. 7, have not been proved for very general classes of walks. The proofs here rely heavily on the fact that the increments of simple random walk are bounded and symmetric.
Introducing the heat equation and the closely related notion of harmonic functions from a probabilistic perspective, this book includes chapters on: the discrete case, random walk and the heat equation on the integer lattice; the continuous case, Brownian motion and the usual heat equation; and martingales and fractal dimension.
First released in 1991, this book surveys problems of nonintersection of random walks and the self-avoiding walk. Covers discrete harmonic measure; probability that independent random walks do not intersect and properties of walks without self-intersections.
Based on classes in probability for advanced undergraduates held at the IAS/Park City Mathematics Institute (Utah), this title is derived from both lectures (Chapters 1-10) and computer simulations (Chapters 11-13) that were held during the program. It concludes with a number of problems ranging from routine to very difficult.
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.