DOCSLIB.ORG

© in This Web Service Cambridge University Press Cambridge University Press 978-0-521-14577-0

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
© in This Web Service Cambridge University Press Cambridge University Press 978-0-521-14577-0 Cambridge University Press 978-0-521-14577-0 - Probability and Mathematical Genetics Edited by N. H. Bingham and C. M. Goldie Index More information Index ABC, approximate Bayesian almost complete, 141 computation almost complete Abecasis, G. R., 220 metrizabilityalmost-complete Abel Memorial Fund, 380 metrizability, see metrizability Abou-Rahme, N., 430 α-stable, see subordinator AB-percolation, see percolation Alsmeyer, G., 114 Abramovitch, F., 86 alternating renewal process, see renewal accumulate essentially, 140, 161, 163, theory 164 alternating word, see word Addario-Berry, L., 120, 121 AMSE, average mean-square error additive combinatorics, 138, 162–164 analytic set, 147 additive function, 139 ancestor gene, see gene adjacency relation, 383 ancestral history, 92, 96, 211, 256, 360 Adler, I., 303 ancestral inference, 110 admixture, 222, 224 Anderson, C. W., 303, 305–306 adsorption, 465–468, 477–478, 481, see Anderson, R. D., 137 also cooperative sequential Andjel, E., 391 adsorption model (CSA) Andrews, G. E., 372 advection-diffusion, 398–400, 408–410 anomalous spreading, 125–131 a.e., almost everywhere Antoniak, C. E., 324, 330 Affymetrix gene chip, 326 Applied Probability Trust, 33 age-dependent branching process, see appointments system, 354 branching process approximate Bayesian computation Aldous, D. J., 246, 250–251, 258, 328, (ABC), 214 448 approximate continuity, 142 algorithm, 116, 219, 221, 226–228, 422, Archimedes of Syracuse see also computational complexity, weakly Archimedean property, coupling, Kendall–Møller 144–145 algorithm, Markov chain Monte area-interaction process, see point Carlo (MCMC), phasing algorithm process perfect simulation algorithm, 69–71 arithmeticity, 172 allele, 92–103, 218, 222, 239–260, 360, arithmetic progression, 138, 157, 366, see also minor allele frequency 162–163 (MAF) Arjas, E., 350 allelic partition distribution, 243, 248, Aronson, D. G., 400 250 ARP, alternating renewal process two-allele model, 214 Arratia, R., 102, 106–109, 247, 328 two-allele process, 360, 363 a.s., almost sure(ly) allocation process, 467, 480–481 Askey, R,, 372 Allstat, 303, 317 Asmussen, S., 346 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-0-521-14577-0 - Probability and Mathematical Genetics Edited by N. H. Bingham and C. M. Goldie Index More information 510 Index assay, 205, 326 Bayesian inference, 22, 65, 214, assessment, see computer-based test 222–223 associated random walk, see random Bayesian nonparametric modelling, walk 321–323, 325–326 asymptotic independence, 352, 356 Bayesian partition, 340 Athreya, K. B., 346 Bayesian statistics, 36–38, 40–41, 251, Atiyah, M. F., 20–21, 23, 26 254, 265, 319 Atkinson, F. V., 239 Bayes’s theorem, 81 attraction/repulsion, see point process: BayesThresh method, see wavelet clustering Beagle, see phasing algorithm Austin, T., 59 Beal, M. J., 329 Auton, A., 223 Beaumont, M. A., 214 autonomous equation, 495, 498 Beder, B., 259 auto-Poisson process, see Poisson, S. D. Beerli, P., 214 autoregressive process, 352 Belkhir, K., 221–222 average mean-square error (AMSE), see Bellman, R. E. error Bellman–Harris process, 113, 116, 118 Awadalla, P., 223 Ben Arous, G., 452–453, 458 Axiom, see computer algebra Beneˇs, V. E., 420 Benjamini, I., 392–393 Bachmann, M., 122 Benjamini, Y., 86 Baddeley, A. J., 67, 71–73, 75 Bensoussan, A., 400 Bailleul, I., 452 Bergelson, V., 138, 157, 159, 161, 163 Baire, R.-L. Berkson, J., 189 Baire category theorem, 137 Bertoin, J., 46, 265, 273, 378 Baire function, 138 Bessel, F. W. Baire property, 138, 140 Bessel process, 271 Baire set, 138–164 beta distribution, 270–276, 280–284, Baire space, 142 328–329, 334, 359–360, 364–365, Baire’s theorem, 141 374 balanced incomplete block design, 30 bivariate beta distribution, 368–370 Balding, D. J., 214 Bhamidi, S., 55 Balister, P. N., 384 bias, 193, 196 ballot theorem, 38 Bibby, J. M., 353 balls in cells, 301 binary branching Brownian motion, see Baltr¯unas, A., 173 Brownian motion Banach, S. Bingham, N. H., 194 Banach space, 164 biomass, 137 bandwidth, 189–190, 195–199 birth-and-death model, see Barbour, A. D., 247, 328, 362, 448 mathematical genetics Barry, J., 186 birth-and-death process, 67 Bartlett, M. S., 25, 27, 32–33 bitopology, see topology base, 240 Bj¨ornberg, J. E., 391 base measure, 322, 328, 334 Blackwell, D., 322, 330 Batchelor, G. K., 24, 28 Blei, D. M., 329 Bather, J. A., 21, 23, 25, 32 blind transmission, 484–486, 489 Baudoin, F., 461 Blin-Stoyle, R. J., 31 Bayes, T., see also approximate blood group, 239 Bayesian computation (ABC), Bobecka, K., 273 conjugacy, hyperparameter, Bochner, S., 360–361, 368, 370, posterior predictive distribution, 372–373, 378 posterior sampling, posterior Bollob´as, B., 384 simulation, predictive density Bolthausen, E., 388 Bayesian curve fitting, 326 Bonald, T., 424–425 Bayesian density estimation, 326 Bond, S., 317 Bayesian hierarchical model, 36, 78, Bonhomme, S., 186 326 Bonnefont, M., 461 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-0-521-14577-0 - Probability and Mathematical Genetics Edited by N. H. Bingham and C. M. Goldie Index More information Index 511 Borovkov, A. A., 416 Butucea, C., 186 Borwein, D., 137–138, 157 Cambridge, University of, xv–xvi, 19, boundary bias, 190 33, 170 Bousch, T., 466 Mathematical Tripos, 19–24 Bowcock, A. M., 221 Pembroke College, 17, 19, 26 boxcar function, 195 Statistical Laboratory, 22, 24, 29, 34 Bradley, R. C., 356 Campbell, P. J., 92 Bramson, M. D., 118, 120–121, 391, 416 Camps, A., 21 branching process, 137, 260, 346, 493, cancer, 91–110 498, 502, 505–508, see also Cane, V. R., 24, 29 Bellman–Harris process, branching Cannings, C., 242 Brownian motion, branching Cannings model, 248 random walk (BRW), extinction, capacity, 406, see also channel capacity, Galton–Watson process, Markov network capacity, Newtonian branching process, Yule process capacity age-dependent branching process, Carath´eodory, C., 348 114–115 Carpio, K. J. E., 181 continuous-state branching process, Carroll, R. J., 186–187, 191 378 Cartwright, M. L., 20 general branching process, 116, 119 cascade, see multiplicative cascade multitype age-dependent branching Cassels, J. W. S., 29 process, 114 Catalan, E. C. supercritical branching process, 115 Catalan number, 51 weighted branching process, 116 category measure, 147 branching random walk (BRW), 47, Cauchy, A. L. 114–131, see also anomalous Cauchy problem, 398, 401, 408–409 spreading, extinction, spreading Cayley, A. out, spreading speed Cayley’s formula, 51 irreducible BRW, 124, 130 CDP, coloured Dirichlet process multitype BRW, 117, 124–131 cell, 91–97, 100, 110, 206 reducible BRW, 125–131 CFTP, coupling from the past two-type BRW, 125–131 Chafa¨ı, D., 461 Breiman, L., 347 channel, see also Gaussian channel Bressler, G., 489 capacity, 485, 488–490 Briggs, A., 31–32 coding, 484 Bristol, University of, xvi, 19, 381 memoryless channel, 485 British Columbia, University of, 394 characteristic function, 188, 191, Broadbent, S. R., 381 193–194, 197 Brookmeyer, R., 186 characteristic polynomial, 386 Brown, R. charge-state model, see mathematical branching Brownian motion, 118, 120, genetics 123, 128 Chen, H., 422 Brownian differential, 454 Chen, L., see Stein–Chen approximation Brownian excursion, 53 Chen, M. F., 451 Brownian motion, 51, 60, 271, 361, Chinese restaurant process (CRP), 46, 374, 398–411, 417–443, 447–461, 97–99, 276 467 Christ’s College, Finchley, xv, 18 Brownian network, 418, 426–442 chromosome, 93, 206–212, 214–231 Brownian snake, 53 Chung, K. L., 25, 28, 31 Browning, B. L., 216 clairvoyancy, see compatibility, demon, Browning, S. R., 216 embedding, scheduling BRW, branching random walk clopen, 147 Brydges, D., 502 close-packed lattice, see lattice bulk deletion, see deletion CLT, central limit theorem Buonaccorsi, J. P., 187 cluster(ing), 328, 333–340, see also Burdzy, K., 449 point process burn-in, 230–233, 340 background cluster model, 335–337 © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-0-521-14577-0 - Probability and Mathematical Genetics Edited by N. H. Bingham and C. M. Goldie Index More information 512 Index cluster size, 324 convex optimization, 423, 425, 433, 437, co-adapted coupling, see coupling 439 coagulation, 273, see also coalescence, cooperative sequential adsorption model Smoluchowski coagulation equation (CSA), 465 coalescence, 39, 46–50, 54, 83, 206–223, Coppersmith, D., 384 265, 361, 364, 367, 375, see also copula, 41 Kingman coalescent, Li and copying, 212, 216–219, 225–227 Stephens model Corander, J., 221–222 inference, 205, 213–215, 220 correlation, 352 n-coalescents, 211 sequence, 368–372 coalescent tree, 210, 214, 217, 361, 366, coupling, 384n, 385, 447–461 376 co-adapted coupling, 447–454, coding, 485–488, see also channel coding 460–461 cofinality, 139 control, 454–458 co-immersed coupling, see coupling: coupling from the past (CFTP), 65, co-adapted 78, 82, 88 coin tossing, 136, 381 dominated CFTP algorithm, 65, 74n collision, 384–385 dominated coupling from the past, colour, 139, 330, 333–336 67–69 coloured Dirichlet process (CDP), 334 γ-coupling, 451 colouring, 268, 272, 275–276, 278, 334, maximal coupling, 447–450, 460–461 360, 368 mirror coupling, 451 combinatorics, 59, see also additive reflection coupling, 447, 450–453, combinatorics 458–460 compatibility rotation coupling, 447, 453, 460 clairvoyant compatibility, 384–385 shift-coupling, 450 complementary slackness, 423, 425 synchronous coupling, 447, 452–453, complete monotonicity, 375 458–460 complete neutrality, 273 time, 447, 452, 454, 458–461 completion, 140 coupon collecting, 271, 282, 300–303 composition, 266–267, 274, 278–280, 287 covariate, 320, 326, 329, 336–337, 339 compound Poisson process, see Poisson, Cox, D. R., 27, 33 S. D. Cox process, 71, 170–173, 181 computational complexity, 69–70, 76, Cram´er,C. H., 346 85, 205 Cranston, M., 451–453, 458, 461 computational statistics, see statistics Crick, F.
Load more

Recommended publications
  • Interpolation for Partly Hidden Diffusion Processes*
    Interpolation for partly hidden di®usion processes* Changsun Choi, Dougu Nam** Division of Applied Mathematics, KAIST, Daejeon 305-701, Republic of Korea Abstract Let Xt be n-dimensional di®usion process and S(t) be a smooth set-valued func- tion. Suppose X is invisible when X S(t), but we can see the process exactly t t 2 otherwise. Let X S(t ) and we observe the process from the beginning till the t0 2 0 signal reappears out of the obstacle after t0. With this information, we evaluate the estimators for the functionals of Xt on a time interval containing t0 where the signal is hidden. We solve related 3 PDE's in general cases. We give a generalized last exit decomposition for n-dimensional Brownian motion to evaluate its estima- tors. An alternative Monte Carlo method is also proposed for Brownian motion. We illustrate several examples and compare the solutions between those by the closed form result, ¯nite di®erence method, and Monte Carlo simulations. Key words: interpolation, di®usion process, excursions, backward boundary value problem, last exit decomposition, Monte Carlo method 1 Introduction Usually, the interpolation problem for Markov process indicates that of eval- uating the probability distribution of the process between the discretely ob- served times. One of the origin of the problem is SchrÄodinger's Gedankenex- periment where we are interested in the probability distribution of a di®usive particle in a given force ¯eld when the initial and ¯nal time density functions are given. We can obtain the desired density function at each time in a given time interval by solving the forward and backward Kolmogorov equations.
    [Show full text]
  • Patterns in Random Walks and Brownian Motion
    Patterns in Random Walks and Brownian Motion Jim Pitman and Wenpin Tang Abstract We ask if it is possible to find some particular continuous paths of unit length in linear Brownian motion. Beginning with a discrete version of the problem, we derive the asymptotics of the expected waiting time for several interesting patterns. These suggest corresponding results on the existence/non-existence of continuous paths embedded in Brownian motion. With further effort we are able to prove some of these existence and non-existence results by various stochastic analysis arguments. A list of open problems is presented. AMS 2010 Mathematics Subject Classification: 60C05, 60G17, 60J65. 1 Introduction and Main Results We are interested in the question of embedding some continuous-time stochastic processes .Zu;0Ä u Ä 1/ into a Brownian path .BtI t 0/, without time-change or scaling, just by a random translation of origin in spacetime. More precisely, we ask the following: Question 1 Given some distribution of a process Z with continuous paths, does there exist a random time T such that .BTCu BT I 0 Ä u Ä 1/ has the same distribution as .Zu;0Ä u Ä 1/? The question of whether external randomization is allowed to construct such a random time T, is of no importance here. In fact, we can simply ignore Brownian J. Pitman ()•W.Tang Department of Statistics, University of California, 367 Evans Hall, Berkeley, CA 94720-3860, USA e-mail: [email protected]; [email protected] © Springer International Publishing Switzerland 2015 49 C. Donati-Martin et al.
    [Show full text]
  • Constructing a Sequence of Random Walks Strongly Converging to Brownian Motion Philippe Marchal
    Constructing a sequence of random walks strongly converging to Brownian motion Philippe Marchal To cite this version: Philippe Marchal. Constructing a sequence of random walks strongly converging to Brownian motion. Discrete Random Walks, DRW’03, 2003, Paris, France. pp.181-190. hal-01183930 HAL Id: hal-01183930 https://hal.inria.fr/hal-01183930 Submitted on 12 Aug 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Discrete Mathematics and Theoretical Computer Science AC, 2003, 181–190 Constructing a sequence of random walks strongly converging to Brownian motion Philippe Marchal CNRS and Ecole´ normale superieur´ e, 45 rue d’Ulm, 75005 Paris, France [email protected] We give an algorithm which constructs recursively a sequence of simple random walks on converging almost surely to a Brownian motion. One obtains by the same method conditional versions of the simple random walk converging to the excursion, the bridge, the meander or the normalized pseudobridge. Keywords: strong convergence, simple random walk, Brownian motion 1 Introduction It is one of the most basic facts in probability theory that random walks, after proper rescaling, converge to Brownian motion. However, Donsker’s classical theorem [Don51] only states a convergence in law.
    [Show full text]
  • The Branching Process in a Brownian Excursion
    The Branching Process in a Brownian Excursion By J. Neveu Laboratoire de Probabilites Universite P. et M. Curie Tour 56 - 3eme Etage 75252 Paris Cedex 05 Jim Pitman* Department of Statistics University of California Berkeley, California 94720 United States *Research of this author supported in part by NSF Grant DMS88-01808. To appear in Seminaire de Probabilites XXIII, 1989. Technical Report No. 188 February 1989 Department of Statistics University of California Berkeley, California THE BRANCHING PROCESS IN A BROWNIAN EXCURSION by J. NEVEU and J. W. PirMAN t Laboratoire de Probabilit6s Department of Statistics Universit6 Pierre et Marie Curie University of California 4, Place Jussieu - Tour 56 Berkeley, California 94720 75252 Paris Cedex 05, France United States §1. Introduction. This paper offers an alternative view of results in the preceding paper [NP] concerning the tree embedded in a Brownian excursion. Let BM denote Brownian motion on the line, BMX a BM started at x. Fix h >0, and let X = (X ,,0t <C) be governed by Itk's law for excursions of BM from zero conditioned to hit h. Here X may be presented as the portion of the path of a BMo after the last zero before the first hit of h, run till it returns to zero. See for instance [I1, [R1]. Figure 1. Definition of X in terms of a BMo. h Xt 0 A Ad' \A] V " - t - 4 For x > 0, let Nh be the number of excursions (or upcrossings) of X from x to x + h. Theorem 1.1 The process (Nh,x 0O) is a continuous parameter birth and death process, starting from No = 1, with stationary transition intensities from n to n ± 1 of n Ih.
    [Show full text]
  • [Math.PR] 9 May 2002
    Poisson Process Partition Calculus with applications to Exchangeable models and Bayesian Nonparametrics. Lancelot F. James1 The Hong Kong University of Science and Technology (May 29, 2018) This article discusses the usage of a partiton based Fubini calculus for Poisson processes. The approach is an amplification of Bayesian techniques developed in Lo and Weng for gamma/Dirichlet processes. Applications to models are considered which all fall within an inhomogeneous spatial extension of the size biased framework used in Perman, Pitman and Yor. Among some of the results; an explicit partition based calculus is then developed for such models, which also includes a series of important exponential change of measure formula. These results are then applied to solve the mostly unknown calculus for spatial L´evy-Cox moving average models. The analysis then proceeds to exploit a structural feature of a scaling operation which arises in Brownian excursion theory. From this a series of new mixture representations and posterior characterizations for large classes of random measures, including probability measures, are given. These results are applied to yield new results/identities related to the large class of two-parameter Poisson-Dirichlet models. The results also yields easily perhaps the most general and certainly quite informative characterizations of extensions of the Markov-Krein correspondence exhibited by the linear functionals of Dirichlet processes. This article then defines a natural extension of Doksum’s Neutral to the Right priors (NTR) to a spatial setting. NTR models are practically synonymous with exponential functions of subordinators and arise in Bayesian non-parametric survival models. It is shown that manipulation of the exponential formulae makes what has been otherwise formidable analysis transparent.
    [Show full text]
  • The First Passage Sets of the 2D Gaussian Free Field: Convergence and Isomorphisms Juhan Aru, Titus Lupu, Avelio Sepúlveda
    The first passage sets of the 2D Gaussian free field: convergence and isomorphisms Juhan Aru, Titus Lupu, Avelio Sepúlveda To cite this version: Juhan Aru, Titus Lupu, Avelio Sepúlveda. The first passage sets of the 2D Gaussian free field: convergence and isomorphisms. Communications in Mathematical Physics, Springer Verlag, 2020, 375 (3), pp.1885-1929. 10.1007/s00220-020-03718-z. hal-01798812 HAL Id: hal-01798812 https://hal.archives-ouvertes.fr/hal-01798812 Submitted on 24 May 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THE FIRST PASSAGE SETS OF THE 2D GAUSSIAN FREE FIELD: CONVERGENCE AND ISOMORPHISMS. JUHAN ARU, TITUS LUPU, AND AVELIO SEPÚLVEDA Abstract. In a previous article, we introduced the first passage set (FPS) of constant level −a of the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the boundary by a path along which the GFF is greater than or equal to −a. This description can be taken as a definition of the FPS for the metric graph GFF, and it justifies the analogy with the first hitting time of −a by a one- dimensional Brownian motion.
    [Show full text]
  • Arxiv:Math/0605484V1
    RANDOM REAL TREES by Jean-Fran¸cois Le Gall D.M.A., Ecole normale sup´erieure, 45 rue d’Ulm, 75005 Paris, France [email protected] Abstract We survey recent developments about random real trees, whose pro- totype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in particular of the relations between dis- crete Galton-Watson trees and continuous random trees. We then discuss the particular class of self-similar random real trees called stable trees, which generalize the CRT. We review several important results concern- ing stable trees, including their branching property, which is analogous to the well-known property of Galton-Watson trees, and the calculation of their fractal dimension. We then consider spatial trees, which combine the genealogical structure of a real tree with spatial displacements, and we explain their connections with superprocesses. In the last section, we deal with a particular conditioning problem for spatial trees, which is closely related to asymptotics for random planar quadrangulations. R´esum´e Nous discutons certains d´eveloppements r´ecents de la th´eorie des ar- bres r´eels al´eatoires, dont le prototype est le CRT introduit par Aldous en 1991. Nous introduisons le formalisme d’arbre r´eel, qui fournit une pr´esentation ´el´egante de la th´eorie, et en particulier des relations entre les arbres de Galton-Watson discrets et les arbres continus al´eatoires. Nous discutons ensuite la classe des arbres auto-similaires appel´es arbres sta- bles, qui g´en´eralisent le CRT.
    [Show full text]
  • The Brownian Fan
    The Brownian fan April 9, 2014 Martin Hairer1 and Jonathan Weare2 1 Mathematics Department, the University of Warwick 2 Statistics Department and the James Frank Institute, the University of Chicago Email: [email protected], Email: [email protected] Abstract We provide a mathematical study of the modified Diffusion Monte Carlo (DMC) algorithm introduced in the companion article [HW14]. DMC is a simulation technique that uses branching particle systems to represent expectations associated with Feynman- Kac formulae. We provide a detailed heuristic explanation of why, in cases in which a stochastic integral appears in the Feynman-Kac formula (e.g. in rare event simulation, continuous time filtering, and other settings), the new algorithm is expected to converge in a suitable sense to a limiting process as the time interval between branching steps goes to 0. The situation studied here stands in stark contrast to the “na¨ıve” generalisation of the DMC algorithm which would lead to an exponential explosion of the number of particles, thus precluding the existence of any finite limiting object. Convergence is shown rigorously in the simplest possible situation of a random walk, biased by a linear potential. The resulting limiting object, which we call the “Brownian fan”, is a very natural new mathematical object of independent interest. Keywords: Diffusion Monte Carlo, quantum Monte Carlo, rare event simulation, sequential Monte Carlo, particle filtering, Brownian fan, branching process Contents 1 Introduction 2 1.1 Notations . .5 2 The continuous-time limit and the Brownian fan 5 2.1 Heuristic derivation of the continuous-time limit . .6 2.2 Some properties of the limiting process .
    [Show full text]
  • THE INCIPIENT INFINITE CLUSTER in HIGH-DIMENSIONAL PERCOLATION 1. Introduction Percolation Has Received Much Attention in Mathem
    ELECTRONIC RESEARCH ANNOUNCEMENTS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 4, Pages 48{55 (July 31, 1998) S 1079-6762(98)00046-8 THE INCIPIENT INFINITE CLUSTER IN HIGH-DIMENSIONAL PERCOLATION TAKASHI HARA AND GORDON SLADE (Communicated by Klaus Schmidt) Abstract. We announce our recent proof that, for independent bond perco- lation in high dimensions, the scaling limits of the incipient infinite cluster’s two-point and three-point functions are those of integrated super-Brownian excursion (ISE). The proof uses an extension of the lace expansion for perco- lation. 1. Introduction Percolation has received much attention in mathematics and in physics, as a simple model of a phase transition. To describe the phase transition, associate to each bond x; y (x; y Zd, separated by unit Euclidean distance) a Bernoulli { } ∈ random variable n x;y taking the value 1 with probability p and the value 0 with probability 1 p.{ These} random variables are independent, and p is a control − parameter in [0; 1]. A bond x; y is said to be occupied if n x;y =1,andvacant { } { } if n x;y = 0. The control parameter p is thus the density of occupied bonds in { } the infinite lattice Zd. The percolation phase transition is the fact that, for d 2, there is a critical value p = p (d) (0; 1), such that for p<p there is with≥ c c ∈ c probability 1 no infinite connected cluster of occupied bonds, whereas for p>pc there is with probability 1 a unique infinite connected cluster of occupied bonds (percolation occurs).
    [Show full text]
  • A Guide to Brownian Motion and Related Stochastic Processes
    Vol. 0 (0000) A guide to Brownian motion and related stochastic processes Jim Pitman and Marc Yor Dept. Statistics, University of California, 367 Evans Hall # 3860, Berkeley, CA 94720-3860, USA e-mail: [email protected] Abstract: This is a guide to the mathematical theory of Brownian mo- tion and related stochastic processes, with indications of how this theory is related to other branches of mathematics, most notably the classical the- ory of partial differential equations associated with the Laplace and heat operators, and various generalizations thereof. As a typical reader, we have in mind a student, familiar with the basic concepts of probability based on measure theory, at the level of the graduate texts of Billingsley [43] and Durrett [106], and who wants a broader perspective on the theory of Brow- nian motion and related stochastic processes than can be found in these texts. Keywords and phrases: Markov process, random walk, martingale, Gaus- sian process, L´evy process, diffusion. AMS 2000 subject classifications: Primary 60J65. Contents 1 Introduction................................. 3 1.1 History ................................ 3 1.2 Definitions............................... 4 2 BM as a limit of random walks . 5 3 BMasaGaussianprocess......................... 7 3.1 Elementarytransformations . 8 3.2 Quadratic variation . 8 3.3 Paley-Wiener integrals . 8 3.4 Brownianbridges........................... 10 3.5 FinestructureofBrownianpaths . 10 arXiv:1802.09679v1 [math.PR] 27 Feb 2018 3.6 Generalizations . 10 3.6.1 FractionalBM ........................ 10 3.6.2 L´evy’s BM . 11 3.6.3 Browniansheets ....................... 11 3.7 References............................... 11 4 BMasaMarkovprocess.......................... 12 4.1 Markovprocessesandtheirsemigroups. 12 4.2 ThestrongMarkovproperty. 14 4.3 Generators .............................
    [Show full text]
  • Interval Partition Evolutions with Emigration Related to the Aldous Diffusion
    INTERVAL PARTITION EVOLUTIONS WITH EMIGRATION RELATED TO THE ALDOUS DIFFUSION Noah Forman, Soumik Pal, Douglas Rizzolo, and Matthias Winkel Abstract. We construct a stationary Markov process corresponding to the evolution of masses and distances of subtrees along the spine from the root to a branch point in a conjectured sta- tionary, continuum random tree-valued diffusion that was proposed by David Aldous. As a corollary this Markov process induces a recurrent extension, with Dirichlet stationary distribu- tion, of a Wright{Fisher diffusion for which zero is an exit boundary of the coordinate processes. This extends previous work of Pal who argued a Wright{Fisher limit for the three-mass process under the conjectured Aldous diffusion until the disappearance of the branch point. In partic- ular, the construction here yields the first stationary, Markovian projection of the conjectured diffusion. Our construction follows from that of a pair of interval partition-valued diffusions that were previously introduced by the current authors as continuum analogues of down-up chains 1 1 1 on ordered Chinese restaurants with parameters 2 ; 2 and 2 ; 0 . These two diffusions are given by an underlying Crump{Mode{Jagers branching process, respectively with or without immigration. In particular, we adapt the previous construction to build a continuum analogue 1 1 of a down-up ordered Chinese restaurant process with the unusual parameters 2 ; − 2 , for which the underlying branching process has emigration. 1. Introduction The Aldous chain is a Markov chain on the space of rooted binary trees with n labeled leaves. Each transition of the Aldous chain, called a down-up move, has two steps.
    [Show full text]
  • Brownian Motion, Complex Analysis, and the Dimension of the Brownian Frontier
    To the Chairman of Examiners for Part III Mathematics. Dear Sir, I enclose the Part III essay of Sam Watson. Signed (Director of Studies) Brownian motion, complex analysis, and the dimension of the Brownian frontier Sam Watson Trinity College Cambridge University 30 April, 2010 I declare that this essay is work done as part of the Part III Examination. I have read and understood the Statement on Plagiarism for Part III and Graduate Courses issued by the Faculty of Mathematics, and have abided by it. This essay is the result of my own work, and except where explicitly stated otherwise, only includes material undertaken since the publication of the list of essay titles, and includes nothing which was performed in collaboration. No part of this essay has been submitted, or is concurrently being submitted, for any degree, diploma or similar qualification at any university or similar institution. Signed: 58 County Road 362 Oxford, Mississippi 38655 USA Brownian motion, complex analysis, and the dimension of the Brownian frontier Contents 1 Introduction 1 2 Brownian Motion and Complex Analysis1 2.1 One-dimensional Brownian motion............................. 1 2.2 Brownian motion in Rd .................................... 4 2.3 Conformal invariance of planar Brownian motion .................... 7 2.4 Applications to complex analysis............................... 8 2.5 Applications to planar Brownian motion.......................... 9 3 Schramm-Loewner evolutions and the dimension of the Brownian frontier 11 3.1 Overview............................................. 11 3.2 Brownian excursions...................................... 11 3.3 Reflected Brownian excursions................................ 13 3.4 Loewner’s theorem....................................... 15 3.5 Restriction property of SLE8/3 ................................. 17 3.6 Hausdorff dimension ....................................
    [Show full text]