Markov Chains, Conductance and Mixing Time
|
|
- Amice Fowler
- 5 years ago
- Views:
Transcription
1 Markov Chains, Conductance and Mixing Time Lecturer: Santosh Vempala Scribe: Kevin Zatloukal Markov Chains A random walk is a Markov chain. As before, we have a state space Ω. We also have a set of subsets A of Ω that form a σ-algebra, i.e., A is closed under complements and countable unions. It is an immediate consequence that A is closed under countable intersections and that, Ω A. For any u Ω and A A, we have the one-step probability, P u (A), which tells us the probability of being in A after taking one step from u. Lastly, we have a starting distribution Q 0 on Ω, which gives us a probability Q 0 (A) of starting in the set A A. With this setup, a Markov chain is a sequence of points w 0, w, w,... such that P(w 0 A) = Q 0 (A) and P(w i+ A w 0 = u 0,..., w i = u i ) = P(w i+ A w i = u i ) = P ui (A), for any A A. A distribution Q is called stationary if, for all A A, Q(A) = P u (A) dq(u). In other words, Q is stationary if the probability of being in A is the same after one step. We also have a generalized version of the symmetry we saw above in the transition probabilities (p xy = p yx ). The Markov chain is called time-reversible if, for all A, B A, Ball Walk P(w i+ B w i A) = P(w i+ A w i B). The following algorithm, called Ball-Walk, is a continuous random walk. In this case, the set corresponding to the neighborhood of x is B δ (x) = x+δb n. Algorithm Ball-Walk(δ):. Let x be a starting point in K.. Repeat sufficiently many times: Choose a random y B δ (x). If y K, set x = y.
2 Here, the state space is all of the set, so Ω = K. The σ-algebra is the measurable subsets of K, as is usual. We can define a density function for the probability of transitioning from u K to v, provided that u v: p(u, v) = { The probability of staying at u is if v K B δ (u), 0 otherwise. P u (u) = Vol(K B δ(u)). Vol(δB n ) Putting these together, the probability of transitioning from u to any measurable subset A is { Vol(A K Bδ (u)) Vol(δB P u (A) = n) + P u (u) if u A Vol(A K B δ (u)) if u / A. Since the density function is symmetric, it is easy to see that the uniform distribution is stationary. We can also verify this directly. We can compute the probability of being in A after one step by adding up the probability that we transition to u for each u A. Thus, after one step from the uniform distribution dq(u) = Vol(K) du, the probability of being in A is P u(u) dq(u) + v K B δ (u)\{u} dq(v) du = ( Vol(K B δ(u)) = dq(u) + = dq(u) = Q(A) ) dq(u) + v K B δ (u) dq(v) du ( ) v K B δ (u) dv Vol(K B δ(u) dq(u) Another way to look at the one-step probability distributions is in terms of flow. For any subset A A, the ergodic flow Φ(A) is the probability of transitioning from A to Ω \ A, i.e., Φ(A) = P u (Ω \ A) dq. Intuitively, in a stationary distribution, we should have Φ(A) = Φ(Ω \ A). In fact, this is a characterization of the stationary distribution.
3 Theorem. A distribution Q is stationary iff Φ(A) = Φ(Ω \ A) for all A A. Proof. Consider their difference Φ(A) Φ(Ω \ A) = P u(ω \ A) dq(u) u/ A P u(a) dq(u) = ( P u(a)) dq(u) u/ A P u(a) dq(u) = Q(A) P u(a) dq(u). The latter quantity is the probability of staying in A after one step, so Φ(A) Φ(Ω \ A) = 0 iff Q is stationary. Now, let s return to the question of how quickly (and whether) this random walk converges to the stationary distribution. As before, it is convenient to make the walk lazy by giving probability of staying in place instead of taking a step. This means that P u ({u}) and, more generally, for any A A, P u (A) if u A and P u(a) < if u / A. Also as before, the notion of conductance will be useful. In this general context, we define conductance as Φ(A) φ = Q(A), min A A, Q(A) where Q is the stationary distribution. This is the probability of transitioning to Ω \ A given that we are starting in A. We must also generalize the notion of the distance of a distribution from stationary. The straightforward generalization of our previous definition is Q t Q = dq t (u) dq(u) = dq t (u) dq(u) + dq(u) dq t (u), where Q + t = {u Ω dq t (u) dq(u)}, and Q t = {u Ω dq t (u) < dq(u)}. Since we know that = dq t (u) + dq t (u) = dq(u) + dq(u), 3
4 we can rearrange to get dq t (u) dq(u) = dq(u) dq t (u), which shows that the two terms from above are equal. Therefore, we can just as well define Q t Q = dq t (u) dq(u) = sup Q t (A) Q(A). A A We will take this as our definition of the distance d(q t, Q) between distributions Q t and Q. We would like to know how large t must be before d(q t, Q) d(q 0, Q). This is one definition of the mixing time. It would be nice to get a bound by showing that Q t (A) Q(A) drops quickly for every A. This is not the case. Instead, we can look at sup Q(A)=x Q t (A) Q(A) for each fixed x [0, ]. A bound for every x would imply the bound we need. To prove a bound on this by induction, we will define it in a formally weaker way. Our upper bound is h t (x) = sup g F x g(u) (dq t (u) dq(u)) = sup g(u) dq t (u) x, g F x where F x is the set of functions { F x = g : Ω [0, ] : } g(u) dq(u) = x. It is clear that h t (x) is an upper bound on sup Q(A)=x Q t (A) Q(A) since g could be the characteristic of A. The following lemma shows that these two quantities are in fact equal as long as Q is atom-free, i.e., there is no x Ω such that Q({x}) > 0. Lemma. If Q is atom-free, then h t (x) = sup Q(A)=x Q t (A) Q(A). Proof (Sketch). Consider the set of points X that maximize dq t /dq, their value density. (This part would not be possible of Q had an atom.) Put g(x) = for all x X. These points give the maximum payoff per unit of weight from g, so it is optimal to put as much weight on them as possible. Now, find the set of maximizing points in Ω \ X. Set g(x) = at these points. Continue until the set of points with g(x) = has measure x. 4
5 In fact, this argument shows that when Q is atom-free, we can find a set A that achieves the supremum. When Q has atoms, we can include the high value atoms and use this procedure on the non-atom subset of Ω; however, we made to include a fraction of one atom to achieve the supremum. This shows that h t (x) can be achieved by a function g that is 0 valued everywhere except for at most one point. Another important fact about h t is the following. Lemma 3. The function h t is concave. Proof. Let g F x and g F y. Then, we can see that αg + ( α)g F αx+( α)y, which implies that h t (αx + ( α)y) αg (u) + ( α)g (u) dq t (u) (αx + ( α)y) = α( g (u) dq t (u) x) + ( α)( g (u) dq t (u) y). Since this holds for any such g and g, it must hold if we take the sup, which gives us h t (αx + ( α)y) αh t (x) + ( α)h t (y). Thus, h t is concave. Now, we come to the main lemma relating h t to h t. This will allow us to put a bound on d(q t, Q). Lemma 4. Let Q be atom-free, and y = min{x, x}. Then h t (x) h t (x φy) + h t (x + φy). Proof. Assume that y = x, i.e., x. The other part is similar. We will construct two functions, g and g, and use these to bound h t (x). Let A A be a subset to be chosen later with Q(A) = x. Let g (u) = { P u (A) if u A, 0 if u / A, and g (u) = { if u A, P u (A) if u / A. First, note that ( g + g )(u) = P u (A) for all u Ω, which means that g (u) dq t (u) + g (u) dq t (u) = ( g (u) + g (u)) dq t (u) = P u (A) dq t (u) = Q t (A) 5
6 On the other hand, g (u) dq(u) + g (u) dq(u) = P u (A) dq(u) = Q(A) since Q is stationary. Hence ( g + g ) F x.putting these together, we have g (u) (dq t (u) dq(u)) + g (u) (dq t (u) dq(u)) = Q t (A) Q(A). Since Q is atom-free, there is a subset A Ω such that h t (x) = Q t (A) Q(A) = g (u) (dq t (u) dq(u)) + g (u) (dq t (u) dq(u)) h t (x ) + h t (x ), where x = g (u) dq(u) and x = g (u) dq(u). Now, we know that x + x = x. Specifically, we can see that x = g (u) dq(u) = P u (A) dq(u) dq(u) = ( P u (Ω \ A)) dq(u) x = x P u (Ω \ A) dq(u) = x Φ(A) x φx = x( φ). This implies that x x( + φ). Since h t is concave, the chord from x to x on h t lies below the chord from x( φ) to x( + φ). (See Figure.) Therefore, h t (x) h t (x( φ)) + h t (x( + φ)). 6
7 h t- h t 0 x x(- ) x x(+ ) x Figure : The value of ht(x) lies below the line between ht (x) and ht (x). Since x x( φ) x x( + φ) x and ht is concave, this implies that ht(x) lies below the line between ht (x( φ)) and ht (x( + φ)). Given some information about Q0, this lemma allows us to put bounds on the rate of convergence to the stationary distribution. Theorem 5. Let 0 s and C0 and C be such that h0(x) C0 + C min{ x s, x s}. Then ht(x) C0 + C min{ x s, )t x s} ( φ. Proof. We argue by induction on t for s = 0. The inequality is true for t = 0 by our hypothesis. Now, suppose that x and the inequality holds for all values less than t. From the lemma, we know that ht(x) h t (x( φ)) + h t (x( + φ)) C0 + C ( x( φ) + x( + φ))( φ ) t = C0 + C x( φ + + φ)( φ ) t C0 + C x( φ ) t, provided that φ + + φ ( φ ). The latter inequality can be verified by squaring both sides, rearranging, and squaring again. 7
8 Corollary 6. If M = sup A A Q 0 (A)/Q(A), then we have d(q t, Q) M( φ ) t. Proof. By the definition of M, we know that h 0 (x) min{mx, } x min{mx, }. Next, we will show that min{mx, } Mx. If Mx = min{mx, }, then Mx, which implies that Mx Mx. If = min{mx, }, then Mx, which implies that Mx Mx. So we have shown that h 0 (x) min{mx, } Mx. Thus, by the last theorem, we know that d(q t, Q) max h t (x) M( x φ ) t. 8
Geometric Random Walks: A Survey
Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 Geometric Random Walks: A Survey SANTOSH VEMPALA Abstract. The developing theory of geometric random walks is outlined here. Three
More informationGeometric Random Walks: A Survey
Geometric Random Walks: A Survey Santosh Vempala Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139. Abstract The developing theory of geometric random walks is outlined
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
More informationMAT 257, Handout 13: December 5-7, 2011.
MAT 257, Handout 13: December 5-7, 2011. The Change of Variables Theorem. In these notes, I try to make more explicit some parts of Spivak s proof of the Change of Variable Theorem, and to supply most
More informationInformation Theory and Statistics Lecture 3: Stationary ergodic processes
Information Theory and Statistics Lecture 3: Stationary ergodic processes Łukasz Dębowski ldebowsk@ipipan.waw.pl Ph. D. Programme 2013/2014 Measurable space Definition (measurable space) Measurable space
More informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More informationMid Term-1 : Practice problems
Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More information2 Sequences, Continuity, and Limits
2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs
More informationTools from Lebesgue integration
Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationLöwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)
Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More information106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)
106 CHAPTER 3. TOPOLOGY OF THE REAL LINE 3.3 Limit Points 3.3.1 Main Definitions Intuitively speaking, a limit point of a set S in a space X is a point of X which can be approximated by points of S other
More informationCompleteness of Star-Continuity
Introduction to Kleene Algebra Lecture 5 CS786 Spring 2004 February 9, 2004 Completeness of Star-Continuity We argued in the previous lecture that the equational theory of each of the following classes
More informationConvergence of Random Walks and Conductance - Draft
Graphs and Networks Lecture 0 Convergence of Random Walks and Conductance - Draft Daniel A. Spielman October, 03 0. Overview I present a bound on the rate of convergence of random walks in graphs that
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationLECTURE 3 RANDOM VARIABLES, CUMULATIVE DISTRIBUTION FUNCTIONS (CDFs)
OCTOBER 6, 2014 LECTURE 3 RANDOM VARIABLES, CUMULATIVE DISTRIBUTION FUNCTIONS (CDFs) 1 Random Variables Random experiments typically require verbal descriptions, and arguments involving events are often
More information1 Lesson 1: Brunn Minkowski Inequality
1 Lesson 1: Brunn Minkowski Inequality A set A R n is called convex if (1 λ)x + λy A for any x, y A and any λ [0, 1]. The Minkowski sum of two sets A, B R n is defined by A + B := {a + b : a A, b B}. One
More information25.1 Markov Chain Monte Carlo (MCMC)
CS880: Approximations Algorithms Scribe: Dave Andrzejewski Lecturer: Shuchi Chawla Topic: Approx counting/sampling, MCMC methods Date: 4/4/07 The previous lecture showed that, for self-reducible problems,
More information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
More informationLecture 2: September 8
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 2: September 8 Lecturer: Prof. Alistair Sinclair Scribes: Anand Bhaskar and Anindya De Disclaimer: These notes have not been
More informationLecture 6. s S} is a ring.
Lecture 6 1 Localization Definition 1.1. Let A be a ring. A set S A is called multiplicative if x, y S implies xy S. We will assume that 1 S and 0 / S. (If 1 / S, then one can use Ŝ = {1} S instead of
More information1 Stat 605. Homework I. Due Feb. 1, 2011
The first part is homework which you need to turn in. The second part is exercises that will not be graded, but you need to turn it in together with the take-home final exam. 1 Stat 605. Homework I. Due
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationStochastic processes and algorithms
Stochastic processes and algorithms Ton Dieker H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332 ton.dieker@isye.gatech.edu partially based
More informationMetric spaces and metrizability
1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
More informationOnline Convex Optimization
Advanced Course in Machine Learning Spring 2010 Online Convex Optimization Handouts are jointly prepared by Shie Mannor and Shai Shalev-Shwartz A convex repeated game is a two players game that is performed
More informationLecture 4 Lebesgue spaces and inequalities
Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how
More informationMath212a1413 The Lebesgue integral.
Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the
More informationThe Caratheodory Construction of Measures
Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,
More informationMath 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More information7 Convergence in R d and in Metric Spaces
STA 711: Probability & Measure Theory Robert L. Wolpert 7 Convergence in R d and in Metric Spaces A sequence of elements a n of R d converges to a limit a if and only if, for each ǫ > 0, the sequence a
More informationEntropy and Ergodic Theory Lecture 4: Conditional entropy and mutual information
Entropy and Ergodic Theory Lecture 4: Conditional entropy and mutual information 1 Conditional entropy Let (Ω, F, P) be a probability space, let X be a RV taking values in some finite set A. In this lecture
More information1 Strict local optimality in unconstrained optimization
ORF 53 Lecture 14 Spring 016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, April 14, 016 When in doubt on the accuracy of these notes, please cross check with the instructor s
More informationAN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES
AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov
More informationNotes on Measure, Probability and Stochastic Processes. João Lopes Dias
Notes on Measure, Probability and Stochastic Processes João Lopes Dias Departamento de Matemática, ISEG, Universidade de Lisboa, Rua do Quelhas 6, 1200-781 Lisboa, Portugal E-mail address: jldias@iseg.ulisboa.pt
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationLebesgue Measurable Sets
s Dr. Aditya Kaushik Directorate of Distance Education Kurukshetra University, Kurukshetra Haryana 136119 India s Definition A set E R is said to be Lebesgue measurable if for any A R we have m A) = m
More information(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);
STABILITY OF EQUILIBRIA AND LIAPUNOV FUNCTIONS. By topological properties in general we mean qualitative geometric properties (of subsets of R n or of functions in R n ), that is, those that don t depend
More informationECE 4400:693 - Information Theory
ECE 4400:693 - Information Theory Dr. Nghi Tran Lecture 8: Differential Entropy Dr. Nghi Tran (ECE-University of Akron) ECE 4400:693 Lecture 1 / 43 Outline 1 Review: Entropy of discrete RVs 2 Differential
More informationFunctional Analysis HW #3
Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform
More informationReview of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE)
Review of Multi-Calculus (Study Guide for Spivak s CHPTER ONE TO THREE) This material is for June 9 to 16 (Monday to Monday) Chapter I: Functions on R n Dot product and norm for vectors in R n : Let X
More informationTopological vectorspaces
(July 25, 2011) Topological vectorspaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Natural non-fréchet spaces Topological vector spaces Quotients and linear maps More topological
More informationBasic Definitions: Indexed Collections and Random Functions
Chapter 1 Basic Definitions: Indexed Collections and Random Functions Section 1.1 introduces stochastic processes as indexed collections of random variables. Section 1.2 builds the necessary machinery
More informationhttp://www.math.uah.edu/stat/markov/.xhtml 1 of 9 7/16/2009 7:20 AM Virtual Laboratories > 16. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 1. A Markov process is a random process in which the future is
More informationMATH 217A HOMEWORK. P (A i A j ). First, the basis case. We make a union disjoint as follows: P (A B) = P (A) + P (A c B)
MATH 217A HOMEWOK EIN PEASE 1. (Chap. 1, Problem 2. (a Let (, Σ, P be a probability space and {A i, 1 i n} Σ, n 2. Prove that P A i n P (A i P (A i A j + P (A i A j A k... + ( 1 n 1 P A i n P (A i P (A
More informationIntegration on Measure Spaces
Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationFilters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
More information6.842 Randomness and Computation March 3, Lecture 8
6.84 Randomness and Computation March 3, 04 Lecture 8 Lecturer: Ronitt Rubinfeld Scribe: Daniel Grier Useful Linear Algebra Let v = (v, v,..., v n ) be a non-zero n-dimensional row vector and P an n n
More informationEcon Slides from Lecture 1
Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.
Formal Methods Name: Key Midterm 2, Spring, 2007 Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.. Determine whether each of
More informationAppendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More informationLecture Introduction. 2 Brief Recap of Lecture 10. CS-621 Theory Gems October 24, 2012
CS-62 Theory Gems October 24, 202 Lecture Lecturer: Aleksander Mądry Scribes: Carsten Moldenhauer and Robin Scheibler Introduction In Lecture 0, we introduced a fundamental object of spectral graph theory:
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationAppendix A. Definitions for Ordered Sets. The appendices contain all the formal definitions, propositions and proofs for
161 Appendix A Definitions for Ordered Sets The appendices contain all the formal definitions, propositions and proofs for developing a model of the display process based on lattices. Here we list some
More informationLecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differenti. equations.
Lecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differential equations. 1 Metric spaces 2 Completeness and completion. 3 The contraction
More informationSpectral Theory, with an Introduction to Operator Means. William L. Green
Spectral Theory, with an Introduction to Operator Means William L. Green January 30, 2008 Contents Introduction............................... 1 Hilbert Space.............................. 4 Linear Maps
More informationABSTRACT INTEGRATION CHAPTER ONE
CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed
More informationALGEBRAIC STRUCTURE AND DEGREE REDUCTION
ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S F n. We define deg(s) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(s) n S 1/n. In fact,
More informationGeometric intuition: from Hölder spaces to the Calderón-Zygmund estimate
Geometric intuition: from Hölder spaces to the Calderón-Zygmund estimate A survey of Lihe Wang s paper Michael Snarski December 5, 22 Contents Hölder spaces. Control on functions......................................2
More informationLecture 2: A crash course in Real Analysis
EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 2: A crash course in Real Analysis Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan Parthasarathy This lecture is
More informationi c Robert C. Gunning
c Robert C. Gunning i ii MATHEMATICS 218: NOTES Robert C. Gunning January 27, 2010 ii Introduction These are notes of honors courses on calculus of several variables given at Princeton University during
More informationReal Analysis on Metric Spaces
Real Analysis on Metric Spaces Mark Dean Lecture Notes for Fall 014 PhD Class - Brown University 1 Lecture 1 The first topic that we are going to cover in detail is what we ll call real analysis. The foundation
More informationLecture 21 Representations of Martingales
Lecture 21: Representations of Martingales 1 of 11 Course: Theory of Probability II Term: Spring 215 Instructor: Gordan Zitkovic Lecture 21 Representations of Martingales Right-continuous inverses Let
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationLECTURE 6. CONTINUOUS FUNCTIONS AND BASIC TOPOLOGICAL NOTIONS
ANALYSIS FOR HIGH SCHOOL TEACHERS LECTURE 6. CONTINUOUS FUNCTIONS AND BASIC TOPOLOGICAL NOTIONS ROTHSCHILD CAESARIA COURSE, 2011/2 1. The idea of approximation revisited When discussing the notion of the
More informationDepartment of Mathematics, University of Wisconsin-Madison Math 114 Worksheet Sections 3.1, 3.3, and 3.5
Department of Mathematics, University of Wisconsin-Madison Math 11 Worksheet Sections 3.1, 3.3, and 3.5 1. For f(x) = 5x + (a) Determine the slope and the y-intercept. f(x) = 5x + is of the form y = mx
More informationModel Counting for Logical Theories
Model Counting for Logical Theories Wednesday Dmitry Chistikov Rayna Dimitrova Department of Computer Science University of Oxford, UK Max Planck Institute for Software Systems (MPI-SWS) Kaiserslautern
More informationCONVERGENCE THEOREM FOR FINITE MARKOV CHAINS. Contents
CONVERGENCE THEOREM FOR FINITE MARKOV CHAINS ARI FREEDMAN Abstract. In this expository paper, I will give an overview of the necessary conditions for convergence in Markov chains on finite state spaces.
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationLebesgue Integration: A non-rigorous introduction. What is wrong with Riemann integration?
Lebesgue Integration: A non-rigorous introduction What is wrong with Riemann integration? xample. Let f(x) = { 0 for x Q 1 for x / Q. The upper integral is 1, while the lower integral is 0. Yet, the function
More information1 Functions of Several Variables 2019 v2
1 Functions of Several Variables 2019 v2 11 Notation The subject of this course is the study of functions f : R n R m The elements of R n, for n 2, will be called vectors so, if m > 1, f will be said to
More informationImpagliazzo s Hardcore Lemma
Average Case Complexity February 8, 011 Impagliazzo s Hardcore Lemma ofessor: Valentine Kabanets Scribe: Hoda Akbari 1 Average-Case Hard Boolean Functions w.r.t. Circuits In this lecture, we are going
More informationORIE 6334 Spectral Graph Theory September 22, Lecture 11
ORIE 6334 Spectral Graph Theory September, 06 Lecturer: David P. Williamson Lecture Scribe: Pu Yang In today s lecture we will focus on discrete time random walks on undirected graphs. Specifically, we
More informationHolistic Convergence of Random Walks
Graphs and Networks Lecture 1 Holistic Convergence of Random Walks Daniel A. Spielman October 5, 1 1.1 Overview There are two things that I want to do in this lecture. The first is the holistic proof of
More informationDifferentiation. Chapter 4. Consider the set E = [0, that E [0, b] = b 2
Chapter 4 Differentiation Consider the set E = [0, 8 1 ] [ 1 4, 3 8 ] [ 1 2, 5 8 ] [ 3 4, 8 7 ]. This set E has the property that E [0, b] = b 2 for b = 0, 1 4, 1 2, 3 4, 1. Does there exist a Lebesgue
More informationChapter 1 Preliminaries
Chapter 1 Preliminaries 1.1 Conventions and Notations Throughout the book we use the following notations for standard sets of numbers: N the set {1, 2,...} of natural numbers Z the set of integers Q the
More informationPreliminary draft only: please check for final version
ARE211, Fall2012 ANALYSIS6: TUE, SEP 11, 2012 PRINTED: AUGUST 22, 2012 (LEC# 6) Contents 1. Analysis (cont) 1 1.9. Continuous Functions 1 1.9.1. Weierstrass (extreme value) theorem 3 1.10. An inverse image
More informationMeasure and integration
Chapter 5 Measure and integration In calculus you have learned how to calculate the size of different kinds of sets: the length of a curve, the area of a region or a surface, the volume or mass of a solid.
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More information2019 Spring MATH2060A Mathematical Analysis II 1
2019 Spring MATH2060A Mathematical Analysis II 1 Notes 1. CONVEX FUNCTIONS First we define what a convex function is. Let f be a function on an interval I. For x < y in I, the straight line connecting
More informationSupremum and Infimum
Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R
More informationSPACES: FROM ANALYSIS TO GEOMETRY AND BACK
SPACES: FROM ANALYSIS TO GEOMETRY AND BACK MASS 2011 LECTURE NOTES 1. Lecture 1 (8/22/11): Introduction There are many problems in analysis which involve constructing a function with desirable properties
More informationA CLASSROOM NOTE: ENTROPY, INFORMATION, AND MARKOV PROPERTY. Zoran R. Pop-Stojanović. 1. Introduction
THE TEACHING OF MATHEMATICS 2006, Vol IX,, pp 2 A CLASSROOM NOTE: ENTROPY, INFORMATION, AND MARKOV PROPERTY Zoran R Pop-Stojanović Abstract How to introduce the concept of the Markov Property in an elementary
More informationSpectral Continuity Properties of Graph Laplacians
Spectral Continuity Properties of Graph Laplacians David Jekel May 24, 2017 Overview Spectral invariants of the graph Laplacian depend continuously on the graph. We consider triples (G, x, T ), where G
More informationg(x) = P (y) Proof. This is true for n = 0. Assume by the inductive hypothesis that g (n) (0) = 0 for some n. Compute g (n) (h) g (n) (0)
Mollifiers and Smooth Functions We say a function f from C is C (or simply smooth) if all its derivatives to every order exist at every point of. For f : C, we say f is C if all partial derivatives to
More informationSection 21. The Metric Topology (Continued)
21. The Metric Topology (cont.) 1 Section 21. The Metric Topology (Continued) Note. In this section we give a number of results for metric spaces which are familar from calculus and real analysis. We also
More informationA D VA N C E D P R O B A B I L - I T Y
A N D R E W T U L L O C H A D VA N C E D P R O B A B I L - I T Y T R I N I T Y C O L L E G E T H E U N I V E R S I T Y O F C A M B R I D G E Contents 1 Conditional Expectation 5 1.1 Discrete Case 6 1.2
More information