Gaussian Random Field: simulation and quantification of the error
|
|
- Chloe Parks
- 5 years ago
- Views:
Transcription
1 Gaussian Random Field: simulation and quantification of the error EMSE Workshop 6 November 2017
2 Continuity Separability Proving continuity without separability 2 The stationary case 3 Medical framework Example of non-stationary gaussian random field
3 Definition Continuity Separability Proving continuity without separability Definition A real valued random field φ on (Ω, A, P) indexed by a metric space (M, d) is called separable, if there exists an at most countable subset S of M which is dense in (M, d), so that for all closed intervals C in R, and all open subsets O of M, {φ(x) C, x O} = {φ(x) C, x O S}. holds. Then S is called a separating set for φ.
4 Alternative definition Continuity Separability Proving continuity without separability Lemma A real valued random field φ on (Ω, A, P) indexed by (M, d) is separable with separating set S if and only if one of the following equivalent statements holds : (S 1 ) For every open subset O in M, (S 1) For every x M, and and inf φ(y) = inf φ(x), y O S x O sup y O S φ(y) = sup φ(x) ; x O lim inf φ(y) = lim inf φ(x), y x, y S y x lim inf φ(y) = lim inf φ(x). y x, y S y x
5 Definitions Continuity Separability Proving continuity without separability Let M be a compact of R d. (Or M = [ N, N] d, N N ) ; def D n = { k 2 n, k Zd} M, We define M the following norm : for all x, y M, def We will denote δ n = 1 2. n d(x, y) = def sup x i y i. i 1,...,d
6 Properties Continuity Separability Proving continuity without separability We have and D n D n+1 D n ( 2 n diam(m) + 1 ) d, For x D n we define (δ n (= 1 2 n )) C n (x) = def {y D n, d(x, y) δ n }. We have the following upperbound C n (x) 3 d.
7 Separability Proving continuity without separability We define also Then def π n = {{x, y}, x, y D n, d(x, y) δ n }. π n D n sup x D n C n (x) ( 2 n diam(m) + 1 ) d 3 d. (D) For all n > 1 and x, y D n, there exists x, y D n+1 such that d(x, x ) δ n+1 et d(y, y ) δ n+1 ; d(x, y ) d(x, y).
8 Conditions for the random field Separability Proving continuity without separability We finally set D = n N D n, (C) there exist two nondecreasing functions q and r such that π n q(δ n ) < + (C 1 ) n=1 r(δ n ) < + (C 2 ) n=1 ( P φ(x) φ(y) r ( d(x, y) )) q ( d(x, y) ), (C 3 ) for all x, y M with d(x, y) < ρ.
9 Choice of r Continuity Separability Proving continuity without separability We want r being "as big as possible", along the condition (C 2 ) : we choose (with ρ < 1 and α > 1) r(h) = def ( 1 ) α ( 1 ) α, = 0 < h < 1 (1) ln 2 (1/h) ln 2 (h) since then ( 1 ) ( r(δ n ) = r 2 n = 1 ln 2 (2 n ) ) α = 1 n α,
10 Choice of q Continuity Separability Proving continuity without separability q(h) = h (1+β)d With we have q(δ n ) = 1 2 (1+β)dn and π n ( 2 n diam(m) + 1 ) d 3 d (6diam(M)) d 2 nd π n q(δ n ) (6diam(M)) d 2 nd 2 (1+β)dn = C 1 d (2 βd ) n since βd > 0, 2 βd > 1, leads to a convergent series.
11 Fundamental Lemma Continuity Separability Proving continuity without separability Lemma Under the conditions (D) and (C), there exists a set Ω Ω, P(Ω ) = 1, such that for all ω Ω there exists n(ω) N such that 1 for all n n(ω), max φ(x, ω) φ(y, ω) r(δ n ); (2) (x,y) π n 2 for all m n n(ω), and every x, y D m with d(x, y) δ n we have m φ(x, ω) φ(y, ω) 2 r(δ k ). (3) k=n
12 Separability Proving continuity without separability We can state the continuity with respect to the set D Proposition Under the conditions (D) and (C) there exists a set Ω Ω, P(Ω ) = 1, such that for all ω Ω the restriction of the function x φ(x, ω) to D is (uniformly) continuous.
13 Separability Proving continuity without separability Theorem Let φ be continuous in probability so that the conditions (D) and (C) hold. Then, there exists Ω Ω, P(Ω ) = 1, such that we have a uniformly sample continuous modification φ of φ such that φ = φ on D Ω. Lemma Suppose that the random field φ satisfies condition (C 3 ) with lim q(x) = lim r(x) = 0 x 0 x 0 (which is true, if the three conditions (C) are satisfied). Then φ is continuous in probability.
14 Continuity Let S n be a finite index set (size n n) associated with a random field Gaussian vector of size n 2, denoted by X. The covariance C is then a n 2 n 2 -matrix. We know that if Z is a Gaussian vector of size n 2, which the componants have i.i.d. normal distributions (a «white noise») and A is such that A 2 = C, then X has the same law as AZ.
15 Examples with Gaussian covariance The matlab function "simgauss(n)" computes a square of size (2 n + 1) (2 n + 1). We have the following duration times :» simgauss(2) ; Elapsed time is seconds.» simgauss(3) ; Elapsed time is seconds.» simgauss(4) ; Elapsed time is seconds.» simgauss(5) ; Elapsed time is seconds.
16 Examples with Gaussian covariance» simgauss(6) ; Elapsed time is seconds FIGURE: Gaussian kernel, variance : 0.01
17 Examples with Gaussian covariance» simgauss(7) ; Elapsed time is seconds FIGURE: Gaussian kernel, variance : 0.01
18 Examples with Gaussian covariance FIGURE: Gaussian kernel, variance : 0.05» simgauss(7) ; Elapsed time is seconds.
19 Examples with Gaussian covariance The time is not the only issue of the naïve algorithm :» simgauss(8) ; Requested 66049x66049 (32.5GB) array exceeds maximum array size preference. Creation of arrays greater than this limit may take a long time and cause MATLAB to become unresponsive. See array size limit or preference panel for more information.
20 Generalized Random Field We consider the complexification of the Schwartz space S(R d ) S C (R d ) = S(R d ) S(R d ) Let (Ω, F, P) be a probability space, and denote by L 0 K (P) the space of real-or complex valued random variables, with K = R or C. Definition A generalized random field on R d is a K -linear mapping where K = R or C. ϕ : S K (R d ) L 0 K (P)
21 Theorem (Minlos theorem) Let Ξ be a characteristic function on S(R d ), i.e. 1 Ξ is continuous in S(R d ), 2 Ξ is positive definite, 3 Ξ(0) = 1. Then there exists a unique probability measure µ on (S (R d ), σ w ), such that for all f S(R d ) e i ω,f dµ(ω) = Ξ(f ) S (R d ) i.e. Ξ(f ) is the Fourier transform of a countably additive positive normalized measure.
22 Generalized white noise Definition A generalized random field W on R d is called white noise, if its characteristic function is given by Ξ WN (f ) = e 1 2 f,f L 2 (R d ). Remark : A real-valued white noise on R d, is a linear mapping W : S(R d ) L 0 (Ω, F, P), where (Ω, F, P) is some probability space, so that the family {W (f ), f S(R d )} is a centered Gaussian family with Proposition Cov(W (f ), W (g)) = E[W (f )W (g)] = f, g L2 (R d ). W extends to an isometric embedding of L 2 (R d ) into L 2 (P).
23 Let ϕ be a generalized random field. We define operations via dual pairing : Definition 1 The Fourier transform F and its inverse F 1 are defined on ϕ via Fϕ(f ) := ϕ(f 1 f ) F 1 ϕ(f ) := ϕ(ff ) 2 If g C (R d ) with at most polynomial growth, then gϕ(f ) := ϕ(gf )
24 Construction of Stationary Gaussian Random Fields Let ϕ be a stationary, real-valued, centered Gaussian random field with covariance Cov(ϕ(f ), ϕ(g)) = f, Cg L2 (R d ), f, g S(Rd ) with C : S(R d ) L 2 (R d ). Assume that C is given by an integral kernel, which by stationarity can be written as Cf (x) = K (x y)f (y)dy, R d where K is even because of the symmetry of C, and positive definite.
25 Hence if K is continuous, K (x) = e 2πixp dγ(p) (Böchner Theorem) We assume that Γ has a density γ which is supposed to be strictly positive and smooth. Then γ 1 2 is a strictly positive smooth root of γ. We set ϕ(f ) := (F 1 γ 1 2 FW )(f ), f S(R d ).
26 Discrete Fourier transform N 1,..., N d will represent even positive integers. For all u = (u 1,..., u d ) d i=1 0, N i 1 : ( ) 1 F N1,...,N d (f )(u) := e 2iπ u 1 k u d k d N 1 N d f (k 1,..., k d ). N 1 N d 0 k 1 N k d N d 1 (4) We will denote by F(N S i ) the "symmetric" discrete Fourier transform ( ) FN S 1 1,...,N d (g)(v) := e 2iπ v 1 k v d k d N 1 N d g(k 1,..., k d ). N 1 N d N 1 2 k 1 N N d 2 k d N d 2 1
27 d sym (Ni ) : i=1 0, N i d i=1 N i, N i 2 [ 2 yi = x (x i ) (y i ) with i if x i 0, N i 1 2 y i = x i N i if x i N i, N 2 (6) and, conversely, sym 1 (N i ) : d i=1 N i 2, N i 2 d i=1 0, N [ i xi = y (y i ) (x i ) with i if y i 0, N i 1 2 x i = y i + N i if y i N i, 0 2 (7) So, while working on a function c : d i=1 N i will use the function 2, N i 2 1 R, we c(x) := c ( sym (Ni ) (x)), d x 0, N i. i=1
28 Lemma F S (N i ) (f )(x) = F (N i )(f sym (Ni ) )(sym 1 (N i ) (x)). We can state the lemma on which will be built the algorithm : Lemma Let E =: d i=1 0, N i, h : E C and (A p ) p E, (B q ) q E be two independent white noises. The centered Gaussian Random field indexed on d i=1 0, N i defined by 2 ( G(x) := R F 1 (N i ) ( (A + ib)h ) (x) ) (8) has the following covariance function : ( E [G(x)G(y)] = R F 1 ( ) h 2) (N i ) (sym 1 (N i ) (y x)) (9)
29 Lemma F S (N i ) (f )(x) = F (N i )(f sym (Ni ) )(sym 1 (N i ) (x)). We can state the lemma on which will be built the algorithm : Lemma Let E =: d i=1 0, N i, h : E C and (A p ) p E, (B q ) q E be two independent white noises. The centered Gaussian Random field indexed on d i=1 0, N i defined by 2 ( G(x) := R F 1 (N i ) ( (A + ib)h ) (x) ) (8) has the following covariance function : ( E [G(x)G(y)] = R F 1 ( ) h 2) (N i ) (sym 1 (N i ) (y x)) (9)
30 Heuristic of the Algorithm Let c : (R n ) 2 R be a (continuous) covariance function (i.e. symmetric definite positive) and we assume that function to be stationary (i.e. invariant with respect to translation). Notation : c(h) := c(0, h), h R n. 1 This last function, according to a consequence of the Böchner s Theorem has a real positive valued Fourier s transform. 2 On the other hand, if c has a compact support, or if its tails norm decrease sufficiently fast to 0, the fast Fourier transform can be seen as an approximation of its Fourier s transform.
31 Using those two facts, we can consider that the values of the discrete Fourier transform of c are real and (close to being) positive and, with h(x) := F (Ni )(c)(x) R +, the Lemma 5 provides a Gaussian Random Field with covariance c ( E [G(x)G(y)] = R F 1 ( ) h 2) (N i ) (y x) ( = R F 1 (N i )( F(Ni )(c) ) ) (y x) = R ( c(x y) ) Remark = c(x y) = c(x, y). In the general case (i.e. F (Ni )(c)(x) R, because of the symmetry of c) we have ( E [G(x)G(y)] = R F 1 (N i )( F (Ni )(c) ) ) (y x).
32 Unidimensional case Continuity The idea is to approximate N values in [ 1 2, 1 2 ] of a Fourier transform of a function f (assuming that the function of interest has negligible values outside of [ 1 2, 1 2 ]) by e i x N y f (y) dy, x N 2, N 2 1. (10) then by 1 N F s N (f N)(x) def = 1 N N 2 1 k= N 2 e ix k N fn (k) (11) (with f N (k) = def f ( k N )).
33 Error quantification Continuity Proposition Let N 2N, c : E C and (A p ) p E, (B q ) q E be two independent white noises. The centered Gaussian Random field indexed on 0, N 2 defined by ( G(x) := R F 1 (N i )( (A + ib) FN (c)(x) ) ) (x) (12) has a covariance function c G such that, for all x, y 0, N 2, c(x, y) c G (x, y) 2n N (ε c + ε N ) (13) where n N stands for the numbers of x such that F N (c)(x) < 0 and with ε c such that [ sup ] ] e i2πxy c(y) dy ε c. x 1 2, 1 2 [ R\ 1 2, 1 2
34 with ε N c( 1 2 ) p N + b 2k N 2k (2k)! (2π)2k 1 2 2k+1 ( c 1 ) 1 2k+1,i 2 + N 2p+1 (2p + 1) R N,p k=1 where c 2k+1,o (x) = def R n,p (4π) 2p+1 2k+1 l=1 l impair sup t [ 1 2, 1 2 ] l 0,2p+1 c (l) (x) and with c (l) (t) 1 0 (14) B 2p+1 (u) du, (15) def where B i (resp. b i = B i (0)) are the Bernoulli polynomials (resp. Bernoulli numbers).
35 Example : the exponential covariance case c(x) = def e x2 2σ 2. we have (with p = 0) ( ( c(x, y) c G (x, y) 2n N e 1 8σ ) + 1 ( 1 ) ) N 2N σ 2 + 2π. }{{} e N For N = 1000 we have : σ e For N = σ e
36 Example, the exponential covariance case : error (p=0, N=1000)
37 Example, the exponential covariance case : error (p=0, N=10000)
38 Example, the exponential covariance case For p = 1, it follows c( 1 2 ε N ) N + b 2 2N 2 2π23( c ( 1 2 ) + c ( 1 2 ) ) + 1 3N 3 R N 3 ( e 1 1 8σ 2 N + 2π ( 1 3N 2 σ σ )) 4σ ( 1 N 3 σ σ ) 8σ 6 For N = 1000 we have : σ e and for σ = 0.095, e 1000 = For N = σ e
39 Example, the exponential covariance case : error (p=1, N=1000) #
40 Example, the exponential covariance case : error (p=1, N=10000) #
41 The compact support case When the covariance function has a compact support included in [ 1 2, 1 2 ], the speed can be improved (especially when the derivatives are uniformly bounded), since we have for some p N, if c is a C p function, e i x N y f (y) dy 1 N F s N (f N)(x) = R N,p N 2p+1 (2p + 1) with R n,p M 2p B 2p+1(t) dt.
42 The multidimensional case We consider a continuous covariance function c : R 2 R belonging to L 1 (R 2 ). Let ε c be such that R 2 \[ 1 2, 1 2 ]2 c(u, v) du dv ε c.
43 g(u, v) du dv 1 [ 1 2, 1 MN 2 ]2 1 2N + + k=1 =:ε N,M. g(u k, v l ) N 1 M 1 k=0 l=0 sup ( g 1, v) g ( 1, v) 1 v [ 1 2, M 2 ] p b 2k ( 1 (2k)! N 2k 1 N 2p+1 (2p + 1) sup ( g u, 1 u [ 1 2, ] sup g (2k 1) ( 1, v) g (2k 1)( 1, v) v [ 1 2, ] ) ( ) g u, sup g (2k 1)( ) u, 1 M 2k u [ 1 2, g (2k 1) ( ) ) u, 1 2 ] sup RN,p v + v [ 1 2, 1 2 ] 1 M 2p+1 (2p + 1) sup u [ 1 2, 1 2 ] R u M,p
44 Example : the exponential covariance case c(u, v) = e u2 +v 2 2σ ( 2 ) g(u, v) = c(u, v)e 2iπ u x N +v y M ) g 1 (u, v) = u u2 +v (u 2 σ 2 e 2σ 2 e 2iπ x N +v y M ( = g(u, v) u σ 2 + 2iπ x N ). + 2iπ x g(u, v) N ( g 1 (u, v) = g(u, v) u σ 2 + 2iπ x ) ( N σ 2 ( = g(u, v) u σ 2 + 2iπ x ) ) 2 1 N σ 2
45 And, ( ( g 1 (u, v) = g(u, v) u σ 2 + 2iπ x ) 3 3 ( N σ 2 u σ 2 + 2iπ x ) ) N It leads to the following upperbound : ( g 1 (u, v) c(u, v) 4 u 3 σ 6 + 4(2π)3 + 3 u ) σ 4 + 6π Exemples: For N = 1024 we have the following results : σ e σ e
46 The human eye Continuity Medical framework Example of non-stationary gaussian random field FIGURE: L œil en coupe
47 Corneal endothelium Continuity Medical framework Example of non-stationary gaussian random field Definition (Corneal endothelium) It separates the cornea from the aqueous humor. It is a cellular monolayer comprising about 500,000 cells whose quality and quantity vary with age.
48 Morphology Continuity Medical framework Example of non-stationary gaussian random field The endothelium is composed of relatively regular hexagonal (or almost) cells. However, there are some more pronounced irregularities : on the edges (larger cells) ; in case of pathologies (e.g. Cornea guttata) ; in case of transplant,...
49 Voronoï Partition Continuity Medical framework Example of non-stationary gaussian random field Question How will we simulate the cells? If we already have a set of points, we can make a Voronoï partition For each point p of the surface S, the Voronoï cell V (p) of p is the set of the points closer to p than any other points of S. The Voronoï partition V (S) is the partition made by the Voronoï cells.
50 Medical framework Example of non-stationary gaussian random field Poisson point process and Voronoï partion Random space points are most commonly generated using a Poisson point process......which is rather irregular...
51 Medical framework Example of non-stationary gaussian random field Superposition an functions with compact support We use the combination G 1 (x) + f (x)g 2 (x) where f is a compact support function :
52 Continuity Medical framework Example of non-stationary gaussian random field Non-stationary gaussian random field : "large center"
53 Medical framework Example of non-stationary gaussian random field Voronoï partition with high centred density
54 Weak local density Continuity Medical framework Example of non-stationary gaussian random field We use a combination G 1 (x) + f (x)g 2 (x) where f is the complementary of a compact support function
55 Voronoï weak local density I Medical framework Example of non-stationary gaussian random field
56 Voronoï weak local density II Medical framework Example of non-stationary gaussian random field
57 Medical framework Example of non-stationary gaussian random field Random field for simulating the Cornea Guttata
58 Conclusion and perspective Medical framework Example of non-stationary gaussian random field Quantification of the error and combination of Gaussian stationary random fields (with related "well chosen" functions belonging to the algebra generated by smooth functions with compact support) provide an easy to use and interesting modelisation tool, at least in the medical field in which we had to work. We are working now with a combination of stationary random fields with multiplicative functions taken in wavelet basis.
59 Medical framework Example of non-stationary gaussian random field Thank you for the invitation!
Existence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets
Existence of a Limit on a Dense Set, and Construction of Continuous Functions on Special Sets REU 2012 Recap: Definitions Definition Given a real-valued function f, the limit of f exists at a point c R
More informationELEMENTS OF PROBABILITY THEORY
ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
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 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 informationFourier Transform & Sobolev Spaces
Fourier Transform & Sobolev Spaces Michael Reiter, Arthur Schuster Summer Term 2008 Abstract We introduce the concept of weak derivative that allows us to define new interesting Hilbert spaces the Sobolev
More informationExercises with solutions (Set D)
Exercises with solutions Set D. A fair die is rolled at the same time as a fair coin is tossed. Let A be the number on the upper surface of the die and let B describe the outcome of the coin toss, where
More informationLecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable
Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed
More informationSAMPLE PROPERTIES OF RANDOM FIELDS
Communications on Stochastic Analysis Vol. 3, No. 3 2009) 331-348 Serials Publications www.serialspublications.com SAMPLE PROPERTIES OF RANDOM FIELDS II: CONTINUITY JÜRGEN POTTHOFF Abstract. A version
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 informationX n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)
14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence
More informationThree hours THE UNIVERSITY OF MANCHESTER. 24th January
Three hours MATH41011 THE UNIVERSITY OF MANCHESTER FOURIER ANALYSIS AND LEBESGUE INTEGRATION 24th January 2013 9.45 12.45 Answer ALL SIX questions in Section A (25 marks in total). Answer THREE of the
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 information) ) = γ. and P ( X. B(a, b) = Γ(a)Γ(b) Γ(a + b) ; (x + y, ) I J}. Then, (rx) a 1 (ry) b 1 e (x+y)r r 2 dxdy Γ(a)Γ(b) D
3 Independent Random Variables II: Examples 3.1 Some functions of independent r.v. s. Let X 1, X 2,... be independent r.v. s with the known distributions. Then, one can compute the distribution of a r.v.
More information1 Continuity Classes C m (Ω)
0.1 Norms 0.1 Norms A norm on a linear space X is a function : X R with the properties: Positive Definite: x 0 x X (nonnegative) x = 0 x = 0 (strictly positive) λx = λ x x X, λ C(homogeneous) x + y x +
More informationProblem Set 5: Solutions Math 201A: Fall 2016
Problem Set 5: s Math 21A: Fall 216 Problem 1. Define f : [1, ) [1, ) by f(x) = x + 1/x. Show that f(x) f(y) < x y for all x, y [1, ) with x y, but f has no fixed point. Why doesn t this example contradict
More informationFrom 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 informationMeasure-theoretic probability
Measure-theoretic probability Koltay L. VEGTMAM144B November 28, 2012 (VEGTMAM144B) Measure-theoretic probability November 28, 2012 1 / 27 The probability space De nition The (Ω, A, P) measure space is
More informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationLecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable
Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed
More informationSobolev Spaces. Chapter 10
Chapter 1 Sobolev Spaces We now define spaces H 1,p (R n ), known as Sobolev spaces. For u to belong to H 1,p (R n ), we require that u L p (R n ) and that u have weak derivatives of first order in L p
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 informationWe denote the space of distributions on Ω by D ( Ω) 2.
Sep. 1 0, 008 Distributions Distributions are generalized functions. Some familiarity with the theory of distributions helps understanding of various function spaces which play important roles in the study
More informationBrownian motion. Samy Tindel. Purdue University. Probability Theory 2 - MA 539
Brownian motion Samy Tindel Purdue University Probability Theory 2 - MA 539 Mostly taken from Brownian Motion and Stochastic Calculus by I. Karatzas and S. Shreve Samy T. Brownian motion Probability Theory
More informationRKHS, Mercer s theorem, Unbounded domains, Frames and Wavelets Class 22, 2004 Tomaso Poggio and Sayan Mukherjee
RKHS, Mercer s theorem, Unbounded domains, Frames and Wavelets 9.520 Class 22, 2004 Tomaso Poggio and Sayan Mukherjee About this class Goal To introduce an alternate perspective of RKHS via integral operators
More informationWiener Measure and Brownian Motion
Chapter 16 Wiener Measure and Brownian Motion Diffusion of particles is a product of their apparently random motion. The density u(t, x) of diffusing particles satisfies the diffusion equation (16.1) u
More informationMath 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.
Math 321 Final Examination April 1995 Notation used in this exam: N 1 π (1) S N (f,x) = f(t)e int dt e inx. 2π n= N π (2) C(X, R) is the space of bounded real-valued functions on the metric space X, equipped
More informationStatistical signal processing
Statistical signal processing Short overview of the fundamentals Outline Random variables Random processes Stationarity Ergodicity Spectral analysis Random variable and processes Intuition: A random variable
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More information2 (Bonus). 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 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationP-adic Functions - Part 1
P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant
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 informationElements of Positive Definite Kernel and Reproducing Kernel Hilbert Space
Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space Statistical Inference with Reproducing Kernel Hilbert Space Kenji Fukumizu Institute of Statistical Mathematics, ROIS Department
More informationExercises from other sources REAL NUMBERS 2,...,
Exercises from other sources REAL NUMBERS 1. Find the supremum and infimum of the following sets: a) {1, b) c) 12, 13, 14, }, { 1 3, 4 9, 13 27, 40 } 81,, { 2, 2 + 2, 2 + 2 + } 2,..., d) {n N : n 2 < 10},
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More informationFRAMES AND TIME-FREQUENCY ANALYSIS
FRAMES AND TIME-FREQUENCY ANALYSIS LECTURE 5: MODULATION SPACES AND APPLICATIONS Christopher Heil Georgia Tech heil@math.gatech.edu http://www.math.gatech.edu/ heil READING For background on Banach spaces,
More informationLinear Independence of Finite Gabor Systems
Linear Independence of Finite Gabor Systems 1 Linear Independence of Finite Gabor Systems School of Mathematics Korea Institute for Advanced Study Linear Independence of Finite Gabor Systems 2 Short trip
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 information9 Brownian Motion: Construction
9 Brownian Motion: Construction 9.1 Definition and Heuristics The central limit theorem states that the standard Gaussian distribution arises as the weak limit of the rescaled partial sums S n / p n of
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationChapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University
Chapter 3, 4 Random Variables ENCS6161 - Probability and Stochastic Processes Concordia University ENCS6161 p.1/47 The Notion of a Random Variable A random variable X is a function that assigns a real
More informationRecall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm
Chapter 13 Radon Measures Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm (13.1) f = sup x X f(x). We want to identify
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 informationBounded uniformly continuous functions
Bounded uniformly continuous functions Objectives. To study the basic properties of the C -algebra of the bounded uniformly continuous functions on some metric space. Requirements. Basic concepts of analysis:
More informationPCMI Introduction to Random Matrix Theory Handout # REVIEW OF PROBABILITY THEORY. Chapter 1 - Events and Their Probabilities
PCMI 207 - Introduction to Random Matrix Theory Handout #2 06.27.207 REVIEW OF PROBABILITY THEORY Chapter - Events and Their Probabilities.. Events as Sets Definition (σ-field). A collection F of subsets
More information1.5 Approximate Identities
38 1 The Fourier Transform on L 1 (R) which are dense subspaces of L p (R). On these domains, P : D P L p (R) and M : D M L p (R). Show, however, that P and M are unbounded even when restricted to these
More informationSupplementary Notes for W. Rudin: Principles of Mathematical Analysis
Supplementary Notes for W. Rudin: Principles of Mathematical Analysis SIGURDUR HELGASON In 8.00B it is customary to cover Chapters 7 in Rudin s book. Experience shows that this requires careful planning
More informationFunctional Analysis Winter 2018/2019
Functional Analysis Winter 2018/2019 Peer Christian Kunstmann Karlsruher Institut für Technologie (KIT) Institut für Analysis Englerstr. 2, 76131 Karlsruhe e-mail: peer.kunstmann@kit.edu These lecture
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 informationMathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )
Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca October 22nd, 2014 E. Tanré (INRIA - Team Tosca) Mathematical
More informationMath The Laplacian. 1 Green s Identities, Fundamental Solution
Math. 209 The Laplacian Green s Identities, Fundamental Solution Let be a bounded open set in R n, n 2, with smooth boundary. The fact that the boundary is smooth means that at each point x the external
More informationFunctional Analysis I
Functional Analysis I Course Notes by Stefan Richter Transcribed and Annotated by Gregory Zitelli Polar Decomposition Definition. An operator W B(H) is called a partial isometry if W x = X for all x (ker
More informationPersistence as a spectral property
, Georgia Tech. Joint work with Naomi Feldheim and Ohad Feldheim. March 18, 2017 Advertisement. SEAM2018, March 23-25, 2018. Georgia Tech, Atlanta, GA. Organizing committee: Michael Lacey Wing Li Galyna
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 informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationLecture 5: Expectation
Lecture 5: Expectation 1. Expectations for random variables 1.1 Expectations for simple random variables 1.2 Expectations for bounded random variables 1.3 Expectations for general random variables 1.4
More informationStatistics, Data Analysis, and Simulation SS 2015
Statistics, Data Analysis, and Simulation SS 2015 08.128.730 Statistik, Datenanalyse und Simulation Dr. Michael O. Distler Mainz, 27. April 2015 Dr. Michael O. Distler
More informationSobolev spaces, Trace theorems and Green s functions.
Sobolev spaces, Trace theorems and Green s functions. Boundary Element Methods for Waves Scattering Numerical Analysis Seminar. Orane Jecker October 21, 2010 Plan Introduction 1 Useful definitions 2 Distributions
More informationOverview of normed linear spaces
20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural
More informationPartial Differential Equations
Part II Partial Differential Equations Year 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2015 Paper 4, Section II 29E Partial Differential Equations 72 (a) Show that the Cauchy problem for u(x,
More informationCHAPTER V DUAL SPACES
CHAPTER V DUAL SPACES DEFINITION Let (X, T ) be a (real) locally convex topological vector space. By the dual space X, or (X, T ), of X we mean the set of all continuous linear functionals on X. By the
More informationMATH MEASURE THEORY AND FOURIER ANALYSIS. Contents
MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure
More informationMA5206 Homework 4. Group 4. April 26, ϕ 1 = 1, ϕ n (x) = 1 n 2 ϕ 1(n 2 x). = 1 and h n C 0. For any ξ ( 1 n, 2 n 2 ), n 3, h n (t) ξ t dt
MA526 Homework 4 Group 4 April 26, 26 Qn 6.2 Show that H is not bounded as a map: L L. Deduce from this that H is not bounded as a map L L. Let {ϕ n } be an approximation of the identity s.t. ϕ C, sptϕ
More informationl(y j ) = 0 for all y j (1)
Problem 1. The closed linear span of a subset {y j } of a normed vector space is defined as the intersection of all closed subspaces containing all y j and thus the smallest such subspace. 1 Show that
More informationDual Space of L 1. C = {E P(I) : one of E or I \ E is countable}.
Dual Space of L 1 Note. The main theorem of this note is on page 5. The secondary theorem, describing the dual of L (µ) is on page 8. Let (X, M, µ) be a measure space. We consider the subsets of X which
More information18.175: Lecture 15 Characteristic functions and central limit theorem
18.175: Lecture 15 Characteristic functions and central limit theorem Scott Sheffield MIT Outline Characteristic functions Outline Characteristic functions Characteristic functions Let X be a random variable.
More information1 Random Variable: Topics
Note: Handouts DO NOT replace the book. In most cases, they only provide a guideline on topics and an intuitive feel. 1 Random Variable: Topics Chap 2, 2.1-2.4 and Chap 3, 3.1-3.3 What is a random variable?
More informationA List of Problems in Real Analysis
A List of Problems in Real Analysis W.Yessen & T.Ma December 3, 218 This document was first created by Will Yessen, who was a graduate student at UCI. Timmy Ma, who was also a graduate student at UCI,
More information4 Riesz Kernels. Since the functions k i (ξ) = ξ i. are bounded functions it is clear that R
4 Riesz Kernels. A natural generalization of the Hilbert transform to higher dimension is mutiplication of the Fourier Transform by homogeneous functions of degree 0, the simplest ones being R i f(ξ) =
More informationCHAPTER 3: LARGE SAMPLE THEORY
CHAPTER 3 LARGE SAMPLE THEORY 1 CHAPTER 3: LARGE SAMPLE THEORY CHAPTER 3 LARGE SAMPLE THEORY 2 Introduction CHAPTER 3 LARGE SAMPLE THEORY 3 Why large sample theory studying small sample property is usually
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 informationErrata Applied Analysis
Errata Applied Analysis p. 9: line 2 from the bottom: 2 instead of 2. p. 10: Last sentence should read: The lim sup of a sequence whose terms are bounded from above is finite or, and the lim inf of a sequence
More informationIn terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3.
1. GAUSSIAN PROCESSES A Gaussian process on a set T is a collection of random variables X =(X t ) t T on a common probability space such that for any n 1 and any t 1,...,t n T, the vector (X(t 1 ),...,X(t
More informationLecture 5 - Hausdorff and Gromov-Hausdorff Distance
Lecture 5 - Hausdorff and Gromov-Hausdorff Distance August 1, 2011 1 Definition and Basic Properties Given a metric space X, the set of closed sets of X supports a metric, the Hausdorff metric. If A is
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More informationContinuous Random Variables
1 / 24 Continuous Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 27, 2013 2 / 24 Continuous Random Variables
More informationTHE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES
THE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES PHILIP GADDY Abstract. Throughout the course of this paper, we will first prove the Stone- Weierstrass Theroem, after providing some initial
More informationSUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES
SUMMARY OF RESULTS ON PATH SPACES AND CONVERGENCE IN DISTRIBUTION FOR STOCHASTIC PROCESSES RUTH J. WILLIAMS October 2, 2017 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive,
More informationStability of optimization problems with stochastic dominance constraints
Stability of optimization problems with stochastic dominance constraints D. Dentcheva and W. Römisch Stevens Institute of Technology, Hoboken Humboldt-University Berlin www.math.hu-berlin.de/~romisch SIAM
More informationFFTs in Graphics and Vision. Homogenous Polynomials and Irreducible Representations
FFTs in Graphics and Vision Homogenous Polynomials and Irreducible Representations 1 Outline The 2π Term in Assignment 1 Homogenous Polynomials Representations of Functions on the Unit-Circle Sub-Representations
More informationi=1 α i. Given an m-times continuously
1 Fundamentals 1.1 Classification and characteristics Let Ω R d, d N, d 2, be an open set and α = (α 1,, α d ) T N d 0, N 0 := N {0}, a multiindex with α := d i=1 α i. Given an m-times continuously differentiable
More informationEntrance Exam, Real Analysis September 1, 2017 Solve exactly 6 out of the 8 problems
September, 27 Solve exactly 6 out of the 8 problems. Prove by denition (in ɛ δ language) that f(x) = + x 2 is uniformly continuous in (, ). Is f(x) uniformly continuous in (, )? Prove your conclusion.
More informationChapter One. The Calderón-Zygmund Theory I: Ellipticity
Chapter One The Calderón-Zygmund Theory I: Ellipticity Our story begins with a classical situation: convolution with homogeneous, Calderón- Zygmund ( kernels on R n. Let S n 1 R n denote the unit sphere
More informationA SHORT INTRODUCTION TO BANACH LATTICES AND
CHAPTER A SHORT INTRODUCTION TO BANACH LATTICES AND POSITIVE OPERATORS In tis capter we give a brief introduction to Banac lattices and positive operators. Most results of tis capter can be found, e.g.,
More informationMarkov Chain Monte Carlo (MCMC)
Markov Chain Monte Carlo (MCMC Dependent Sampling Suppose we wish to sample from a density π, and we can evaluate π as a function but have no means to directly generate a sample. Rejection sampling can
More informationStone-Čech compactification of Tychonoff spaces
The Stone-Čech compactification of Tychonoff spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 27, 2014 1 Completely regular spaces and Tychonoff spaces A topological
More informationMET 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 informationReminder Notes for the Course on Distribution Theory
Reminder Notes for the Course on Distribution Theory T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie March
More informationAn Approximate Solution for Volterra Integral Equations of the Second Kind in Space with Weight Function
International Journal of Mathematical Analysis Vol. 11 17 no. 18 849-861 HIKARI Ltd www.m-hikari.com https://doi.org/1.1988/ijma.17.771 An Approximate Solution for Volterra Integral Equations of the Second
More informationconditional cdf, conditional pdf, total probability theorem?
6 Multiple Random Variables 6.0 INTRODUCTION scalar vs. random variable cdf, pdf transformation of a random variable conditional cdf, conditional pdf, total probability theorem expectation of a random
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 information2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.
University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)
More informationHomogenization for chaotic dynamical systems
Homogenization for chaotic dynamical systems David Kelly Ian Melbourne Department of Mathematics / Renci UNC Chapel Hill Mathematics Institute University of Warwick November 3, 2013 Duke/UNC Probability
More informationPROBABILITY: 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 informationCONVERGENCE THEORY. G. ALLAIRE CMAP, Ecole Polytechnique. 1. Maximum principle. 2. Oscillating test function. 3. Two-scale convergence
1 CONVERGENCE THEOR G. ALLAIRE CMAP, Ecole Polytechnique 1. Maximum principle 2. Oscillating test function 3. Two-scale convergence 4. Application to homogenization 5. General theory H-convergence) 6.
More informationEstimation of the functional Weibull-tail coefficient
1/ 29 Estimation of the functional Weibull-tail coefficient Stéphane Girard Inria Grenoble Rhône-Alpes & LJK, France http://mistis.inrialpes.fr/people/girard/ June 2016 joint work with Laurent Gardes,
More informationP (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 informationSEPARABILITY 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 information7 Complete metric spaces and function spaces
7 Complete metric spaces and function spaces 7.1 Completeness Let (X, d) be a metric space. Definition 7.1. A sequence (x n ) n N in X is a Cauchy sequence if for any ɛ > 0, there is N N such that n, m
More information