DOCSLIB.ORG

1 the Glivenko-Cantelli Theorem

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
1 the Glivenko-Cantelli Theorem 1 The Glivenko-Cantelli Theorem Let Xi; i = 1; : : : ; n be an i.i.d. sequence of random variables with distribu- tion function F on R. The empirical distribution function is the function of x defined by 1 X F^ (x) = IfX ≤ xg : n n i 1≤i≤n For a given x 2 R, we can apply the strong law of large numbers to the sequence IfXi ≤ xg; i = 1; : : : n to assert that F^n(x) ! F (x) a.s (in order to apply the strong law of large numbers we only need to show that E[jIfXi ≤ xgj] < 1, which in this case is trivial because jIfXi ≤ xgj ≤ 1). In this sense, F^n(x) is a reasonable estimate of F (x) for a given x 2 R. But is F^n(x) a reasonable estimate of the F (x) when both are viewed as functions of x? The Glivenko-Cantelli Thoerem provides an answer to this question. It asserts the following: Theorem 1.1 Let Xi; i = 1; : : : ; n be an i.i.d. sequence of random variables with distribution function F on R. Then, sup jF^n(x) − F (x)j ! 0 a:s: (1) x2R This result is perhaps the oldest and most well known result in the very large field of empirical process theory, which is at the center of much of modern econometrics. The statistic (1) is an example of a Kolmogorov-Smirnov statistic. The proof of the result will require the following lemma. Lemma 1.1 Let F be a (nonrandom) distribution function on R. For each > 0 there exists a finite partition of the real line of the form −∞ = t0 < t1 < ··· < tk = 1 such that for 0 ≤ j ≤ k − 1 − F (tj+1) − F (tj) ≤ : 1 Proof: Let > 0 be given. Let t0 = −∞ and for j ≥ 0 define tj+1 = supfz : F (z) ≤ F (tj) + g : Note that F (tj+1) ≥ F (tj)+. To see this, suppose that F (tj+1) < F (tj)+. Then, by right continuity of F there would exist δ > 0 so that F (tj+1 +δ) < F (tj) + , which would contradict the definition of tj+1. Thus, between tj and tj+1, F jumps by at least . Since this can happen at most a finite number of times, the partition is of the desired form, that is −∞ = t0 < − t1 < ··· < tk = 1 with k < 1. Moreover, F (tj+1) ≤ F (tj) + . To see this, note that by definition of tj+1 we have F (tj+1 − δ) ≤ F (tj) + for all δ > 0. − The desired result thus follows from the definition of F (tj+1). Proof of 1.1: It suffices to show that for any > 0 lim sup sup jF^n(x) − F (x)j ≤ a.s. n!1 x2R To this send, let > 0 be given and consider a partition of the real line into finitely many pieces of the form −∞ = t0 < t1 ··· < tk = 1 such that for 0 ≤ j ≤ k − 1 F (t− ) − F (t ) ≤ : j+1 j 2 The existence of such a partition is ensured by the previous lemma. For any x 2 R, there exists j such that tj ≤ x < tj+1. For such j, ^ ^ ^ − Fn(tj) ≤ Fn(x) ≤ Fn(tj+1) − F (tj) ≤ F (x) ≤ F (tj+1) ; which implies that ^ − ^ ^ − Fn(tj) − F (tj+1) ≤ Fn(x) − F (x) ≤ Fn(tj+1) − F (tj) : Furthermore, ^ − ^ Fn(tj) − F (tj) + F (tj) − F (tj+1) ≤ Fn(x) − F (x) ^ − − − ^ Fn(tj+1) − F (tj+1) + F (tj+1) − F (tj) ≥ Fn(x) − F (x) : 2 By construction of the partition, we have that F^ (t ) − F (t ) − ≤ F^ (x) − F (x) n j j 2 n F^ (t− ) − F (t− ) + ≥ F^ (x) − F (x) : n j+1 j+1 2 n The desired result now follows from the Strong Law of Large Numbers. 2 The Sample Median We now give a brief application of the Glivenko-Cantelli Theorem. Let Xi; i = 1; : : : ; n be an i.i.d. sequence of random variables with distribution F . Suppose one is interested in the median of F . Concretely, we will define 1 Med(F ) = inffx : F (x) ≥ g : 2 A natural estimator of Med(F ) is the sample analog, Med(F^n). Under what conditions is Med(F^n) a reasonable estimate of Med(F )? Let m = Med(F ) and suppose that F is well behaved at m in the sense 1 that F (t) > 2 whenever t > m. Under this condition, we can show using the Glivenko-Cantelli Theorem that Med(F^n) ! Med(F ) a.s. We will now prove this result. Suppose Fn is a (nonrandom) sequence of distribution functions such that sup jFn(x) − F (x)j ! 0 : x2R Let > 0 be given. We wish to show that there exists N = N() such that for all n > N jMed(Fn) − Med(F )j < : Choose δ > 0 so that 1 δ < − F (m − ) 2 1 δ < F (m + ) − ; 2 3 which in turn implies that 1 F (m − ) < − δ 2 1 F (m + ) > + δ : 2 (It might help to draw a picture to see why we should pick δ in this way.) Next choose N so that for all n > N, sup jFn(x) − F (x)j < δ : x2R Let mn = Med(Fn). For such n, mn > m − , for if mn ≤ m − , then 1 F (m − ) > F (m − ) − δ ≥ − δ ; n 2 which contradicts the choice of δ. We also have that mn < m + , for if mn ≥ m + , then 1 F (m + ) < F (m + ) + δ ≤ + δ ; n 2 which again contradicts the choice of δ. Thus, for n > N, jmn − mj < , as desired. By the Glivenko-Cantelli Theorem, it follows immediately that Med(F^n) ! Med(F ) a.s. 3 A Generalized Glivenko-Cantelli Theorem Let Xi; i = 1; : : : ; n be an i.i.d. sequence of random variables with distri- bution P . We no longer require that the random variables are real-valued. The empirical measure is the measure defined by 1 X P^ = δ ; n n Xi 1≤i≤n where δx is the measure that puts mass one at x. In this language, the empirical distribution function is simply P^n(−∞; x] and the uniform con- vergence over x 2 R asserted in (1) can instead be understood as uniform 4 convergence of the empirical measure to the true measure over sets of the form (−∞; x] for x 2 R. Can this result be extended to other classes of sets? It turns out that the convergence of the empirical measure to the true measure is uniform for large classes of sets provided that the sets do not \pick out" too many subsets of any set of n points in the space. Definition 3.1 We say that a class V of subsets of a space S has polynomial discrimination (of degree v) if there exists a polynomial ρ(·) (of degree v) so that from every set of n points in S the class picks out at most ρ(n) distinct subsets. Formally, if S0 ⊆ S consists of n points, then there are at most ρ(n) distinct sets of the form V \ S0 with V 2 V. It is easy to see that half-intervals of the form (−∞; x] with x 2 R have polynomial discrimination of degree 1. Unfortunately, it is difficult to come up with more classes of sets have polynomial discrimination. For that purpose, the following observation is useful. A class of sets V is said to \shatter" a set of points S0 if it can \pick out" every possible subset of S0, i.e., if each subset of S0 can be written as V \ S0 for some V 2 V. A lemma due to Sauer asserts that if a class of sets shatters no set of v points, then it has polynomial discrimination of degree (no greater than) v − 1. For example, on the real line, the half-intervals shatter no set of two points, which is consistent with our earlier observation. More interestingly, the class of all closed discs in R2 shatters no set of four points. This follows from the following result, which allows us to generate many classes of sets that have polynomial discrimination. Lemma 3.1 Let G be a vector space of real-valued functions on S with dimension v − 1. The class of sets of the form fg ≥ 0g as g varies over G shatters no set of v points in S. Proof: Choose s1; : : : ; sv distinct points from S. We must show that there is some subset of these points that is not \picked out" by the sets of the 5 form fg ≥ 0g as g varies over G. Define the map L : G ! Rv by the rule L(g) = (g(s1); : : : ; g(sv) : L is a linear map. Hence, L(G) is a linear subspace of Rv of dimension no greater than v − 1. As a result, there exists a nonzero γ 2 Rv that is orthogonal to L(G), i.e., X γig(si) = 0 for all g 2 G : 1≤i≤v Equivalently, X X γig(si) = −γig(si) : (2) i:γi≥0 i:γi<0 Assume without loss of generality that fi : γi < 0g 6= 0 (otherwise replace γ by −γ). Consider the set fsi : γi ≥ 0g. Suppose by way of contradiction that there exists a g 2 G such that fg ≥ 0g \ fs1; : : : ; svg = fsi : γi ≥ 0g. For such a g,(??) cannot hold. The following theorem generalizes the classical Glivenko-Cantelli The- orem to all classes of sets with polynomial discrimination, including those that can be generated using the previous lemma.
Load more

Recommended publications
  • On the Mean Speed of Convergence of Empirical and Occupation Measures in Wasserstein Distance Emmanuel Boissard, Thibaut Le Gouic
    On the mean speed of convergence of empirical and occupation measures in Wasserstein distance Emmanuel Boissard, Thibaut Le Gouic To cite this version: Emmanuel Boissard, Thibaut Le Gouic. On the mean speed of convergence of empirical and occupation measures in Wasserstein distance. Annales de l’Institut Henri Poincaré (B) Probabilités et Statistiques, Institut Henri Poincaré (IHP), 2014, 10.1214/12-AIHP517. hal-01291298 HAL Id: hal-01291298 https://hal.archives-ouvertes.fr/hal-01291298 Submitted on 8 Mar 2017 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. ON THE MEAN SPEED OF CONVERGENCE OF EMPIRICAL AND OCCUPATION MEASURES IN WASSERSTEIN DISTANCE EMMANUEL BOISSARD AND THIBAUT LE GOUIC Abstract. In this work, we provide non-asymptotic bounds for the average speed of convergence of the empirical measure in the law of large numbers, in Wasserstein distance. We also consider occupation measures of ergodic Markov chains. One motivation is the approximation of a probability measure by finitely supported measures (the quantization problem). It is found that rates for empirical or occupation measures match or are close to previously known optimal quantization rates in several cases. This is notably highlighted in the example of infinite-dimensional Gaussian measures.
    [Show full text]
  • Introduction to Empirical Processes and Semiparametric Inference1
    This is page i Printer: Opaque this Introduction to Empirical Processes and Semiparametric Inference1 Michael R. Kosorok August 2006 1c 2006 SPRINGER SCIENCE+BUSINESS MEDIA, INC. All rights re- served. Permission is granted to print a copy of this preliminary version for non- commercial purposes but not to distribute it in printed or electronic form. The author would appreciate notification of typos and other suggestions for improve- ment. ii This is page iii Printer: Opaque this Preface The goal of this book is to introduce statisticians, and other researchers with a background in mathematical statistics, to empirical processes and semiparametric inference. These powerful research techniques are surpris- ingly useful for studying large sample properties of statistical estimates from realistically complex models as well as for developing new and im- proved approaches to statistical inference. This book is more a textbook than a research monograph, although some new results are presented in later chapters. The level of the book is more introductory than the seminal work of van der Vaart and Wellner (1996). In fact, another purpose of this work is to help readers prepare for the mathematically advanced van der Vaart and Wellner text, as well as for the semiparametric inference work of Bickel, Klaassen, Ritov and Wellner (1997). These two books, along with Pollard (1990) and chapters 19 and 25 of van der Vaart (1998), formulate a very complete and successful elucida- tion of modern empirical process methods. The present book owes much by the way of inspiration, concept, and notation to these previous works. What is perhaps new is the introductory, gradual and unified way this book introduces the reader to the field.
    [Show full text]
  • Applications of Empirical Process Theory Contents
    Applications of Empirical Process Theory Contents 1 Introduction 3 1.1 Historical Motivation . 3 1.2 Basic Definitions . 4 1.3 Organisation of Chapters . 5 1.4 Notations . 5 2 Tools for Studying Empirical Processes 6 2.1 Entropy . 6 2.2 Symmetrisation . 7 2.3 Maximal Inequalities . 9 3 Empirical Process Theory 13 3.1 Uniform Law of Large Numbers . 13 3.2 Uniform Central Limit Theorem . 15 3.3 Vapnik{Cervonenkisˇ Class . 17 4 Statistical Applications 21 4.1 Direct Applications . 21 4.2 Functional Delta Method . 24 4.3 Nonparametric Maximum Likelihood Estimators . 27 Bibliography 37 2 Chapter 1 Introduction 1.1 Historical Motivation Historically, empirical process theory has one of its roots in the study of goodness of fit statistics. The first goodness-of-fit statistic was Pearson's chi-square statistic. Recall that for Pearson's goodness-of-fit test, to test whether independent and identically distributed (i.i.d.) real random variables X1;:::;Xn come from the distribution F , we partition the real line into intervals (bins), indexed 1; : : : ; m, and compare Ei, the expected number of data points in the i-th interval under the null distribution F , with Oi, the observed number. The null hypothesis Pm 2 is rejected when the Pearson chi-square statistic i=1(Oi − Ei) =Ei is large compared with 2 a χm−1 distribution. Pearson's idea of binning discretises a continuous distribution into a more tractable multinomial distribution, making the chi-square statistics easy to understand and simple to implement. However, the downside of using bins is its arbitrariness and loss of information during discretisation, leading to a loss in statistical power.
    [Show full text]
  • Mean Field Simulation for Monte Carlo Integration MONOGRAPHS on STATISTICS and APPLIED PROBABILITY
    Mean Field Simulation for Monte Carlo Integration MONOGRAPHS ON STATISTICS AND APPLIED PROBABILITY General Editors F. Bunea, V. Isham, N. Keiding, T. Louis, R. L. Smith, and H. Tong 1. Stochastic Population Models in Ecology and Epidemiology M.S. Barlett (1960) 2. Queues D.R. Cox and W.L. Smith (1961) 3. Monte Carlo Methods J.M. Hammersley and D.C. Handscomb (1964) 4. The Statistical Analysis of Series of Events D.R. Cox and P.A.W. Lewis (1966) 5. Population Genetics W.J. Ewens (1969) 6. Probability, Statistics and Time M.S. Barlett (1975) 7. Statistical Inference S.D. Silvey (1975) 8. The Analysis of Contingency Tables B.S. Everitt (1977) 9. Multivariate Analysis in Behavioural Research A.E. Maxwell (1977) 10. Stochastic Abundance Models S. Engen (1978) 11. Some Basic Theory for Statistical Inference E.J.G. Pitman (1979) 12. Point Processes D.R. Cox and V. Isham (1980) 13. Identification of OutliersD.M. Hawkins (1980) 14. Optimal Design S.D. Silvey (1980) 15. Finite Mixture Distributions B.S. Everitt and D.J. Hand (1981) 16. ClassificationA.D. Gordon (1981) 17. Distribution-Free Statistical Methods, 2nd edition J.S. Maritz (1995) 18. Residuals and Influence in RegressionR.D. Cook and S. Weisberg (1982) 19. Applications of Queueing Theory, 2nd edition G.F. Newell (1982) 20. Risk Theory, 3rd edition R.E. Beard, T. Pentikäinen and E. Pesonen (1984) 21. Analysis of Survival Data D.R. Cox and D. Oakes (1984) 22. An Introduction to Latent Variable Models B.S. Everitt (1984) 23. Bandit Problems D.A. Berry and B.
    [Show full text]
  • The Convergence of Monte Carlo Estimates of Distributions
    Noname manuscript No. (will be inserted by the editor) The convergence of Monte Carlo estimates of distributions Nicholas A. Heard and Melissa J. M. Turcotte Received: date / Accepted: date Abstract It is often necessary to make sampling-based sta- where δXi is a Dirac measure at Xi and X is the support tistical inference about many probability distributions in par- of π. The random measure (1) is a maximum likelihood es- allel. Given a finite computational resource, this article ad- timator of π and is consistent: for all π-measurable sets B, dresses how to optimally divide sampling effort between the limn→∞ Πˆn(B)= π(B). samplers of the different distributions. Formally approach- Sometimes estimating the entire distribution π is of in- ing this decision problem requires both the specification of trinsic inferential interest. In other cases, this may be de- an error criterion to assess how well each group of samples sirable if there are no limits on the functionals of π which represent their underlying distribution, and a loss function might be of future interest. Alternatively, the random sam- to combine the errors into an overall performance score. For pling might be an intermediary update of a sequential Monte the first part, a new Monte Carlo divergence error criterion Carlo sampler (Del Moral et al., 2006) for which it is desir- based on Jensen-Shannon divergence is proposed. Using re- able that the samples represent the current target distribution sults from information theory, approximations are derived well at each step. for estimating this criterion for each target based on a sin- Pointwise Monte Carlo errors are inadequate for captur- gle run, enabling adaptive sample size choices to be made ing the overall rate of convergence of the realised empirical during sampling.
    [Show full text]
  • Arxiv:1606.07664V1 [Math.PR]
    A GLIVENKO–CANTELLI THEOREM FOR ALMOST ADDITIVE FUNCTIONS ON LATTICES CHRISTOPH SCHUMACHER, FABIAN SCHWARZENBERGER, IVAN VESELIĆ Abstract. We develop a Glivenko–Cantelli theory for monotone, almost additive functions of i. i. d. sequences of random variables indexed by Zd. Under certain condi- tions on the random sequence, short range correlations are allowed as well. We have an explicit error estimate, consisting of a probabilistic and a geometric part. We ap- ply the results to yield uniform convergence for several quantities arising naturally in statistical physics. 1. Introduction The classical Glivenko–Cantelli theorem states that the empirical cumulative distribution functions of an increasing set of independent and identically distributed random variables converge uniformly to the cumulative population distribution function almost surely. Due to its importance to applications, e. g. statistical learning theory, the Glivenko– Cantelli theorem is also called the “fundamental theorem of statistics”. The theorem has initiated the study of so-called Glivenko–Cantelli classes as they feature, for instance, in the Vapnik–Chervonenkis theory [VC71]. Generalizations of the fundamental theorem rewrite the uniform convergence with respect to the real variable as convergence of a supremum over a family (of sets or functions) and widen the family over which the supremum is taken, making the statement “more uniform”. However, there are limits to this uniformization: For instance, if the original distribution is continuous, there is no convergence if the supremum is taken w. r. t. the family of finite subsets of the reals. Thus, a balance has to be found between the class over which the supremum is taken and the distribution of the random variables, the details of which are often dictated by the application in mind.
    [Show full text]
  • Monte Carlo Methods
    Adam M. Johansen and Ludger Evers Monte Carlo Methods Lecture Notes November 15, 2007 Department of Mathematics 2 Table of Contents Table of Contents ................................................... ................... 3 1. Introduction ................................................... .................... 5 1.1 What are Monte Carlo Methods?........................... ....................... 5 1.2 Introductory examples . ......................... 5 1.3 A Brief History of Monte Carlo Methods .................... ....................... 9 1.4 Pseudo-random numbers . ..................... 10 2. Fundamental Concepts: Transformation, Rejection, and Reweighting .............. 15 2.1 Transformation Methods ............................... .......................... 15 2.2 Rejection Sampling . ......................... 16 2.3 Importance Sampling . ......................... 19 3. Markov Chains ................................................... ................. 25 3.1 Stochastic Processes . ........................... 25 3.2 Discrete State Space Markov Chains . ..................... 26 3.3 General State Space Markov Chains . ................... 33 3.4 Selected Theoretical Results . ..................... 37 3.5 Further Reading . ......................... 38 4. The Gibbs Sampler ................................................... ............. 39 4.1 Introduction ....................................... ............................. 39 4.2 Algorithm ........................................ .............................. 40 4.3 The Hammersley-Clifford
    [Show full text]
  • ONE-DIMENSIONAL EMPIRICAL MEASURES, ORDER STATISTICS, and KANTOROVICH TRANSPORT DISTANCES Sergey Bobkov and Michel Ledoux Univer
    ONE-DIMENSIONAL EMPIRICAL MEASURES, ORDER STATISTICS, AND KANTOROVICH TRANSPORT DISTANCES Sergey Bobkov and Michel Ledoux University of Minnesota∗ and University of Toulousey December 19, 2016 Abstract. This work is devoted to the study of rates of convergence of the empiri- 1 Pn cal measures µn = n k=1 δXk , n ≥ 1, over a sample (Xk)k≥1 of independent identically distributed real-valued random variables towards the common distribution µ in Kan- torovich transport distances Wp. The focus is on finite range bounds on the expected p 1=p Kantorovich distances E(Wp(µn; µ)) or E(Wp (µn; µ)) in terms of moments and an- alytic conditions on the measure µ and its distribution function. The study describes a p1 variety of rates, from the standard one n to slower rates, and both lower and upper- bounds on E(Wp(µn; µ)) for fixed n in various instances. Order statistics, reduction to uniform samples and analysis of beta distributions, inverse distribution functions, log- concavity are main tools in the investigation. Two detailed appendices collect classical and some new facts on inverse distribution functions and beta distributions and their densities necessary to the investigation. Keywords. Empirical measure, Kantorovich distance, rate of convergence, finite rate bound, order statistic, inverse distribution function, beta distribution, log-concave measure. Mathematics Subject Classification (2010). Primary 60B10, 60F99, 60G57, 62G30, 60B12; Secondary 62G20. ∗School of Mathematics, University of Minnesota, Minneapolis, MN 55455 USA, [email protected] yInstitut de Math´ematiquesde Toulouse, Universit´ede Toulouse, F-31062 Toulouse, France, and Institut Universitaire de France, [email protected] 1 2 Contents 1 Introduction 4 2 Generalities on Kantorovich transport distances 10 2.1 Kantorovich transport distance Wp ....................
    [Show full text]
  • Donsker and Glivenko-Cantelli Theorems for a Class of Processes Generalizing the Empirical Process Davit Varron
    Donsker and Glivenko-Cantelli theorems for a class of processes generalizing the empirical process Davit Varron To cite this version: Davit Varron. Donsker and Glivenko-Cantelli theorems for a class of processes generalizing the empiri- cal process. Electronic Journal of Statistics , Shaker Heights, OH : Institute of Mathematical Statistics, 2014, pp.2301-2325. hal-01158050 HAL Id: hal-01158050 https://hal.archives-ouvertes.fr/hal-01158050 Submitted on 31 Aug 2016 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. Electronic Journal of Statistics ISSN: 1935-7524 arXiv: math.PR/0000000 Donsker and Glivenko-Cantelli theorems for a class of processes generalizing the empirical process Davit Varron Laboratoire de mathématiques de Besançon, UMR CNRS 6623, Université de Franche-Comté e-mail: [email protected] Abstract: We establish a Glivenko-Cantelli and a Donsker theorem for a class of random discrete measures which generalize the empirical measure, under conditions on uniform entropy numbers that are common in empirical pro- cesses theory. Some illustrative applications in nonparametric Bayesian theory and randomly sized sampling are provided. Primary 60F17, 60G57, 62F15. Keywords and phrases: Empirical processes, Random measures, Bayesian non- parametrics.
    [Show full text]
  • Mathematical Statistics
    Mathematical Statistics Sara van de Geer September 2010 2 Contents 1 Introduction 7 1.1 Some notation and model assumptions . 7 1.2 Estimation . 10 1.3 Comparison of estimators: risk functions . 12 1.4 Comparison of estimators: sensitivity . 12 1.5 Confidence intervals . 13 1.5.1 Equivalence confidence sets and tests . 13 1.6 Intermezzo: quantile functions . 14 1.7 How to construct tests and confidence sets . 14 1.8 An illustration: the two-sample problem . 16 1.8.1 Assuming normality . 17 1.8.2 A nonparametric test . 18 1.8.3 Comparison of Student’s test and Wilcoxon’s test . 20 1.9 How to construct estimators . 21 1.9.1 Plug-in estimators . 21 1.9.2 The method of moments . 22 1.9.3 Likelihood methods . 23 2 Decision theory 29 2.1 Decisions and their risk . 29 2.2 Admissibility . 31 2.3 Minimaxity . 33 2.4 Bayes decisions . 34 2.5 Intermezzo: conditional distributions . 35 2.6 Bayes methods . 36 2.7 Discussion of Bayesian approach (to be written) . 39 2.8 Integrating parameters out (to be written) . 39 2.9 Intermezzo: some distribution theory . 39 2.9.1 The multinomial distribution . 39 2.9.2 The Poisson distribution . 41 2.9.3 The distribution of the maximum of two random variables 42 2.10 Sufficiency . 42 2.10.1 Rao-Blackwell . 44 2.10.2 Factorization Theorem of Neyman . 45 2.10.3 Exponential families . 47 2.10.4 Canonical form of an exponential family . 48 3 4 CONTENTS 2.10.5 Minimal sufficiency .
    [Show full text]
  • Mean Field Limits for Nonlinear Spatially Extended Hawkes Processes with Exponential Memory Kernels
    MEAN FIELD LIMITS FOR NONLINEAR SPATIALLY EXTENDED HAWKES PROCESSES WITH EXPONENTIAL MEMORY KERNELS By J. Chevallier†, A. Duarte‡, E. Locherbach¨ † and G. Ost‡ Universit´ede Cergy-Pontoise† and Universidade de S˜ao Paulo‡ We consider spatially extended systems of interacting nonlinear Hawkes processes modeling large systems of neurons placed in Rd and study the associated mean field limits. As the total number of neurons tends to infinity, we prove that the evolution of a typical neuron, attached to a given spatial position, can be described by a nonlinear limit differential equation driven by a Poisson random measure. The limit process is described by a neural field equation. As a consequence, we provide a rigorous derivation of the neural field equation based on a thorough mean field analysis. 1. Introduction. The aim of this paper is to present a microscopic model describing a large network of spatially structured interacting neurons, and to study its large population limits. Each neuron is placed in Rd. Its activity is represented by a point process accounting for the successive times at which the neuron emits an action potential, commonly referred to as a spike. The firing intensity of a neuron depends on the past history of the neuron. Moreover, this intensity is affected by the activity of other neurons in the network. Neurons interact mostly through chemical synapses. A spike of a pre-synaptic neuron leads to a change in the membrane potential of the post-synaptic neuron (namely an increase if the synapse is excitatory or a decrease if the synapse is inhibitory), possibly after some delay.
    [Show full text]
  • On the Fluctuations About the Vlasov Limit for N-Particle Systems With
    On the fluctuations about the Vlasov limit for N-particle systems with mean-field interactions Carlo Lancellotti ∗ Department of Mathematics, CUNY–College of Staten Island Staten Island NY 10314, USA Abstract Whereas the Vlasov (a.k.a. “mean-field”) limit for N-particle systems with sufficiently smooth potentials has been the subject of many studies, the literature on the dynamics of the fluctuations around the limit is sparse and somewhat in- complete. The present work fulfills two goals: 1) to provide a complete, simple proof of a general theorem describing the evolution of a given initial fluctuation field for the particle density in phase space, and 2) to characterize the most general class of initial symmetric probability measures that lead (in the infinite-particle limit) to the same Gaussian random field that arises when the initial phase space coordinates of the particles are assumed to be i.i.d. random variables (so that the standard central limit theorem applies). The strategy of the proof of the fluctuation evolution result is to show first that the deviations from mean-field converge for each individual system, in a purely deterministic context. Then, one obtains the corresponding probabilistic result by a modification of the continuous mapping theorem. The characterization of the initial probability measures is in terms of a higher-order chaoticity condition (a.k.a. “Boltzmann property”). 1 Introduction Among the various models of classical kinetic theory, one of the earliest to be justified in terms of a rigorous derivation from microscopic N-body dynamics was the Vlasov equation for a classical plasma with sufficiently regular1 interparticle potential, see [17, 18, 14, 2, 3].
    [Show full text]