DOCSLIB.ORG

Algorithmically Random Closed Sets and Probability

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Algorithmically Random Closed Sets and Probability ALGORITHMICALLY RANDOM CLOSED SETS AND PROBABILITY A Dissertation Submitted to the Graduate School of the University of Notre Dame in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Logan M. Axon Peter Cholak, Director Graduate Program in Mathematics Notre Dame, Indiana April 2010 ALGORITHMICALLY RANDOM CLOSED SETS AND PROBABILITY Abstract by Logan M. Axon Algorithmic randomness in the Cantor space, 2!, has recently become the subject of intense study. Originally defined in terms of the fair coin measure, algorithmic randomness has since been extended, for example in Reimann and Slaman [22, 23], to more general measures. Others have meanwhile developed definitions of algorithmic randomness for different spaces, for example the space of continuous functions on the unit interval (Fouch´e[8, 9]), more general topological spaces (Hertling and Weihrauch [12]), and the closed subsets of 2! (Barmpalias et al. [1], Kjos-Hanssen and Diamondstone [14]). Our work has also been to develop a definition of algorithmically random closed subsets. We take a very different approach, however, from that taken by Barmpalias et al. [1] and Kjos- Hanssen and Diamondstone [14]. One of the central definitions of algorithmic randomness in Cantor space is Martin-L¨ofrandomness. We use the probability theory of random closed sets (RACS) to prove that Martin-L¨ofrandomness can be defined in the space of closed subsets of any locally compact, Hausdorff, second countable space. We then explore the Martin-L¨ofrandom closed subsets of the spaces N, 2!, and R under different measures. In the case of 2! we prove that the definitions of Barm- palias et al. [1] and Kjos-Hanssen and Diamondstone [14] are compatible with Logan M. Axon our approach. In the case of N we prove that the Martin-L¨ofrandom subsets are exactly those with Martin-L¨ofrandom characteristic functions. In the case of R we investigate the Martin-L¨ofrandom closed sets under generalized Poisson processes. This leads to a characterization of the Martin-L¨ofrandom elements of R as exactly the reals contained in some Martin-L¨ofrandom closed subset of R. CONTENTS ACKNOWLEDGMENTS . iv CHAPTER 1: INTRODUCTION . .1 CHAPTER 2: BACKGROUND MATERIAL . .6 2.1 Notational conventions . .6 2.2 A (very) quick review of probability . .7 2.3 Algorithmic randomness . .9 2.4 Random closed sets . 14 2.4.1 Robbins' theorem . 20 2.4.2 The Choquet capacity theorem . 24 2.4.3 Examples of Choquet capacities . 31 2.5 Fractal geometry . 37 CHAPTER 3: MARTIN-LOF¨ RANDOM CLOSED SETS . 41 3.1 Random subsets of the natural numbers . 54 CHAPTER 4: MARTIN-LOF¨ RANDOM CLOSED SUBSETS OF CAN- TOR SPACE . 57 4.1 BBCDW-random closed sets . 57 4.1.1 Fractal properties . 66 4.2 Galton-Watson random closed sets . 70 4.3 Generalized random fractal constructions . 83 4.4 Random intervals . 90 4.5 Maxitive capacities . 94 4.6 Random singletons . 96 CHAPTER 5: MARTIN-LOF¨ RANDOM CLOSED SUBSETS OF THE REAL NUMBERS UNDER GENERALIZED POISSON PROCESSES 98 5.1 A generalized Poisson process . 98 5.2 More on generalized Poisson processes . 115 ii REFERENCES . 127 iii ACKNOWLEDGMENTS This dissertation would not have existed without the help and support of many people. My adviser, Peter Cholak, got me going first place and then kept me going with advice, encouragement, and when necessary, deadlines. Bjørn Kjos-Hanssen also played a big role by asking the right questions and pointing me in the right direction on many occasions. Julia Knight, Dan Mauldin, Andrew Sommese, and Sergei Starchenko also helped by listening and reading with critical ears and eyes. My office-mates, Chris, Sean, Josh, and Steve, saw everything in its earliest form and had many helpful ideas and suggestions. Thanks to all of you. And thanks to Bonnie. iv CHAPTER 1 INTRODUCTION It is easy to generate a random binary sequence: simply flip a fair coin and record the outcome of each flip as 0 for heads and 1 for tails. The laws of prob- ability tell us that in the long run we should expect to get the same number of 0s and 1s, that we can expect to see any finite sequence of 0s and 1s, et cetera. What we certainly do not expect to get is a sequence like 10110111011110 ::: , or any other sequence with a pattern. However, this sequence is as likely to be the outcome of our coin flips as any other sequence (each infinite sequence occurs with probability zero). Of course most sequences look more random than the sequence 10110111011110 ::: , even if each one is just as likely to occur. Algorith- mic randomness (also called effective randomness) formalizes the idea that some sequences are more random than others by combining computability theory with probability. One of the most important definitions in algorithmic randomness is Martin-L¨of randomness which we introduce in section 2.3. Algorithmically random sequences have received a lot of attention recently. Many of the results in the area of algorith- mically random sequences have been collected in Downey et al. [5] and Nies [20]. The explosion of interest in algorithmically random sequences has led researchers to ask whether similarly interesting behavior is possible in other settings. One alternative setting is C[0; 1], the set of continuous functions from the unit interval 1 to R. This was first studied by Fouch´e,[9] and [8], and later by Kjos-Hanssen and Nerode [15] who showed that results about algorithmically random functions could be obtained by producing a measure algebra homomorphism between 2! and C[0; 1]. As we will see this basic idea can be used in other settings, in particular in the space of closed subsets of certain topological spaces. Algorithmically random closed sets were first studied by Barmpalias et al. [1] who defined a notion of randomness for closed subsets of Cantor space by coding each infinite binary tree without dead ends as a ternary real. Every closed subset of Cantor space can be uniquely represented as the set of paths through such a tree. Barmpalias et al. [1] defined a closed set to be random if the code for the corresponding tree was Martin-L¨ofrandom. This definition is explored here in section 4.1. Probability theorists and statisticians, on the other hand, have defined a ran- dom closed set to be something quite different. A random closed set as defined in the literature (in particular the books of Matheron [16], Molchanov [18], and Nguyen [19]) is simply a closed set-valued random variable. That is, a random closed set is a measurable map from a probability space to F(E), the space of closed sets the topological space E. This is formalized using the hit-or-miss topol- ogy (also known as the Fell topology) on the space F(E). We introduce this probabilistic theory of random closed sets in section 2.4. This is obviously a very different idea than that developed by Barmpalias et al. [1] but there are connec- tions. We prove that the coding of closed sets of Cantor space used by Barmpalias et al. [1] is actually an example of a particularly nice random closed set (in the probability theory sense). This is lemma 4.1.4 in section 4.1. As in the case of real-valued random variables, random closed sets (in the 2 probability sense) induce an probability measure on the target space. The connec- tion with algorithmic randomness comes when we use such a measure to produce Martin-L¨oftests in the space of closed sets. This allows for the study Martin-L¨of random closed sets purely from the perspective of the space of closed sets and the hit-or-miss topology. In section 3 we develop a general theory of Martin-L¨of random closed sets. One key result here is proposition 3.0.9, which establishes that Martin-L¨ofrandomness can be defined in the space of closed subsets of a lo- cally compact, Hausdorff, second countable space using the hit-or-miss topology. This allows us to talk about Martin-L¨ofrandom closed subsets of such spaces. We note that different random closed sets give rise to different measures and hence different classes of Martin-L¨ofrandom closed sets. Other important results in this section are the technical lemmas 3.0.12 and 3.0.13, which are used extensively in later examples. The bulk of this paper is an exploration of examples of specific random closed sets (in the probability sense) and the Martin-L¨ofrandom closed sets they give rise to. We begin by looking at the example of Martin-L¨ofrandom closed subsets of N. In section 3.1 we prove that the Martin-L¨ofrandom closed subsets of N are exactly those subsets with a Martin-L¨ofrandom characteristic function (in 2!). Our first major example of a random closed set is the coding defined by Barm- palias et al. [1]. Having established in lemma 4.1.4 that this coding is a measurable map from 3! !F(2!) we are then able to prove that a closed set is Martin-L¨of random in F(2!) if and only if it is the image of a Martin-L¨ofrandom element of 3! (corollary 4.1.5). This means that our definition of Martin-L¨ofrandom closed sets agrees exactly with the definition of algorithmically random closed sets given by Barmpalias et al. [1]. Our approach, however, allows for the use of theorems from 3 probability theory of random closed sets. In proposition 4.1.9, for instance, we use one of these tools (Robbins' theorem) to prove that for this example Martin-L¨of random closed sets have measure 0.
Load more

Recommended publications
  • Randomized Algorithms
    Chapter 9 Randomized Algorithms randomized The theme of this chapter is madendrizo algorithms. These are algorithms that make use of randomness in their computation. You might know of quicksort, which is efficient on average when it uses a random pivot, but can be bad for any pivot that is selected without randomness. Analyzing randomized algorithms can be difficult, so you might wonder why randomiza- tion in algorithms is so important and worth the extra effort. Well it turns out that for certain problems randomized algorithms are simpler or faster than algorithms that do not use random- ness. The problem of primality testing (PT), which is to determine if an integer is prime, is a good example. In the late 70s Miller and Rabin developed a famous and simple random- ized algorithm for the problem that only requires polynomial work. For over 20 years it was not known whether the problem could be solved in polynomial work without randomization. Eventually a polynomial time algorithm was developed, but it is much more complicated and computationally more costly than the randomized version. Hence in practice everyone still uses the randomized version. There are many other problems in which a randomized solution is simpler or cheaper than the best non-randomized solution. In this chapter, after covering the prerequisite background, we will consider some such problems. The first we will consider is the following simple prob- lem: Question: How many comparisons do we need to find the top two largest numbers in a sequence of n distinct numbers? Without the help of randomization, there is a trivial algorithm for finding the top two largest numbers in a sequence that requires about 2n − 3 comparisons.
    [Show full text]
  • MA3K0 - High-Dimensional Probability
    MA3K0 - High-Dimensional Probability Lecture Notes Stefan Adams i 2020, update 06.05.2020 Notes are in final version - proofreading not completed yet! Typos and errors will be updated on a regular basis Contents 1 Prelimaries on Probability Theory 1 1.1 Random variables . .1 1.2 Classical Inequalities . .4 1.3 Limit Theorems . .6 2 Concentration inequalities for independent random variables 8 2.1 Why concentration inequalities . .8 2.2 Hoeffding’s Inequality . 10 2.3 Chernoff’s Inequality . 13 2.4 Sub-Gaussian random variables . 15 2.5 Sub-Exponential random variables . 22 3 Random vectors in High Dimensions 27 3.1 Concentration of the Euclidean norm . 27 3.2 Covariance matrices and Principal Component Analysis (PCA) . 30 3.3 Examples of High-Dimensional distributions . 32 3.4 Sub-Gaussian random variables in higher dimensions . 34 3.5 Application: Grothendieck’s inequality . 36 4 Random Matrices 36 4.1 Geometrics concepts . 36 4.2 Concentration of the operator norm of random matrices . 38 4.3 Application: Community Detection in Networks . 41 4.4 Application: Covariance Estimation and Clustering . 41 5 Concentration of measure - general case 43 5.1 Concentration by entropic techniques . 43 5.2 Concentration via Isoperimetric Inequalities . 50 5.3 Some matrix calculus and covariance estimation . 54 6 Basic tools in high-dimensional probability 57 6.1 Decoupling . 57 6.2 Concentration for Anisotropic random vectors . 62 6.3 Symmetrisation . 63 7 Random Processes 64 ii Preface Introduction We discuss an elegant argument that showcases the
    [Show full text]
  • HIGHER MOMENTS of BANACH SPACE VALUED RANDOM VARIABLES 1. Introduction Let X Be a Random Variable with Values in a Banach Space
    HIGHER MOMENTS OF BANACH SPACE VALUED RANDOM VARIABLES SVANTE JANSON AND STEN KAIJSER Abstract. We define the k:th moment of a Banach space valued ran- dom variable as the expectation of its k:th tensor power; thus the mo- ment (if it exists) is an element of a tensor power of the original Banach space. We study both the projective and injective tensor products, and their relation. Moreover, in order to be general and flexible, we study three different types of expectations: Bochner integrals, Pettis integrals and Dunford integrals. One of the problems studied is whether two random variables with the same injective moments (of a given order) necessarily have the same projective moments; this is of interest in applications. We show that this holds if the Banach space has the approximation property, but not in general. Several sections are devoted to results in special Banach spaces, in- cluding Hilbert spaces, CpKq and Dr0; 1s. The latter space is non- separable, which complicates the arguments, and we prove various pre- liminary results on e.g. measurability in Dr0; 1s that we need. One of the main motivations of this paper is the application to Zolotarev metrics and their use in the contraction method. This is sketched in an appendix. 1. Introduction Let X be a random variable with values in a Banach space B. To avoid measurability problems, we assume for most of this section for simplicity that B is separable and X Borel measurable; see Section 3 for measurability in the general case. Moreover, for definiteness, we consider real Banach spaces only; the complex case is similar.
    [Show full text]
  • A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
    Special Publication 800-22 Revision 1a A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications AndrewRukhin,JuanSoto,JamesNechvatal,Miles Smid,ElaineBarker,Stefan Leigh,MarkLevenson,Mark Vangel,DavidBanks,AlanHeckert,JamesDray,SanVo Revised:April2010 LawrenceE BasshamIII A Statistical Test Suite for Random and Pseudorandom Number Generators for NIST Special Publication 800-22 Revision 1a Cryptographic Applications 1 2 Andrew Rukhin , Juan Soto , James 2 2 Nechvatal , Miles Smid , Elaine 2 1 Barker , Stefan Leigh , Mark 1 1 Levenson , Mark Vangel , David 1 1 2 Banks , Alan Heckert , James Dray , 2 San Vo Revised: April 2010 2 Lawrence E Bassham III C O M P U T E R S E C U R I T Y 1 Statistical Engineering Division 2 Computer Security Division Information Technology Laboratory National Institute of Standards and Technology Gaithersburg, MD 20899-8930 Revised: April 2010 U.S. Department of Commerce Gary Locke, Secretary National Institute of Standards and Technology Patrick Gallagher, Director A STATISTICAL TEST SUITE FOR RANDOM AND PSEUDORANDOM NUMBER GENERATORS FOR CRYPTOGRAPHIC APPLICATIONS Reports on Computer Systems Technology The Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the nation’s measurement and standards infrastructure. ITL develops tests, test methods, reference data, proof of concept implementations, and technical analysis to advance the development and productive use of information technology. ITL’s responsibilities include the development of technical, physical, administrative, and management standards and guidelines for the cost-effective security and privacy of sensitive unclassified information in Federal computer systems.
    [Show full text]
  • Control Policy with Autocorrelated Noise in Reinforcement Learning for Robotics
    International Journal of Machine Learning and Computing, Vol. 5, No. 2, April 2015 Control Policy with Autocorrelated Noise in Reinforcement Learning for Robotics Paweł Wawrzyński primitives by means of RL algorithms based on MDP Abstract—Direct application of reinforcement learning in framework, but it does not alleviate the problem of robot robotics rises the issue of discontinuity of control signal. jerking. The current paper is intended to fill this gap. Consecutive actions are selected independently on random, In this paper, control policy is introduced that may undergo which often makes them excessively far from one another. Such reinforcement learning and have the following properties: control is hardly ever appropriate in robots, it may even lead to their destruction. This paper considers a control policy in which It is applicable to robot control optimization. consecutive actions are modified by autocorrelated noise. That It does not lead to robot jerking. policy generally solves the aforementioned problems and it is readily applicable in robots. In the experimental study it is It can be optimized by any RL algorithm that is designed applied to three robotic learning control tasks: Cart-Pole to optimize a classical stochastic control policy. SwingUp, Half-Cheetah, and a walking humanoid. The policy introduced here is based on a deterministic transformation of state combined with a random element in Index Terms—Machine learning, reinforcement learning, actorcritics, robotics. the form of a specific stochastic process, namely the moving average. The paper is organized as follows. In Section II the I. INTRODUCTION problem of our interest is defined. Section III presents the main contribution of this paper i.e., a stochastic control policy Reinforcement learning (RL) addresses the problem of an that prevents robot jerking while learning.
    [Show full text]
  • Finite Automata and Random Sequence
    Finite Automata and Random Sequence C. P. Schnorr and H. Stimm Institut für Angewandte mathematick der Johann Wolfgang Goethe-Universiät D-6000 Frankfurt 1, Robert-Mayer-Str. 10 Bundesrepublik Deutschland Abstract. We consider the behaviour of finite automata on infinite bi- nary sequence and study the class of random tests which can be carried out by finite automata. We give several equivalent characterizations of those infinite binary sequences which are random relative to finite au- tomata. These characterizations are based on the concepts of selection rules, martingales and invariance properties defined by finite automata. 1 Introduction Stimulated by Kolmogorov and and Chaitin, several attempts have been made recently, by Martin-Löf, Loveland, and Schnorr, to conceive the notion of infinite binary random sequences on the basis of the theory of algorithms. In Schnorr [13] an intuitive concept of the effective random test is proposed. The hitherto investigated, different approaches to this one has proven to be equivalent. It thus provides an robust definition of the notion of randomness. We say a sequence is random if it can pass any effective random test. Random sequences can not necessarily be calculated effectively, i. e., they are not recursive. The problem, which is important for the application, to calculate the possible “random” sequences can therefore only be investigated in the sense that random sequences can be approximated by recursive sequences. Recursive sequences that behave “random” are called pseudo-random sequences. From a pseudo-random sequence one would expect that it at least fulfills the“most im- portant” probability laws. The assumption is that the algorithmically simple random tests correspond to particularly important probability laws.
    [Show full text]
  • CONVERGENCE RATES of MARKOV CHAINS 1. Orientation 1
    CONVERGENCE RATES OF MARKOV CHAINS STEVEN P. LALLEY CONTENTS 1. Orientation 1 1.1. Example 1: Random-to-Top Card Shuffling 1 1.2. Example 2: The Ehrenfest Urn Model of Diffusion 2 1.3. Example 3: Metropolis-Hastings Algorithm 4 1.4. Reversible Markov Chains 5 1.5. Exercises: Reversiblity, Symmetries and Stationary Distributions 8 2. Coupling 9 2.1. Coupling and Total Variation Distance 9 2.2. Coupling Constructions and Convergence of Markov Chains 10 2.3. Couplings for the Ehrenfest Urn and Random-to-Top Shuffling 12 2.4. The Coupon Collector’s Problem 13 2.5. Exercises 15 2.6. Convergence Rates for the Ehrenfest Urn and Random-to-Top 16 2.7. Exercises 17 3. Spectral Analysis 18 3.1. Transition Kernel of a Reversible Markov Chain 18 3.2. Spectrum of the Ehrenfest random walk 21 3.3. Rate of convergence of the Ehrenfest random walk 23 1. ORIENTATION Finite-state Markov chains have stationary distributions, and irreducible, aperiodic, finite- state Markov chains have unique stationary distributions. Furthermore, for any such chain the n−step transition probabilities converge to the stationary distribution. In various ap- plications – especially in Markov chain Monte Carlo, where one runs a Markov chain on a computer to simulate a random draw from the stationary distribution – it is desirable to know how many steps it takes for the n−step transition probabilities to become close to the stationary probabilities. These notes will introduce several of the most basic and important techniques for studying this problem, coupling and spectral analysis. We will focus on two Markov chains for which the convergence rate is of particular interest: (1) the random-to-top shuffling model and (2) the Ehrenfest urn model.
    [Show full text]
  • Multivariate Scale-Mixed Stable Distributions and Related Limit
    Multivariate scale-mixed stable distributions and related limit theorems∗ Victor Korolev,† Alexander Zeifman‡ Abstract In the paper, multivariate probability distributions are considered that are representable as scale mixtures of multivariate elliptically contoured stable distributions. It is demonstrated that these distributions form a special subclass of scale mixtures of multivariate elliptically contoured normal distributions. Some properties of these distributions are discussed. Main attention is paid to the representations of the corresponding random vectors as products of independent random variables. In these products, relations are traced of the distributions of the involved terms with popular probability distributions. As examples of distributions of the class of scale mixtures of multivariate elliptically contoured stable distributions, multivariate generalized Linnik distributions are considered in detail. Their relations with multivariate ‘ordinary’ Linnik distributions, multivariate normal, stable and Laplace laws as well as with univariate Mittag-Leffler and generalized Mittag-Leffler distributions are discussed. Limit theorems are proved presenting necessary and sufficient conditions for the convergence of the distributions of random sequences with independent random indices (including sums of a random number of random vectors and multivariate statistics constructed from samples with random sizes) to scale mixtures of multivariate elliptically contoured stable distributions. The property of scale- mixed multivariate stable
    [Show full text]
  • Random Fields, Fall 2014 1
    Random fields, Fall 2014 1 fMRI brain scan Ocean waves Nobel prize 2996 to The oceans cover 72% of John C. Mather the earth’s surface. George F. Smoot Essential for life on earth, “for discovery of the and huge economic blackbody form and importance through anisotropy of the cosmic fishing, transportation, microwave background oil and gas extraction radiation" PET brain scan TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A The course • Kolmogorov existence theorem, separable processes, measurable processes • Stationarity and isotropy • Orthogonal and spectral representations • Geometry • Exceedance sets • Rice formula • Slepian models Literature An unfinished manuscript “Applications of RANDOM FIELDS AND GEOMETRY: Foundations and Case Studies” by Robert Adler, Jonathan Taylor, and Keith Worsley. Complementary literature: “Level sets and extrema of random processes and fields” by Jean- Marc Azais and Mario Wschebor, Wiley, 2009 “Asymptotic Methods in the Theory of Gaussian Processes” by Vladimir Piterbarg, American Mathematical Society, ser. Translations of Mathematical Monographs, Vol. 148, 1995 “Random fields and Geometry” by Robert Adler and Jonathan Taylor, Springer 2007 Slides for ATW ch 2, p 24-39 Exercises: 2.8.1, 2.8.2, 2.8.3, 2.8.4, 2.8.5, 2.8.6 + excercises in slides Stochastic convergence (assumed known) 푎.푠. Almost sure convergence: 푋푛 X 퐿2 Mean square convergence: 푋푛 X 푃 Convergence in probability: 푋푛 X 푑 푑 푑 Convergence in distribution: 푋푛 X, 퐹푛 F, 푃푛 P, … 푎.푠. 푃 • 푋푛 X ⇒ 푋푛 푋 퐿2 푃 • 푋푛 X ⇒ 푋푛 푋 푃 퐿2 • 푋푛 푋 plus uniform integrability ⇒ 푋푛 X 푃 푎.푠.
    [Show full text]
  • Random Polynomials Over Finite Fields
    RANDOM POLYNOMIALS OVER FINITE FIELDS by Andrew Sharkey A thesis submitted to the Faculty of Science at the University of Glasgow for the degree of . Doctor of Philosophy June 22, 1999 ©Andrew Sharkey 1999 ProQuest Number: 13834241 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. uest ProQuest 13834241 Published by ProQuest LLC(2019). Copyright of the Dissertation is held by the Author. All rights reserved. This work is protected against unauthorized copying under Title 17, United States Code Microform Edition © ProQuest LLC. ProQuest LLC. 789 East Eisenhower Parkway P.O. Box 1346 Ann Arbor, Ml 4 8 1 0 6 - 1346 m Questa tesi e dedicata ad Alessandro Paluello (1975-1997). Preface This thesis is submitted in accordance with the regulations for the degree of Doctor of Philoso­ phy in the University of Glasgow. It is the record of research carried out at Glasgow University between October 1995 and September 1998. No part of it has previously been submitted by me for a degree at any university. I should like to express my gratitude to my supervisor, Prof. R.W.K.Odoni, for his ad­ vice and encouragement throughout the period of research. I would also like to thank Dr. S.D.Gohen for helping out with my supervision, and the E.P.S.R.G.
    [Show full text]
  • University of Groningen Panel Data Models Extended to Spatial Error
    University of Groningen Panel data models extended to spatial error autocorrelation or a spatially lagged dependent variable Elhorst, J. Paul IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document version below. Document Version Publisher's PDF, also known as Version of record Publication date: 2001 Link to publication in University of Groningen/UMCG research database Citation for published version (APA): Elhorst, J. P. (2001). Panel data models extended to spatial error autocorrelation or a spatially lagged dependent variable. s.n. Copyright Other than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons). The publication may also be distributed here under the terms of Article 25fa of the Dutch Copyright Act, indicated by the “Taverne” license. More information can be found on the University of Groningen website: https://www.rug.nl/library/open-access/self-archiving-pure/taverne- amendment. Take-down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons the number of authors shown on this cover page is limited to 10 maximum. Download date: 01-10-2021 3$1(/'$7$02'(/6(;7(1'('7263$7,$/ (5525$872&255(/$7,2125$63$7,$//< /$**(''(3(1'(179$5,$%/( J.
    [Show full text]
  • Kolmogorov Complexity and Its Applications
    CHAPTER 4 Kolmogorov Complexity and its Applications Ming LI Aiken Computation Laboratory, Han•ard University, Cambridge, MA 02138, USA Paul M.B. VIT ANYI Centrum voor Wiskunde en biformatica, Kruislaan 413, 1098 SJ Amsterdam, Netherlands, and Facu/teit Wiskunde en Jnjormatica, Universiteic van Amsterdam, Amsterdam, Netherlands Contents L Introduction 189 2. Mathematical theory 196 3. Applications of compressibility 214 4. Example of an application in mathematics: weak prime number theorems. 221 5. Applications of incompressibility: proving lower bounds 222 6. Resource-bounded Kolmogorov complexity and its applications 236 7. Conclusion 247 Acknowledgment 247 References :48 HANDBOOK OF THEORETICAL COMPUTER SCIENCE Edited by J. van Leeuwen ((' Elsevier Science Publishers B.V., 1990 KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS 189 t. Introduction In everyday language we identify the information in an individual object with the essentials of a description for it. We can formalize this by defining the amount of information in a finite object (like a string) as the size (i.e., number of bits) of the smallest program that, starting with a blank memory, outputs the string and then terminates. A similar definition can be given for infinite strings, but in this case the program produces element after element forever. Thus, 1n (a string of nones) contains little information because a program of size about log n outputs it (like "print n ls"). Likewise, the transcendental number rr = 3.1415 ... , an infinite sequence of seemingly "random" decimal digits, contains O(l) information. (There is a short program that produces the consecutive digits of rr forever.) Such a definition would appear to make the amount of information in a string depend on the particular programming language used.
    [Show full text]