Point-Map Probabilities of a Point Process

Size: px
Start display at page:

Download "Point-Map Probabilities of a Point Process"

Transcription

1 Point-Map Probabilities of a Point Process F. Baccelli, UT AUSTIN Joint work with M.O. Haji-Mirsadeghi TexAMP, Austin, November 23, 24

2 Structure of the talk Point processes Palm probabilities Mecke s invariant measure equation Point maps Dynamical systems Point map probabilities 1

3 COUNTING MEASURES Let φ be a finite or countably-infinite collection of points of IR d, without accumulation One can think ofφ either as a set of points: φ = {t n } IR d or as a counting measure: φ = n ε t n 2

4 POINT PROCESS N: space of all counting measures φ N : σ-field ofmgenerated byφ φ(b) IN,B Borel sets of IR d (Ω, F, IP): probability space A point process Φ is a(n,n)-valued random variable on (Ω,F,IP) 3

5 STATIONARY POINT PROCESS Let {θ t } t IR d be a measure preserving flow on (Ω,F,IP) A point process Φ is stationary if the translations ofφare a factor of the flowθ t : Φ θ t (B) = Φ(B +t) t, B Implies the existence of an intensity λ assumed finite below 4

6 Palm Probability of a Stationary Point Process ProbabilityIP 0 = IP 0 Φ on (N,N) such that Mecke: f(t,φ(θ t (ω)))φ(ω,dt)ip(dω) = f(t,z)λdtip 0 (dz), f 0 IR d Ω IR d N Matthes: IP 0 (A) = E 1 tn B1 Φ θt n A E, A N, B Borel 1 tn B The support of IP 0 is contained in N 0 : space of counting measures with a point at the origin. 5

7 Palm Probability of a Stationary Point Process (continued) Interpretation Conditional: distribution of the point process given that the origin is included in the point process Ergodic: empirical distribution of the sequence{φ θ tn } for all points t n of Φ in a large ball 6

8 Point-Shift on Point Processes Maps each point ofφto some point of Φ Point-Shifts in the literature: Point-Shift H. Thorisson 00 Allocation rule e.g. by A. Holroyd & Y. Peres 05 Initial motivations: Palm calculus Navigation on the points ofφ Cracks in materials 7

9 Example 1 of Point-Shifts on Point Processes Strip Routing PS P. A. Ferrari, C. Landim, H. Thorisson 05 8

10 Example 2 of Point-Shifts on Point Processes Directional PS F.B. & C. BORDENAVE 07 9

11 Example 3 of Point-Shifts on Point Processes Closest-Closest PS 10

12 Example 4 of Point Shifts on Point Processes Directional PS on the supercritical random geometric graph The PS a.s. leads to a trap even when departing from points in the infinite connected component

13 Factor Point-Shifts Point Shift f : supp(φ) supp(φ) : f(φ,t n ) = t m Factor Point-Shift: there exists a function g called the point map, defined on N 0 which associates to each φ N 0 a point of its support and s.t. f(t n ) = t n +g θ tn, n Notation: f g org f 12

14 Point Stationarity Theorem Mecke (1975) Iff is an a.s. bijective factor point shift, then its associated point map g preserves the Palm probability of all stationary point processes. i.e. (θ g ) IP Φ 0 = IP Φ 0, Φ Palm probabilities are the only probability measures on N 0 preserved by all a.s. bijective factor point shifts. 13

15 Point Stationarity (continued) Example: Closest-closest PS Example of a.s. bijective factor point shifts visiting all points of a Poisson point process in IR 2 in Ferrari, Landim, Thorisson 04 14

16 Mecke s Invariant Measure Equation Question Let f be a factor point shift. Let g denote its point map. What is the set of all probability measures on N 0 satisfying (θ g ) Q = Q? (1) The point stationarity theorem says that if f is bijective, the Palm measure of any stationary point process solves (1). 15

17 Question Iff is not bijective, can we construct a solution to (1) from the Palm probability of a stationary point process? Neither strip PM nor directional PM are bijective. Can we find solutions to (1) for these PMs? Invariant Measure Equation 16

18 Notation for Point Shifts Image of a point x Φ, f Φ (x) := f(φ,x). Image of the point process f Φ (Φ) := {f Φ (x),x Φ}. Notation: M 1 (N): set of probability measures on N M 1 (N 0 ): set of probability measures on N 0 17

19 Four Actions of IN Actions π = {π n } of (N,+) on the topological spacex: 1 X = N, equipped with the vague topology, and for all n N, π n (φ) = f n φφ 1 X = M 1 (N), equipped with the weak convergence of probability measures on N, and for all Q X,n IN, π n (Q) = (f φ φ) n Q M 1 (N) 18

20 Four Actions of IN (continued) 2 X = N 0, equipped with vague topology, and φ N 0 and n N, π n (φ) = θ g n (φ)(φ) N 0 2 X = M 1 (N 0 ), equipped with the same topology as M 1 (N), and for all Q M 1 (N 0 ) andn N, π n (Q) = (θ g n (φ)) Q M 1 (N 0 ) 19

21 Action 1 Possible behaviors: p-periodicity Evaporation: Action 1 converges a.s. to the null measure onφ Let I := {φ N 0 ; n IN, y φ s.t. fφ(y) n = 0} Lemma 1 For all factor point shifts f and all stationary point processes Φ, there is evaporation of Φ underf if and only if IP Φ 0 [I] = 0 20

22 Action 1 (continued) Example of p-periodicity Directional PS on the super-critical RGG: p = 1 Closest-Closest PS: p = 2 Examples of Evaporation Ferrari, Landim, Thorisson 04: If Φ is a stationary Poisson point process in IR 2, then the strip PS evaporates Φ The same holds true for the directional PS on a stationary Poisson point process in IR 2 21

23 Actions 1 and 2 Actions 1 is only of interest in the non evaporation case Action 2 is not a topological dynamical system in dim. > 1: Lemma 2 For d 2, there is no continuous point map on the whole N 0 other than the identity. 22

24 Action 2 First g-palm probability ofφ: IP g,1 0 = (θ g ) IP 0 Interpretation: distribution of Φ given that the origin is inf(φ), considering multiplicities of the points of the image process 23

25 Action 2 (continued) n-th g-palm probability of Φ: distribution of Φ given that 0 is in f n (Φ) taking multiplicities into account. IP g,n 0 = (θ g ) IP g,n 1 0 Interpretation: distribution of Φ seen from a typical point of f n (Φ). 24

26 Definition of Point Map Probabilities Let g be a point map Φ be a stationary point process with Palm distributionp 0 Definition Every element of theω-limit set ofp 0 under the action of{(θ g n) } n N will be called ag probability ofp 0 If the limit of the sequence {(θ g n) P 0 } n=1 = {P g,n 0 } n=1 exists, it is called theg probability of P 0 and denoted byp g 0 25

27 Neither Existence nor Uniqueness are granted Example with no converging subsequence: B r (x): Ball of radius r and center x m(x) := Φ(B 1 (x)) f(x) := argmin y x ;m(y) > 2m(x) IP g,n 0 [Φ(B 1 (0)) > 2n] = 1 Examples with convergent subsequences with different limits 26

28 Periodic Case Theorem 1 If f := f g is 1-periodic on Φ, then the g probability P g 0 of P 0 exists and is given by P g 0 = Φ P f Φ Φ 0 Furthermore P g 0 is absolutely continuous with respect top 0, with ( dp g 0 f φ φ ) ({0}) =. dp 0 φ({0}) In addition,p g 0 = (θ g) P g 0 Similar statements hold in thep-periodic case 27

29 Evaporation Case Theorem 2 Assume Φ evaporates under the action of f g, the g probabilityp g 0 of P 0 exists it satisfiesp g 0 = (θ g) P g 0, then P g 0 is singular with respect to P 0 Relies on Lemma 1: under P g 0, I is of probability 1; under P 0, it is of probability 0. 28

30 Sample of the Point Process under its Palm Probability Grey level proportional to the age of the point w.r.t. the PM 29

31 Sample of the Point Process unde its Point Map Probability A point is black if it has pre-images of all orders and grey otherwise 30

32 Mecke s Invariant Measure Equation Consider the Cesàro sums When the limit of P g,n 0 := 1 n n 1 i=0 P g,i 0, n N. P g,n 0 exists (w.r.t. the topology of M 1 (N 0 )), let P g 0 := lim n 1 n n 1 i=0 P g,i 0. In general, P g 0 is not ag probability. 31

33 Mecke s Invariant Measure Equation (continued) Theorem 3 Assume there exists a subsequence{ P g,n i 0 } i=1 converging to a probability P g 0 (θ g ) is continuous at P g 0 Then P g 0 solves Mecke s Invariant Measure Equation Proposition 1 Ifθ g is P g 0 -almost surely continuous, then (θ g) is continuous at P g 0 Proposition 2 Ifg is P g 0 -almost surely continuous, then (θ g) is P g 0 -continuous 32

34 Construction of Point Map Probabilities Tightness Markov 33

35 Tightness Approach Tightness Lemma Kallenberg 1986: The sequence of point processes with distributions Q n is sequentially compact iff for all bounded Borel B IR d, lim limsup Q n (Φ(B) > r) = 0. r n The tightness lemma gives a necessary and sufficient condition for the existence of converging subsequences ofip f,n 0. Example: Any point-map on the Matérn hard core model 34

36 Markovian Approach Illustrated by the Strip PS Proposition 3 Iff = f g is the strip PS on the stationary Poisson point process onir 2, then the sequence IP g,n 0 is convergent θ g isip g 0 -a.s. continuous 35

37 Sketch of Proof B r + (0): right open half disk of radiusr Br (0): left closed half disk of radiusr It is sufficient to show the convergence inb r + (0) and Br (0) for all r. A + B r + (0) and A Br (0). 36

38 Sketch of Proof + Strong Markov property of the Poisson point process. 37

39 Directional PM The edge process (U n = T n T n+1 ) is not a Markov Chain. U2 U3 U4 U2 There exists a sequence of finite stopping times (τ k ) s.t. U1 U1 D2 T0 Φ k = (U τk,...,u τk+1 1) is aψ-irreducible, aperiodic Markov Chain which admits a small set and is geometrically ergodic. T4 T3 T2 T1 38

40

41 Conclusions Transformations associated with point shifts lead to a variety of topological and metrical dynamical systems on stationary point processes The main new object of this presentation, point map probabilities, generalize strictly Palm probabilities 40

42 Future Research Ergodicity and mixing properties of the measure preserving transformations: partial results available on Poisson point processes. Better understanding of the space of solutions of Mecke s invariant measure equation Random dynamical systems on point processes: partial results on random walks on this type of random medium 41

43 Reference F.B. and M.O. Mirsadeghi Compactification of the Action of a Point-Map on the Palm Probability of a Point Process Arxiv, 24 42

Point-Map-Probabilities of a Point Process and Mecke s Invariant Measure Equation

Point-Map-Probabilities of a Point Process and Mecke s Invariant Measure Equation arxiv:1312.0287v3 [math.pr] 13 Jan 2016 Point-Map-Probabilities of a Point Process and Mecke s Invariant Measure Equation François Baccelli University of Texas at Austin Mir-Omid Haji-Mirsadeghi Sharif

More information

Lecture 10. Theorem 1.1 [Ergodicity and extremality] A probability measure µ on (Ω, F) is ergodic for T if and only if it is an extremal point in M.

Lecture 10. Theorem 1.1 [Ergodicity and extremality] A probability measure µ on (Ω, F) is ergodic for T if and only if it is an extremal point in M. Lecture 10 1 Ergodic decomposition of invariant measures Let T : (Ω, F) (Ω, F) be measurable, and let M denote the space of T -invariant probability measures on (Ω, F). Then M is a convex set, although

More information

Ergodic 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. 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 information

25.1 Ergodicity and Metric Transitivity

25.1 Ergodicity and Metric Transitivity Chapter 25 Ergodicity This lecture explains what it means for a process to be ergodic or metrically transitive, gives a few characterizes of these properties (especially for AMS processes), and deduces

More information

Skorokhod embeddings for two-sided Markov chains

Skorokhod embeddings for two-sided Markov chains Skorokhod embeddings for two-sided Markov chains Peter Mörters and István Redl Department of Mathematical Sciences, University of Bath, Bath BA2 7AY, England E mail: maspm@bath.ac.uk and ir250@bath.ac.uk

More information

Lectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 4. Coupling and Harris Processes

Lectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 4. Coupling and Harris Processes Lectures on Stochastic Stability Sergey FOSS Heriot-Watt University Lecture 4 Coupling and Harris Processes 1 A simple example Consider a Markov chain X n in a countable state space S with transition probabilities

More information

Lecture 12. F o s, (1.1) F t := s>t

Lecture 12. F o s, (1.1) F t := s>t Lecture 12 1 Brownian motion: the Markov property Let C := C(0, ), R) be the space of continuous functions mapping from 0, ) to R, in which a Brownian motion (B t ) t 0 almost surely takes its value. Let

More information

TREE AND GRID FACTORS FOR GENERAL POINT PROCESSES

TREE AND GRID FACTORS FOR GENERAL POINT PROCESSES Elect. Comm. in Probab. 9 (2004) 53 59 ELECTRONIC COMMUNICATIONS in PROBABILITY TREE AND GRID FACTORS FOR GENERAL POINT PROCESSES ÁDÁM TIMÁR1 Department of Mathematics, Indiana University, Bloomington,

More information

Cayley Graphs of Finitely Generated Groups

Cayley Graphs of Finitely Generated Groups Cayley Graphs of Finitely Generated Groups Simon Thomas Rutgers University 13th May 2014 Cayley graphs of finitely generated groups Definition Let G be a f.g. group and let S G { 1 } be a finite generating

More information

Random Times and Their Properties

Random Times and Their Properties Chapter 6 Random Times and Their Properties Section 6.1 recalls the definition of a filtration (a growing collection of σ-fields) and of stopping times (basically, measurable random times). Section 6.2

More information

Point-shifts of Point Processes on Topological Groups

Point-shifts of Point Processes on Topological Groups Point-shifts of Point Processes on Topological Groups James T. Murphy III The University of Texas at Austin April 25, 2017 Abstract This paper focuses on covariant point-shifts of point processes on topological

More information

arxiv:math/ v1 [math.pr] 29 Nov 2002

arxiv:math/ v1 [math.pr] 29 Nov 2002 arxiv:math/0211455v1 [math.pr] 29 Nov 2002 Trees and Matchings from Point Processes Alexander E. Holroyd Yuval Peres February 1, 2008 Abstract A factor graph of a point process is a graph whose vertices

More information

STOCHASTIC PROCESSES Basic notions

STOCHASTIC PROCESSES Basic notions J. Virtamo 38.3143 Queueing Theory / Stochastic processes 1 STOCHASTIC PROCESSES Basic notions Often the systems we consider evolve in time and we are interested in their dynamic behaviour, usually involving

More information

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is MARKOV CHAINS What I will talk about in class is pretty close to Durrett Chapter 5 sections 1-5. We stick to the countable state case, except where otherwise mentioned. Lecture 7. We can regard (p(i, j))

More information

Brownian Motion. 1 Definition Brownian Motion Wiener measure... 3

Brownian Motion. 1 Definition Brownian Motion Wiener measure... 3 Brownian Motion Contents 1 Definition 2 1.1 Brownian Motion................................. 2 1.2 Wiener measure.................................. 3 2 Construction 4 2.1 Gaussian process.................................

More information

Lecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.

Lecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution. Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution

More information

A product of γ-sets which is not Menger.

A product of γ-sets which is not Menger. A product of γ-sets which is not Menger. A. Miller Dec 2009 Theorem. Assume CH. Then there exists γ-sets A 0, A 1 2 ω such that A 0 A 1 is not Menger. We use perfect sets determined by Silver forcing (see

More information

Topics in Stochastic Geometry. Lecture 4 The Boolean model

Topics in Stochastic Geometry. Lecture 4 The Boolean model Institut für Stochastik Karlsruher Institut für Technologie Topics in Stochastic Geometry Lecture 4 The Boolean model Lectures presented at the Department of Mathematical Sciences University of Bath May

More information

Invariance Principle for Variable Speed Random Walks on Trees

Invariance Principle for Variable Speed Random Walks on Trees Invariance Principle for Variable Speed Random Walks on Trees Wolfgang Löhr, University of Duisburg-Essen joint work with Siva Athreya and Anita Winter Stochastic Analysis and Applications Thoku University,

More information

Simulation - Lectures - Part III Markov chain Monte Carlo

Simulation - Lectures - Part III Markov chain Monte Carlo Simulation - Lectures - Part III Markov chain Monte Carlo Julien Berestycki Part A Simulation and Statistical Programming Hilary Term 2018 Part A Simulation. HT 2018. J. Berestycki. 1 / 50 Outline Markov

More information

Mean-field dual of cooperative reproduction

Mean-field dual of cooperative reproduction The mean-field dual of systems with cooperative reproduction joint with Tibor Mach (Prague) A. Sturm (Göttingen) Friday, July 6th, 2018 Poisson construction of Markov processes Let (X t ) t 0 be a continuous-time

More information

Infinitely iterated Brownian motion

Infinitely iterated Brownian motion Mathematics department Uppsala University (Joint work with Nicolas Curien) This talk was given in June 2013, at the Mittag-Leffler Institute in Stockholm, as part of the Symposium in honour of Olav Kallenberg

More information

Practical conditions on Markov chains for weak convergence of tail empirical processes

Practical conditions on Markov chains for weak convergence of tail empirical processes Practical conditions on Markov chains for weak convergence of tail empirical processes Olivier Wintenberger University of Copenhagen and Paris VI Joint work with Rafa l Kulik and Philippe Soulier Toronto,

More information

The range of tree-indexed random walk

The range of tree-indexed random walk The range of tree-indexed random walk Jean-François Le Gall, Shen Lin Institut universitaire de France et Université Paris-Sud Orsay Erdös Centennial Conference July 2013 Jean-François Le Gall (Université

More information

Mathematics for Economists

Mathematics for Economists Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples

More information

Proof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L

Proof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L Lecture 24: Defn: Topological conjugacy: Given Z + d (resp, Zd ), actions T, S a topological conjugacy from T to S is a homeomorphism φ : M N s.t. φ T = S φ i.e., φ T n = S n φ for all n Z + d (resp, Zd

More information

MA651 Topology. Lecture 9. Compactness 2.

MA651 Topology. Lecture 9. Compactness 2. MA651 Topology. Lecture 9. Compactness 2. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology

More information

Lecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321

Lecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321 Lecture 11: Introduction to Markov Chains Copyright G. Caire (Sample Lectures) 321 Discrete-time random processes A sequence of RVs indexed by a variable n 2 {0, 1, 2,...} forms a discretetime random process

More information

Chapter 2. Markov Chains. Introduction

Chapter 2. Markov Chains. Introduction Chapter 2 Markov Chains Introduction A Markov chain is a sequence of random variables {X n ; n = 0, 1, 2,...}, defined on some probability space (Ω, F, IP), taking its values in a set E which could be

More information

P (A G) dp G P (A G)

P (A G) dp G P (A G) First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume

More information

An Introduction to Entropy and Subshifts of. Finite Type

An Introduction to Entropy and Subshifts of. Finite Type An Introduction to Entropy and Subshifts of Finite Type Abby Pekoske Department of Mathematics Oregon State University pekoskea@math.oregonstate.edu August 4, 2015 Abstract This work gives an overview

More information

Homework for MATH 4603 (Advanced Calculus I) Fall Homework 13: Due on Tuesday 15 December. Homework 12: Due on Tuesday 8 December

Homework for MATH 4603 (Advanced Calculus I) Fall Homework 13: Due on Tuesday 15 December. Homework 12: Due on Tuesday 8 December Homework for MATH 4603 (Advanced Calculus I) Fall 2015 Homework 13: Due on Tuesday 15 December 49. Let D R, f : D R and S D. Let a S (acc S). Assume that f is differentiable at a. Let g := f S. Show that

More information

Lecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.

Lecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past. 1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if

More information

Necessary and sufficient conditions for strong R-positivity

Necessary and sufficient conditions for strong R-positivity Necessary and sufficient conditions for strong R-positivity Wednesday, November 29th, 2017 The Perron-Frobenius theorem Let A = (A(x, y)) x,y S be a nonnegative matrix indexed by a countable set S. We

More information

MET Workshop: Exercises

MET Workshop: Exercises MET Workshop: Exercises Alex Blumenthal and Anthony Quas May 7, 206 Notation. R d is endowed with the standard inner product (, ) and Euclidean norm. M d d (R) denotes the space of n n real matrices. When

More information

Stochastic Homogenization for Reaction-Diffusion Equations

Stochastic Homogenization for Reaction-Diffusion Equations Stochastic Homogenization for Reaction-Diffusion Equations Jessica Lin McGill University Joint Work with Andrej Zlatoš June 18, 2018 Motivation: Forest Fires ç ç ç ç ç ç ç ç ç ç Motivation: Forest Fires

More information

SUPPLEMENT TO PAPER CONVERGENCE OF ADAPTIVE AND INTERACTING MARKOV CHAIN MONTE CARLO ALGORITHMS

SUPPLEMENT TO PAPER CONVERGENCE OF ADAPTIVE AND INTERACTING MARKOV CHAIN MONTE CARLO ALGORITHMS Submitted to the Annals of Statistics SUPPLEMENT TO PAPER CONERGENCE OF ADAPTIE AND INTERACTING MARKO CHAIN MONTE CARLO ALGORITHMS By G Fort,, E Moulines and P Priouret LTCI, CNRS - TELECOM ParisTech,

More information

Cones of measures. Tatiana Toro. University of Washington. Quantitative and Computational Aspects of Metric Geometry

Cones of measures. Tatiana Toro. University of Washington. Quantitative and Computational Aspects of Metric Geometry Cones of measures Tatiana Toro University of Washington Quantitative and Computational Aspects of Metric Geometry Based on joint work with C. Kenig and D. Preiss Tatiana Toro (University of Washington)

More information

R N Completeness and Compactness 1

R N Completeness and Compactness 1 John Nachbar Washington University in St. Louis October 3, 2017 R N Completeness and Compactness 1 1 Completeness in R. As a preliminary step, I first record the following compactness-like theorem about

More information

FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS

FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS MIDTERM SOLUTIONS. Let f : R R be the map on the line generated by the function f(x) = x 3. Find all the fixed points of f and determine the type of their

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis 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 information

Ergodic Theory. Constantine Caramanis. May 6, 1999

Ergodic Theory. Constantine Caramanis. May 6, 1999 Ergodic Theory Constantine Caramanis ay 6, 1999 1 Introduction Ergodic theory involves the study of transformations on measure spaces. Interchanging the words measurable function and probability density

More information

General Theory of Large Deviations

General Theory of Large Deviations Chapter 30 General Theory of Large Deviations A family of random variables follows the large deviations principle if the probability of the variables falling into bad sets, representing large deviations

More information

{σ x >t}p x. (σ x >t)=e at.

{σ x >t}p x. (σ x >t)=e at. 3.11. EXERCISES 121 3.11 Exercises Exercise 3.1 Consider the Ornstein Uhlenbeck process in example 3.1.7(B). Show that the defined process is a Markov process which converges in distribution to an N(0,σ

More information

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be

More information

Logical Connectives and Quantifiers

Logical Connectives and Quantifiers Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then

More information

From now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.

From now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1. Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x

More information

PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION)

PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION) PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION) EMMANUEL BREUILLARD 1. Lecture 1, Spectral gaps for infinite groups and non-amenability The final aim of

More information

Course 212: Academic Year Section 1: Metric Spaces

Course 212: Academic Year Section 1: Metric Spaces Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........

More information

Translation Invariant Exclusion Processes (Book in Progress)

Translation Invariant Exclusion Processes (Book in Progress) Translation Invariant Exclusion Processes (Book in Progress) c 2003 Timo Seppäläinen Department of Mathematics University of Wisconsin Madison, WI 53706-1388 December 11, 2008 Contents PART I Preliminaries

More information

LECTURE 3. Last time:

LECTURE 3. Last time: LECTURE 3 Last time: Mutual Information. Convexity and concavity Jensen s inequality Information Inequality Data processing theorem Fano s Inequality Lecture outline Stochastic processes, Entropy rate

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS PROBABILITY: LIMIT THEOREMS II, SPRING 218. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS PROBABILITY: LIMIT THEOREMS II, SPRING 15. HOMEWORK PROBLEMS PROF. YURI BAKHTIN Instructions. You are allowed to work on solutions in groups, but you are required to write up solutions on your own. Please

More information

Stochastic Convergence, Delta Method & Moment Estimators

Stochastic Convergence, Delta Method & Moment Estimators Stochastic Convergence, Delta Method & Moment Estimators Seminar on Asymptotic Statistics Daniel Hoffmann University of Kaiserslautern Department of Mathematics February 13, 2015 Daniel Hoffmann (TU KL)

More information

Markov Chains and Stochastic Sampling

Markov Chains and Stochastic Sampling Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,

More information

9 Radon-Nikodym theorem and conditioning

9 Radon-Nikodym theorem and conditioning Tel Aviv University, 2015 Functions of real variables 93 9 Radon-Nikodym theorem and conditioning 9a Borel-Kolmogorov paradox............. 93 9b Radon-Nikodym theorem.............. 94 9c Conditioning.....................

More information

Rudiments of Ergodic Theory

Rudiments of Ergodic Theory Rudiments of Ergodic Theory Zefeng Chen September 24, 203 Abstract In this note we intend to present basic ergodic theory. We begin with the notion of a measure preserving transformation. We then define

More information

Biased activated random walks

Biased activated random walks Joint work with Leonardo ROLLA LAGA (Université Paris 3) Probability seminar University of Bristol 23 April 206 Plan of the talk Introduction of the model, results 2 Elements of proofs 3 Conclusion Plan

More information

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3 Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,

More information

Theory and Applications of Stochastic Systems Lecture Exponential Martingale for Random Walk

Theory and Applications of Stochastic Systems Lecture Exponential Martingale for Random Walk Instructor: Victor F. Araman December 4, 2003 Theory and Applications of Stochastic Systems Lecture 0 B60.432.0 Exponential Martingale for Random Walk Let (S n : n 0) be a random walk with i.i.d. increments

More information

Discrete time Markov chains. Discrete Time Markov Chains, Definition and classification. Probability axioms and first results

Discrete time Markov chains. Discrete Time Markov Chains, Definition and classification. Probability axioms and first results Discrete time Markov chains Discrete Time Markov Chains, Definition and classification 1 1 Applied Mathematics and Computer Science 02407 Stochastic Processes 1, September 5 2017 Today: Short recap of

More information

2 Probability, random elements, random sets

2 Probability, random elements, random sets Tel Aviv University, 2012 Measurability and continuity 25 2 Probability, random elements, random sets 2a Probability space, measure algebra........ 25 2b Standard models................... 30 2c Random

More information

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains Markov Chains A random process X is a family {X t : t T } of random variables indexed by some set T. When T = {0, 1, 2,... } one speaks about a discrete-time process, for T = R or T = [0, ) one has a continuous-time

More information

Lecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales.

Lecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales. Lecture 2 1 Martingales We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales. 1.1 Doob s inequality We have the following maximal

More information

Preliminary Exam 2018 Solutions to Morning Exam

Preliminary Exam 2018 Solutions to Morning Exam Preliminary Exam 28 Solutions to Morning Exam Part I. Solve four of the following five problems. Problem. Consider the series n 2 (n log n) and n 2 (n(log n)2 ). Show that one converges and one diverges

More information

THE INVERSE FUNCTION THEOREM

THE INVERSE FUNCTION THEOREM THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)

More information

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

g 2 (x) (1/3)M 1 = (1/3)(2/3)M. COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is

More information

The Markov Chain Monte Carlo Method

The Markov Chain Monte Carlo Method The Markov Chain Monte Carlo Method Idea: define an ergodic Markov chain whose stationary distribution is the desired probability distribution. Let X 0, X 1, X 2,..., X n be the run of the chain. The Markov

More information

MH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then

MH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever

More information

Marked Point Processes in Discrete Time

Marked Point Processes in Discrete Time Marked Point Processes in Discrete Time Karl Sigman Ward Whitt September 1, 2018 Abstract We present a general framework for marked point processes {(t j, k j ) : j Z} in discrete time t j Z, marks k j

More information

Week 5 Lectures 13-15

Week 5 Lectures 13-15 Week 5 Lectures 13-15 Lecture 13 Definition 29 Let Y be a subset X. A subset A Y is open in Y if there exists an open set U in X such that A = U Y. It is not difficult to show that the collection of all

More information

Martingale Problems. Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi

Martingale Problems. Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi s Abhay G. Bhatt Theoretical Statistics and Mathematics Unit Indian Statistical Institute, Delhi Lectures on Probability and Stochastic Processes III Indian Statistical Institute, Kolkata 20 24 November

More information

Extended Renovation Theory and Limit Theorems for Stochastic Ordered Graphs

Extended Renovation Theory and Limit Theorems for Stochastic Ordered Graphs Markov Processes Relat. Fields 9, 413 468 (2003) Extended Renovation Theory and Limit Theorems for Stochastic Ordered Graphs S. Foss 1 and T. Konstantopoulos 2 1 Department of Actuarial Mathematics and

More information

Markov processes and queueing networks

Markov processes and queueing networks Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution

More information

INTRODUCTION TO MARKOV CHAIN MONTE CARLO

INTRODUCTION TO MARKOV CHAIN MONTE CARLO INTRODUCTION TO MARKOV CHAIN MONTE CARLO 1. Introduction: MCMC In its simplest incarnation, the Monte Carlo method is nothing more than a computerbased exploitation of the Law of Large Numbers to estimate

More information

A Zero one Law for Linear Transformations of Lévy Noise

A Zero one Law for Linear Transformations of Lévy Noise Contemporary Mathematics A Zero one Law for Linear Transformations of Lévy Noise Steven N. Evans Abstract. A Lévy noise on R d assigns a random real mass Π(B) to each Borel subset B of R d with finite

More information

Chapter 3. Riemannian Manifolds - I. The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves

Chapter 3. Riemannian Manifolds - I. The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves Chapter 3 Riemannian Manifolds - I The subject of this thesis is to extend the combinatorial curve reconstruction approach to curves embedded in Riemannian manifolds. A Riemannian manifold is an abstraction

More information

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Noèlia Viles Cuadros BCAM- Basque Center of Applied Mathematics with Prof. Enrico

More information

Part IB. Further Analysis. Year

Part IB. Further Analysis. Year Year 2004 2003 2002 2001 10 2004 2/I/4E Let τ be the topology on N consisting of the empty set and all sets X N such that N \ X is finite. Let σ be the usual topology on R, and let ρ be the topology on

More information

SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE

SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE SEPARABILITY AND COMPLETENESS FOR THE WASSERSTEIN DISTANCE FRANÇOIS BOLLEY Abstract. In this note we prove in an elementary way that the Wasserstein distances, which play a basic role in optimal transportation

More information

1 Math 241A-B Homework Problem List for F2015 and W2016

1 Math 241A-B Homework Problem List for F2015 and W2016 1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let

More information

Definable Extension Theorems in O-minimal Structures. Matthias Aschenbrenner University of California, Los Angeles

Definable Extension Theorems in O-minimal Structures. Matthias Aschenbrenner University of California, Los Angeles Definable Extension Theorems in O-minimal Structures Matthias Aschenbrenner University of California, Los Angeles 1 O-minimality Basic definitions and examples Geometry of definable sets Why o-minimal

More information

i=1 β i,i.e. = β 1 x β x β 1 1 xβ d

i=1 β i,i.e. = β 1 x β x β 1 1 xβ d 66 2. Every family of seminorms on a vector space containing a norm induces ahausdorff locally convex topology. 3. Given an open subset Ω of R d with the euclidean topology, the space C(Ω) of real valued

More information

Convergence of loop erased random walks on a planar graph to a chordal SLE(2) curve

Convergence of loop erased random walks on a planar graph to a chordal SLE(2) curve Convergence of loop erased random walks on a planar graph to a chordal SLE(2) curve Hiroyuki Suzuki Chuo University International Workshop on Conformal Dynamics and Loewner Theory 2014/11/23 1 / 27 Introduction(1)

More information

Propp-Wilson Algorithm (and sampling the Ising model)

Propp-Wilson Algorithm (and sampling the Ising model) Propp-Wilson Algorithm (and sampling the Ising model) Danny Leshem, Nov 2009 References: Haggstrom, O. (2002) Finite Markov Chains and Algorithmic Applications, ch. 10-11 Propp, J. & Wilson, D. (1996)

More information

Positive and null recurrent-branching Process

Positive and null recurrent-branching Process December 15, 2011 In last discussion we studied the transience and recurrence of Markov chains There are 2 other closely related issues about Markov chains that we address Is there an invariant distribution?

More information

Stochastic process. X, a series of random variables indexed by t

Stochastic process. X, a series of random variables indexed by t Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,

More information

Krieger s finite generator theorem for ergodic actions of countable groups

Krieger s finite generator theorem for ergodic actions of countable groups Krieger s finite generator theorem for ergodic actions of countable groups Brandon Seward University of Michigan UNT RTG Conference Logic, Dynamics, and Their Interactions II June 6, 2014 Brandon Seward

More information

Markov chains. Randomness and Computation. Markov chains. Markov processes

Markov chains. Randomness and Computation. Markov chains. Markov processes Markov chains Randomness and Computation or, Randomized Algorithms Mary Cryan School of Informatics University of Edinburgh Definition (Definition 7) A discrete-time stochastic process on the state space

More information

Topics in Stochastic Geometry. Lecture 1 Point processes and random measures

Topics in Stochastic Geometry. Lecture 1 Point processes and random measures Institut für Stochastik Karlsruher Institut für Technologie Topics in Stochastic Geometry Lecture 1 Point processes and random measures Lectures presented at the Department of Mathematical Sciences University

More information

Weak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria

Weak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria Weak Leiden University Amsterdam, 13 November 2013 Outline 1 2 3 4 5 6 7 Definition Definition Let µ, µ 1, µ 2,... be probability measures on (R, B). It is said that µ n converges weakly to µ, and we then

More information

WHY SATURATED PROBABILITY SPACES ARE NECESSARY

WHY SATURATED PROBABILITY SPACES ARE NECESSARY WHY SATURATED PROBABILITY SPACES ARE NECESSARY H. JEROME KEISLER AND YENENG SUN Abstract. An atomless probability space (Ω, A, P ) is said to have the saturation property for a probability measure µ on

More information

RANDOM WALKS AND THE PROBABILITY OF RETURNING HOME

RANDOM WALKS AND THE PROBABILITY OF RETURNING HOME RANDOM WALKS AND THE PROBABILITY OF RETURNING HOME ELIZABETH G. OMBRELLARO Abstract. This paper is expository in nature. It intuitively explains, using a geometrical and measure theory perspective, why

More information

Exercises. T 2T. e ita φ(t)dt.

Exercises. T 2T. e ita φ(t)dt. Exercises. Set #. Construct an example of a sequence of probability measures P n on R which converge weakly to a probability measure P but so that the first moments m,n = xdp n do not converge to m = xdp.

More information

Notes on Measure, Probability and Stochastic Processes. João Lopes Dias

Notes 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 information

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology

More information

A generic property of families of Lagrangian systems

A generic property of families of Lagrangian systems Annals of Mathematics, 167 (2008), 1099 1108 A generic property of families of Lagrangian systems By Patrick Bernard and Gonzalo Contreras * Abstract We prove that a generic Lagrangian has finitely many

More information

µ X (A) = P ( X 1 (A) )

µ X (A) = P ( X 1 (A) ) 1 STOCHASTIC PROCESSES This appendix provides a very basic introduction to the language of probability theory and stochastic processes. We assume the reader is familiar with the general measure and integration

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on

More information

Basic Definitions: Indexed Collections and Random Functions

Basic 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 information