Persistence as a spectral property
|
|
- Flora Goodwin
- 5 years ago
- Views:
Transcription
1 , Georgia Tech. Joint work with Naomi Feldheim and Ohad Feldheim. March 18, 2017
2 Advertisement. SEAM2018, March 23-25, Georgia Tech, Atlanta, GA. Organizing committee: Michael Lacey Wing Li Galyna Livshyts
3 Gaussian stationary processes (GSP) Let T =Z or R. Definition: Stationary Gaussian process A random sequence f : T R is said to be: Gaussian if all finite marginals are Gaussian, i.e. (f (x 1 ),...f (x N )) N R N (0,Σ k1,...,k N ), for all N IN and x 1,...,x N T. Stationary if it is shift invariant in distribution, i.e. (f (x 1 + y),...f (x N + y)) d (f (x 1 ),...f (x N )), for all N IN, x 1,...,x N T, and y T.
4 Gaussian stationary processes (GSP) Definition: The covariance function Given a Gaussian process f let r(x,y) =E(f (x)f (y)) x,y T. If the process is stationary then r(x,y) = r(x y,0) =: r(x y). We call r(x) the covariance function of the process f.
5 Gaussian stationary processes (GSP) Definition: The covariance function Given a Gaussian process f let r(x,y) =E(f (x)f (y)) x,y T. If the process is stationary then r(x,y) = r(x y,0) =: r(x y). We call r(x) the covariance function of the process f. Assumption: Over R we assume r(x) to be continuous.
6 Gaussian stationary processes (GSP) Definition: The covariance function Given a Gaussian process f let r(x,y) =E(f (x)f (y)) x,y T. If the process is stationary then r(x,y) = r(x y,0) =: r(x y). We call r(x) the covariance function of the process f. Assumption: Over R we assume r(x) to be continuous. Definition: The spectral measure By Bochner s theorem there exists a positive measure ρ f over [ π,π] or R s.t. ˆρ f (x) = r(x). ρ f is called the spectral measure of the process f.
7 Gaussian stationary processes (GSP) Definition: The covariance function Given a Gaussian process f let r(x,y) =E(f (x)f (y)) x,y T. If the process is stationary then r(x,y) = r(x y,0) =: r(x y). We call r(x) the covariance function of the process f. Assumption: Over R we assume r(x) to be continuous. Definition: The spectral measure By Bochner s theorem there exists a positive measure ρ f over [ π,π] or R s.t. ˆρ f (x) = r(x). ρ f is called the spectral measure of the process f. Proposition A stationary Gaussian process is determined uniquely by its covariance function and therefore also by its spectral measure. Moreover, there is a 1 1 correspondence between stationary gaussian processes f and symmetric, positive, Borel measures ρ.
8 Example - Gaussian wave ξ 1,ξ 2 i.i.d. N (0,1) f (x) = ξ 0 sin(x) + ξ 1 cos(x) r(x) = cos(x) ρ = 2 1 (δ 1 + δ 1 ) Covariance Kernel Three Sample Paths Spectral Measure
9 Example - Almost periodic wave ξ 1,ξ 2,ξ 3,ξ 4 i.i.d. N (0,1) f (x) = ξ 0 sin(x) + ξ 1 cos(x) + ξ 2 sin( 2x) + ξ 3 cos( 2x) r(x) = cos(x) + cos( 2x) ( ρ = 1 2 δ1 + δ 1 + δ 2 + δ ) Covariance Kernel Three Sample Paths Spectral Measure
10 Example - i.i.d. sequence ξ n i.i.d. N (0,1) f (n) = ξ n 1 Covariance Kernel r(n) = δ n,0 dρ(λ) = 1 2π 1I [ π,π](λ)dλ Three Sample Paths Spectral Measure
11 Example - Sinc kernel ξ n i.i.d. N (0,1) f (x) = ξ n sinc(x n) n IN r(x) = sin(πx) = sinc(x) πx dρ(λ) = 1 2π 1I [ π,π](λ)dλ Covariance Kernel 2 Three Sample Paths Spectral Measure
12 Toy Examples over Z f (k) are iid with f (k) N R (0,1)
13 Toy Examples over Z f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...).
14 Toy Examples over Z f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure.
15 Toy Examples over Z f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1)
16 Toy Examples over Z f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...).
17 Toy Examples over Z f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...). dρ f (t) = (1 cost)dt.
18 Toy Examples over Z f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...). dρ f (t) = (1 cost)dt. f (k) = f (0) where g(0) N R (0,1)
19 Toy Examples over Z f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...). dρ f (t) = (1 cost)dt. f (k) = f (0) where g(0) N R (0,1) (r(k)) k = (...,1,1,1,...).
20 Toy Examples over Z f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...). dρ f (t) = (1 cost)dt. f (k) = f (0) where g(0) N R (0,1) (r(k)) k = (...,1,1,1,...). ρ f = δ 0.
21 Persistence Definition: Persistence The persistence of a shift invariant random sequence f :Z R is defined by P f (N) := Prob(f (k) 0, k [0,...,N])
22 Persistence Definition: Persistence The persistence of a shift invariant random sequence f :Z R is defined by P f (N) := Prob(f (k) 0, k [0,...,N]) One of the main questions in this area: Question: Estimate the size of P f (N) as N, i.e. P f (N)? as N.
23 Motivation Engineering: f is a random noise or wave transition. ( : Rice, Slepian, Newell, Rosenblatt, Piterbarg, Kolmogorov and others. These results are applicable mainly when r is non-negative or absolutely summable. ). Physics: A toy model in statistical mechanics for electrons in matter, diffusion, spin systems. (1990 ) Related to random zeroes and random nodal lines of polynomials and GAF s. What are possible asymptotic behaviors of the persistence probability of a GSP on large intervals? What features of the covariance function determine this behavior? (Slepian, 1962)
24 Persistency-Returning to the toy examples f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure.
25 Persistency-Returning to the toy examples f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. P f (N) = 1 N log2 = e 2 N
26 Persistency-Returning to the toy examples f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. P f (N) = 1 N log2 = e 2 N f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...). dρ f (t) = (1 cost)dt.
27 Persistency-Returning to the toy examples f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. P f (N) = 1 N log2 = e 2 N f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...). dρ f (t) = (1 cost)dt. P f (N) = N! 1 log N e N
28 Persistency-Returning to the toy examples f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. P f (N) = 1 N log2 = e 2 N f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...). dρ f (t) = (1 cost)dt. P f (N) = N! 1 log N e N f (k) = f (0) where g(0) N R (0,1) (r(k)) k = (...,1,1,1,...). ρ f = δ 0.
29 Persistency-Returning to the toy examples f (k) are iid with f (k) N R (0,1) (r(k)) k = e 0 := (...,0,1,0,...). ρ f is the Lebesgue measure. P f (N) = 1 N log2 = e 2 N f (k) = g(k + 1) g(k) where g(k) are iid with g(k) N R (0,1) (r(k)) k = 1/2e 1 + e 0 1/2e 1 := (...,0, 1/2,1, 1/2,0,...). dρ f (t) = (1 cost)dt. P f (N) = N! 1 log N e N f (k) = f (0) where g(0) N R (0,1) (r(k)) k = (...,1,1,1,...). ρ f = δ 0. P f (N) = 1 2
30 Persistence: Progress from recent years Theorem A [Antezana, Buckley, Marzo and Olsen, 12] For the sinc-kernel (dρ f = 11 [ π,π] ) : e cn < P(N) < 2 N
31 Persistence: Progress from recent years Theorem A [Antezana, Buckley, Marzo and Olsen, 12] For the sinc-kernel (dρ f = 11 [ π,π] ) : e cn < P(N) < 2 N Theorem B [Feldheim and Feldheim, 13] Assume that dρ f = φ(x)dx and 0 < δ φ(x) M on some interval [ a,a] then Ae αn P f (N) Be βn N IN.
32 Persistence: Progress from recent years Theorem A [Antezana, Buckley, Marzo and Olsen, 12] For the sinc-kernel (dρ f = 11 [ π,π] ) : e cn < P(N) < 2 N Theorem B [Feldheim and Feldheim, 13] Assume that dρ f = φ(x)dx and 0 < δ φ(x) M on some interval [ a,a] then Ae αn P f (N) Be βn N IN. Theorem D [Dembo and Mukherjee, 15] Roughly speaking: If r(x) is positive and dρ f = φ(x) is unbounded near zero then P f (N) >> e βn.
33 Persistence: Progress from recent years Theorem A [Antezana, Buckley, Marzo and Olsen, 12] For the sinc-kernel (dρ f = 11 [ π,π] ) : e cn < P(N) < 2 N Theorem B [Feldheim and Feldheim, 13] Assume that dρ f = φ(x)dx and 0 < δ φ(x) M on some interval [ a,a] then Ae αn P f (N) Be βn N IN. Theorem D [Dembo and Mukherjee, 15] Roughly speaking: If r(x) is positive and dρ f = φ(x) is unbounded near zero then P f (N) >> e βn. Theorem C [ Krishnapur and Maddaly, 15] Over Z. If ρ f is absolutely continuous (or has a non vanishing absolutely continuous part), then P f (N) Ce γn2 N IN.
34 Our main result over Z a particular case Theorem [Feldheim, Feldheim, N, 2016] Let b,a > 0 and γ > 1. Suppose f is a GSP over Z with spectral measure dρ f = φ f (x)dx. 1. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0
35 Our main result over Z a particular case Theorem [Feldheim, Feldheim, N, 2016] Let b,a > 0 and γ > 1. Suppose f is a GSP over Z with spectral measure dρ f = φ f (x)dx. 1. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0 2. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0
36 Our main result over Z a particular case Theorem [Feldheim, Feldheim, N, 2016] Let b,a > 0 and γ > 1. Suppose f is a GSP over Z with spectral measure dρ f = φ f (x)dx. 1. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0 2. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0 3. If φ f (x) = 0 for almost every x [ a,a], then (C 1 e c1n2 ) P f (N) C 2 e c2n2
37 Our main result over Z a particular case Theorem [Feldheim, Feldheim, N, 2016] Let b,a > 0 and γ > 1. Suppose f is a GSP over Z with spectral measure dρ f = φ f (x)dx. 1. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0 2. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0 3. If φ f (x) = 0 for almost every x [ a,a], then (C 1 e c1n2 ) P f (N) C 2 e c2n2 Remarks: "The same theorem", "Absolute continuity", "Estimates in between".
38 Our main result over R a particular case Theorem [Feldheim, Feldheim, N, 2016] Let b,a > 0 and γ > 1. Suppose f is a GSP over R with spectral measure dρ f = φ f (x)dx. 1. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0
39 Our main result over R a particular case Theorem [Feldheim, Feldheim, N, 2016] Let b,a > 0 and γ > 1. Suppose f is a GSP over R with spectral measure dρ f = φ f (x)dx. 1. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0 2. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 γ > 0
40 Our main result over R a particular case Theorem [Feldheim, Feldheim, N, 2016] Let b,a > 0 and γ > 1. Suppose f is a GSP over R with spectral measure dρ f = φ f (x)dx. 1. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 Ce c(γ)nlogn γ > 0 2. If φ f (x) b x γ for almost every x [ a,a], then Ce cn1+γ logn γ < 0 P f (N) Ce cn γ = 0 γ > 0 3. If the spectral measure vanishes on [ a,a], and on [a, ) it satisfies φ(x) x 100, then P f (N) Ce cecn.
41 Intuition: Spectral perspective Both the covariance and the spectral measure are linear under sums of independent GSPs. Observation If f = f 1 f 2 where f 1, f 2 are independent GSPs, then r = r 1 + r 2, ρ = ρ 1 + ρ 2.
42 Intuition: Spectral perspective Both the covariance and the spectral measure are linear under sums of independent GSPs. Observation If f = f 1 f 2 where f 1, f 2 are independent GSPs, then r = r 1 + r 2, ρ = ρ 1 + ρ 2. A decomposition ρ = ρ 1 + ρ 2 defines f = f 1 f 2 iff ρ 1 0, ρ 2 0 and are both symmetric
43 Intuition: Spectral perspective Both the covariance and the spectral measure are linear under sums of independent GSPs. Observation If f = f 1 f 2 where f 1, f 2 are independent GSPs, then r = r 1 + r 2, ρ = ρ 1 + ρ 2. A decomposition ρ = ρ 1 + ρ 2 defines f = f 1 f 2 iff ρ 1 0, ρ 2 0 and are both symmetric
44 Intuition: Spectral perspective Both the covariance and the spectral measure are linear under sums of independent GSPs. Observation If f = f 1 f 2 where f 1, f 2 are independent GSPs, then r = r 1 + r 2, ρ = ρ 1 + ρ 2. A decomposition ρ = ρ 1 + ρ 2 defines f = f 1 f 2 iff ρ 1 0, ρ 2 0 and are both symmetric
45 Intuition: Spectral perspective
46 Intuition: Spectral perspective
47 Intuition: Spectral perspective Example - Exponential Covariance (Ornstein-Uhlenbeck) r(x) = e x dρ(λ) = 2 λ dλ Covariance Kernel Three Sample Paths Spectral Measure
48 Ideas from the proof.
49 Further discussion: ρ f "small" near zero, over Z Remark: We restrict ourself to the case T =Z and dρ f = φ(x)dx with φ(x) cx 2 on [ a,a].
50 Further discussion: ρ f "small" near zero, over Z Remark: We restrict ourself to the case T =Z and dρ f = φ(x)dx with φ(x) cx 2 on [ a,a]. Theorem [N. Feldheim, O. Feldheim, S. Nitzan] 1. Fix k IN. If dρ f = φ(x)dx with m k := T and E = suppφ, then φ(x)dx x 2k < P f (N) Ce E 16 kn log N N IN. 2. If dρ f = φ(x)dx and φ(x) = 0 on [ a,a] for some a > 0 then: P f (N) Ce αn2 N IN.
51 Further discussion: ρ f "small" near zero, over Z Remark: We restrict ourself to the case T =Z and dρ f = φ(x)dx with φ(x) cx 2 on [ a,a]. Theorem [N. Feldheim, O. Feldheim, S. Nitzan] 1. Fix k IN. If dρ f = φ(x)dx with m k := T and E = suppφ, then φ(x)dx x 2k < P f (N) Ce E 16 kn log N N IN. 2. If dρ f = φ(x)dx and φ(x) = 0 on [ a,a] for some a > 0 then: P f (N) Ce αn2 N IN. The main idea: Under these conditions f has a k-times (discrete) anti-derivative which is also a GSP, but it is hard for a GSP to be monotone on a long interval.
52 A sketch of the proof over Z. Step 1: The GSP f has a k th antiderivative which is also a GSP. For a = {a(n)} n Z denote ( a)(n) = a(n + 1) a(n). We say that a is a discrete antiderivative of a.
53 A sketch of the proof over Z. Step 1: The GSP f has a k th antiderivative which is also a GSP. For a = {a(n)} n Z denote ( a)(n) = a(n + 1) a(n). We say that a is a discrete antiderivative of a. Process integration dρ t 2k If T dρ F = < then a GSP F who s spectral measure satisfies 1 dρ (1 cos t) k f exists and satisfies k F = d f.
54 A sketch of the proof over Z. Step 1: The GSP f has a k th antiderivative which is also a GSP. For a = {a(n)} n Z denote ( a)(n) = a(n + 1) a(n). We say that a is a discrete antiderivative of a. Process integration If dρ < then a GSP F who s spectral measure satisfies T t 2k 1 dρ F = dρ (1 cos t) k f exists and satisfies k F = d f. Note: varf(0) = r F (0) = µ ˆ F (0) = T φ(x)dx x 2k = m k.
55 A sketch of the proof over Z. Step 1: The GSP f has a k th antiderivative which is also a GSP. For a = {a(n)} n Z denote ( a)(n) = a(n + 1) a(n). We say that a is a discrete antiderivative of a. Process integration If dρ < then a GSP F who s spectral measure satisfies T t 2k 1 dρ F = dρ (1 cos t) k f exists and satisfies k F = d f. Note: varf(0) = r F (0) = µ ˆ F (0) = T φ(x)dx x 2k = m k. Step 2: In high probability F, the k th antiderivative of f, is not "too big". (A particular case of) Borell-TIS inequality [Borell, Tsirelson, Ibragimov, Sudakov For a GSP F : P( sup F > L) e [0,N] L2 2varF(0).
56 A sketch of the proof over Z. Step 3: If F is small, there is a large set S on which f is "very very small".
57 A sketch of the proof over Z. Step 3: If F is small, there is a large set S on which f is "very very small". Deterministic Lemma Let F = {F(n)} n Z. If k F 0 on [0,N] then there exists a set S [0,N], S > N 2, such that sup k F sup F ( Ck ) k S [0,N] N
58 A sketch of the proof over Z. Step 3: If F is small, there is a large set S on which f is "very very small". Deterministic Lemma Let F = {F(n)} n Z. If k F 0 on [0,N] then there exists a set S [0,N], S > N 2, such that sup k F sup F ( Ck ) k S [0,N] N Step 4: If f is "very very small" then there are "many" Gaussian "almost i.i.d" which are "very very small". Existence of "almost i.i.d" Example: If dρ f = 11 [ π, π/2] [π/2,π] dt then the random variables f (k) with k 2Z are Gaussian i.i.d.
59 A sketch of the proof over Z. Step 3: If F is small, there is a large set S on which f is "very very small". Deterministic Lemma Let F = {F(n)} n Z. If k F 0 on [0,N] then there exists a set S [0,N], S > N 2, such that sup k F sup F ( Ck ) k S [0,N] N Step 4: If f is "very very small" then there are "many" Gaussian "almost i.i.d" which are "very very small". Existence of "almost i.i.d" Example: If dρ f = 11 [ π, π/2] [π/2,π] dt then the random variables f (k) with k 2Z are Gaussian i.i.d. If ρ f = 11 E E [ π,π] then there exists Λ Z (with positive density) such that the random variables f (k) with k Λ are Gaussian "almost i.i.d". (Restricted Invertibility Theorem by Bourgain-Tzafriri)
60 A sketch of the proof over Z. Step 5: More generally, the GSP f is of the form described in the previous slide + "noise" Recall: spectral decomposition If ρ f = ρ 1 + ρ 2 where ρ 1 and ρ 2 are positive symmetric Borel measures then f = d g + h where. i. g and h are independent processes ii. ρ g = ρ 1 and ρ h = ρ 2.
61 A sketch of the proof over Z. Step 5: More generally, the GSP f is of the form described in the previous slide + "noise" Recall: spectral decomposition If ρ f = ρ 1 + ρ 2 where ρ 1 and ρ 2 are positive symmetric Borel measures then f = d g + h where i. g and h are independent processes ii. ρ g = ρ 1 and ρ h = ρ 2... We take ρ g = ρ 1 = 11 E where E suppρ.
62 A sketch of the proof over Z. Step 5: More generally, the GSP f is of the form described in the previous slide + "noise" Recall: spectral decomposition If ρ f = ρ 1 + ρ 2 where ρ 1 and ρ 2 are positive symmetric Borel measures then f = d g + h where i. g and h are independent processes ii. ρ g = ρ 1 and ρ h = ρ 2... We take ρ g = ρ 1 = 11 E where E suppρ. Anderson s lemma With the notations above: Prob( f (n) < A,n S) Prob( g(n) < A,n S)
63
Persistence of Gaussian stationary processes: a spectral perspective
Persistence of Gaussian stationary processes: a spectral perspective Naomi Feldheim Ohad Feldheim Shahaf Nitzan Abstract We study the persistence probability of a centered stationary Gaussian process on
More informationSuperconcentration inequalities for centered Gaussian stationnary processes
Superconcentration inequalities for centered Gaussian stationnary processes Kevin Tanguy Toulouse University June 21, 2016 1 / 22 Outline What is superconcentration? Convergence of extremes (Gaussian case).
More informationPERSISTENCE PROBABILITIES IN CENTERED, STATIONARY, GAUSSIAN PROCESSES IN DISCRETE TIME
PERSISTENCE PROBABILITIES IN CENTERED, STATIONARY, GAUSSIAN PROCESSES IN DISCRETE TIME KRISHNA M. AND MANJUNATH KRISHNAPUR. THE PROBLEM AND OUR RESULTS Let X = X m ) m Z d be a centered, stationary Gaussian
More informationAsymptotics of minimax stochastic programs
Asymptotics of minimax stochastic programs Alexander Shapiro Abstract. We discuss in this paper asymptotics of the sample average approximation (SAA) of the optimal value of a minimax stochastic programming
More informationGaussian Random Field: simulation and quantification of the error
Gaussian Random Field: simulation and quantification of the error EMSE Workshop 6 November 2017 3 2 1 0-1 -2-3 80 60 40 1 Continuity Separability Proving continuity without separability 2 The stationary
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 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 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 informationMeasures on spaces of Riemannian metrics CMS meeting December 6, 2015
Measures on spaces of Riemannian metrics CMS meeting December 6, 2015 D. Jakobson (McGill), jakobson@math.mcgill.ca [CJW]: Y. Canzani, I. Wigman, DJ: arxiv:1002.0030, Jour. of Geometric Analysis, 2013
More informationModeling and testing long memory in random fields
Modeling and testing long memory in random fields Frédéric Lavancier lavancier@math.univ-lille1.fr Université Lille 1 LS-CREST Paris 24 janvier 6 1 Introduction Long memory random fields Motivations Previous
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
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 informationConditional Full Support for Gaussian Processes with Stationary Increments
Conditional Full Support for Gaussian Processes with Stationary Increments Tommi Sottinen University of Vaasa Kyiv, September 9, 2010 International Conference Modern Stochastics: Theory and Applications
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 informationGaussian Processes. 1. Basic Notions
Gaussian Processes 1. Basic Notions Let T be a set, and X : {X } T a stochastic process, defined on a suitable probability space (Ω P), that is indexed by T. Definition 1.1. We say that X is a Gaussian
More informationBrownian 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 informationRandom Process Lecture 1. Fundamentals of Probability
Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus
More informationKolmogorov Berry-Esseen bounds for binomial functionals
Kolmogorov Berry-Esseen bounds for binomial functionals Raphaël Lachièze-Rey, Univ. South California, Univ. Paris 5 René Descartes, Joint work with Giovanni Peccati, University of Luxembourg, Singapore
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 informationON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA
ON THE BOUNDEDNESS BEHAVIOR OF THE SPECTRAL FACTORIZATION IN THE WIENER ALGEBRA FOR FIR DATA Holger Boche and Volker Pohl Technische Universität Berlin, Heinrich Hertz Chair for Mobile Communications Werner-von-Siemens
More informationare Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication
7. Banach algebras Definition 7.1. A is called a Banach algebra (with unit) if: (1) A is a Banach space; (2) There is a multiplication A A A that has the following properties: (xy)z = x(yz), (x + y)z =
More informationBrownian Motion and Conditional Probability
Math 561: Theory of Probability (Spring 2018) Week 10 Brownian Motion and Conditional Probability 10.1 Standard Brownian Motion (SBM) Brownian motion is a stochastic process with both practical and theoretical
More informationTransformation of Probability Densities
Transformation of Probability Densities This Wikibook shows how to transform the probability density of a continuous random variable in both the one-dimensional and multidimensional case. In other words,
More informationTopics in Harmonic Analysis Lecture 1: The Fourier transform
Topics in Harmonic Analysis Lecture 1: The Fourier transform Po-Lam Yung The Chinese University of Hong Kong Outline Fourier series on T: L 2 theory Convolutions The Dirichlet and Fejer kernels Pointwise
More informationEntanglement Dynamics for the Quantum Disordered XY Chain
Entanglement Dynamics for the Quantum Disordered XY Chain Houssam Abdul-Rahman Joint with: B. Nachtergaele, R. Sims, G. Stolz AMS Southeastern Sectional Meeting University of Georgia March 6, 2016 Houssam
More informationDensities for the Navier Stokes equations with noise
Densities for the Navier Stokes equations with noise Marco Romito Università di Pisa Universitat de Barcelona March 25, 2015 Summary 1 Introduction & motivations 2 Malliavin calculus 3 Besov bounds 4 Other
More informationMeasurable functions are approximately nice, even if look terrible.
Tel Aviv University, 2015 Functions of real variables 74 7 Approximation 7a A terrible integrable function........... 74 7b Approximation of sets................ 76 7c Approximation of functions............
More informationNash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators. ( Wroclaw 2006) P.Maheux (Orléans. France)
Nash Type Inequalities for Fractional Powers of Non-Negative Self-adjoint Operators ( Wroclaw 006) P.Maheux (Orléans. France) joint work with A.Bendikov. European Network (HARP) (to appear in T.A.M.S)
More informationReal Analysis Chapter 3 Solutions Jonathan Conder. ν(f n ) = lim
. Suppose ( n ) n is an increasing sequence in M. For each n N define F n : n \ n (with 0 : ). Clearly ν( n n ) ν( nf n ) ν(f n ) lim n If ( n ) n is a decreasing sequence in M and ν( )
More informationExam 3 Solutions. Multiple Choice Questions
MA 4 Exam 3 Solutions Fall 26 Exam 3 Solutions Multiple Choice Questions. The average value of the function f (x) = x + sin(x) on the interval [, 2π] is: A. 2π 2 2π B. π 2π 2 + 2π 4π 2 2π 4π 2 + 2π 2.
More informationGaussian Random Fields: Excursion Probabilities
Gaussian Random Fields: Excursion Probabilities Yimin Xiao Michigan State University Lecture 5 Excursion Probabilities 1 Some classical results on excursion probabilities A large deviation result Upper
More informationRANDOM FIELDS AND GEOMETRY. Robert Adler and Jonathan Taylor
RANDOM FIELDS AND GEOMETRY from the book of the same name by Robert Adler and Jonathan Taylor IE&M, Technion, Israel, Statistics, Stanford, US. ie.technion.ac.il/adler.phtml www-stat.stanford.edu/ jtaylor
More informationR. Lachieze-Rey Recent Berry-Esseen bounds obtained with Stein s method andgeorgia PoincareTech. inequalities, 1 / with 29 G.
Recent Berry-Esseen bounds obtained with Stein s method and Poincare inequalities, with Geometric applications Raphaël Lachièze-Rey, Univ. Paris 5 René Descartes, Georgia Tech. R. Lachieze-Rey Recent Berry-Esseen
More informationReal roots of random polynomials and zero crossing properties of diffusion equation
Real roots of random polynomials and zero crossing properties of diffusion equation Grégory Schehr Laboratoire de Physique Théorique et Modèles Statistiques Orsay, Université Paris XI G. S., S. N. Majumdar,
More informationRandom Bernstein-Markov factors
Random Bernstein-Markov factors Igor Pritsker and Koushik Ramachandran October 20, 208 Abstract For a polynomial P n of degree n, Bernstein s inequality states that P n n P n for all L p norms on the unit
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 informationarxiv: v1 [math.ca] 31 Dec 2018
arxiv:181.1173v1 [math.ca] 31 Dec 18 Some trigonometric integrals and the Fourier transform of a spherically symmetric exponential function Hideshi YAMANE Department of Mathematical Sciences, Kwansei Gakuin
More informationELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process
Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Definition of stochastic process (random
More informationf (x) = k=0 f (0) = k=0 k=0 a k k(0) k 1 = a 1 a 1 = f (0). a k k(k 1)x k 2, k=2 a k k(k 1)(0) k 2 = 2a 2 a 2 = f (0) 2 a k k(k 1)(k 2)x k 3, k=3
1 M 13-Lecture Contents: 1) Taylor Polynomials 2) Taylor Series Centered at x a 3) Applications of Taylor Polynomials Taylor Series The previous section served as motivation and gave some useful expansion.
More informationTopics in fractional Brownian motion
Topics in fractional Brownian motion Esko Valkeila Spring School, Jena 25.3. 2011 We plan to discuss the following items during these lectures: Fractional Brownian motion and its properties. Topics in
More informationNonlinear time series
Based on the book by Fan/Yao: Nonlinear Time Series Robert M. Kunst robert.kunst@univie.ac.at University of Vienna and Institute for Advanced Studies Vienna October 27, 2009 Outline Characteristics of
More informationProbability and Measure
Chapter 4 Probability and Measure 4.1 Introduction In this chapter we will examine probability theory from the measure theoretic perspective. The realisation that measure theory is the foundation of probability
More informationLower Tail Probabilities and Normal Comparison Inequalities. In Memory of Wenbo V. Li s Contributions
Lower Tail Probabilities and Normal Comparison Inequalities In Memory of Wenbo V. Li s Contributions Qi-Man Shao The Chinese University of Hong Kong Lower Tail Probabilities and Normal Comparison Inequalities
More informationRandom polynomials having few or no real zeros
Random polynomials having few or no real zeros Amir Dembo Bjorn Poonen Qi-Man Shao Ofer Zeitouni May 29, 2000 Abstract Consider a polynomial of large degree n whose coefficients are independent, identically
More informationKarhunen-Loève decomposition of Gaussian measures on Banach spaces
Karhunen-Loève decomposition of Gaussian measures on Banach spaces Jean-Charles Croix GT APSSE - April 2017, the 13th joint work with Xavier Bay. 1 / 29 Sommaire 1 Preliminaries on Gaussian processes 2
More informationSF2943: TIME SERIES ANALYSIS COMMENTS ON SPECTRAL DENSITIES
SF2943: TIME SERIES ANALYSIS COMMENTS ON SPECTRAL DENSITIES This document is meant as a complement to Chapter 4 in the textbook, the aim being to get a basic understanding of spectral densities through
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 informationDependence. MFM Practitioner Module: Risk & Asset Allocation. John Dodson. September 11, Dependence. John Dodson. Outline.
MFM Practitioner Module: Risk & Asset Allocation September 11, 2013 Before we define dependence, it is useful to define Random variables X and Y are independent iff For all x, y. In particular, F (X,Y
More informationExercises in stochastic analysis
Exercises in stochastic analysis Franco Flandoli, Mario Maurelli, Dario Trevisan The exercises with a P are those which have been done totally or partially) in the previous lectures; the exercises with
More information21 Gaussian spaces and processes
Tel Aviv University, 2010 Gaussian measures : infinite dimension 1 21 Gaussian spaces and processes 21a Gaussian spaces: finite dimension......... 1 21b Toward Gaussian random processes....... 2 21c Random
More informationSimulation of stationary fractional Ornstein-Uhlenbeck process and application to turbulence
Simulation of stationary fractional Ornstein-Uhlenbeck process and application to turbulence Georg Schoechtel TU Darmstadt, IRTG 1529 Japanese-German International Workshop on Mathematical Fluid Dynamics,
More informationOptimal global rates of convergence for interpolation problems with random design
Optimal global rates of convergence for interpolation problems with random design Michael Kohler 1 and Adam Krzyżak 2, 1 Fachbereich Mathematik, Technische Universität Darmstadt, Schlossgartenstr. 7, 64289
More informationarxiv: v2 [math.oc] 30 Sep 2015
Symmetry, Integrability and Geometry: Methods and Applications Moments and Legendre Fourier Series for Measures Supported on Curves Jean B. LASSERRE SIGMA 11 (215), 77, 1 pages arxiv:158.6884v2 [math.oc]
More informationIII. Quantum ergodicity on graphs, perspectives
III. Quantum ergodicity on graphs, perspectives Nalini Anantharaman Université de Strasbourg 24 août 2016 Yesterday we focussed on the case of large regular (discrete) graphs. Let G = (V, E) be a (q +
More informationThe Choice of Representative Volumes for Random Materials
The Choice of Representative Volumes for Random Materials Julian Fischer IST Austria 13.4.2018 Effective properties of random materials Material with random microstructure Effective large-scale description?
More informationODE Final exam - Solutions
ODE Final exam - Solutions May 3, 018 1 Computational questions (30 For all the following ODE s with given initial condition, find the expression of the solution as a function of the time variable t You
More informationPart II Probability and Measure
Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationContinued Fraction Digit Averages and Maclaurin s Inequalities
Continued Fraction Digit Averages and Maclaurin s Inequalities Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu Joint with Francesco Cellarosi, Doug Hensley and Jake
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 informationNotes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed
18.466 Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 1. MLEs in exponential families Let f(x,θ) for x X and θ Θ be a likelihood function, that is, for present purposes,
More informationMultiple Random Variables
Multiple Random Variables Joint Probability Density Let X and Y be two random variables. Their joint distribution function is F ( XY x, y) P X x Y y. F XY ( ) 1, < x
More information9 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 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 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 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 informationSTA 256: Statistics and Probability I
Al Nosedal. University of Toronto. Fall 2017 My momma always said: Life was like a box of chocolates. You never know what you re gonna get. Forrest Gump. There are situations where one might be interested
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 information215 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that
15 Problem 1. (a) Define the total variation distance µ ν tv for probability distributions µ, ν on a finite set S. Show that µ ν tv = (1/) x S µ(x) ν(x) = x S(µ(x) ν(x)) + where a + = max(a, 0). Show that
More informationLAN property for ergodic jump-diffusion processes with discrete observations
LAN property for ergodic jump-diffusion processes with discrete observations Eulalia Nualart (Universitat Pompeu Fabra, Barcelona) joint work with Arturo Kohatsu-Higa (Ritsumeikan University, Japan) &
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More informationp 1 ( Y p dp) 1/p ( X p dp) 1 1 p
Doob s inequality Let X(t) be a right continuous submartingale with respect to F(t), t 1 P(sup s t X(s) λ) 1 λ {sup s t X(s) λ} X + (t)dp 2 For 1 < p
More informationA Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback
A Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback Vincent Y. F. Tan (NUS) Joint work with Silas L. Fong (Toronto) 2017 Information Theory Workshop, Kaohsiung,
More informationApproximately Gaussian marginals and the hyperplane conjecture
Approximately Gaussian marginals and the hyperplane conjecture Tel-Aviv University Conference on Asymptotic Geometric Analysis, Euler Institute, St. Petersburg, July 2010 Lecture based on a joint work
More informationComputer Vision Group Prof. Daniel Cremers. 9. Gaussian Processes - Regression
Group Prof. Daniel Cremers 9. Gaussian Processes - Regression Repetition: Regularized Regression Before, we solved for w using the pseudoinverse. But: we can kernelize this problem as well! First step:
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More information1 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 informationUniversity of Toronto Department of Statistics
Norm Comparisons for Data Augmentation by James P. Hobert Department of Statistics University of Florida and Jeffrey S. Rosenthal Department of Statistics University of Toronto Technical Report No. 0704
More informationExponential tail inequalities for eigenvalues of random matrices
Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify
More informationExamples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.
s of the Fourier Theorem (Sect. 1.3. The Fourier Theorem: Continuous case. : Using the Fourier Theorem. The Fourier Theorem: Piecewise continuous case. : Using the Fourier Theorem. The Fourier Theorem:
More informationMax stable Processes & Random Fields: Representations, Models, and Prediction
Max stable Processes & Random Fields: Representations, Models, and Prediction Stilian Stoev University of Michigan, Ann Arbor March 2, 2011 Based on joint works with Yizao Wang and Murad S. Taqqu. 1 Preliminaries
More informationThe Gaussian free field, Gibbs measures and NLS on planar domains
The Gaussian free field, Gibbs measures and on planar domains N. Burq, joint with L. Thomann (Nantes) and N. Tzvetkov (Cergy) Université Paris Sud, Laboratoire de Mathématiques d Orsay, CNRS UMR 8628 LAGA,
More information6.0 INTRODUCTION TO DIFFERENTIAL EQUATIONS
6.0 Introduction to Differential Equations Contemporary Calculus 1 6.0 INTRODUCTION TO DIFFERENTIAL EQUATIONS This chapter is an introduction to differential equations, a major field in applied and theoretical
More information4 Uniform convergence
4 Uniform convergence In the last few sections we have seen several functions which have been defined via series or integrals. We now want to develop tools that will allow us to show that these functions
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 informationViscosity Solutions for Dummies (including Economists)
Viscosity Solutions for Dummies (including Economists) Online Appendix to Income and Wealth Distribution in Macroeconomics: A Continuous-Time Approach written by Benjamin Moll August 13, 2017 1 Viscosity
More informationModel Specification Testing in Nonparametric and Semiparametric Time Series Econometrics. Jiti Gao
Model Specification Testing in Nonparametric and Semiparametric Time Series Econometrics Jiti Gao Department of Statistics School of Mathematics and Statistics The University of Western Australia Crawley
More informationPROBABILITY: 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 informationLECTURE 10 LINEAR PROCESSES II: SPECTRAL DENSITY, LAG OPERATOR, ARMA. In this lecture, we continue to discuss covariance stationary processes.
MAY, 0 LECTURE 0 LINEAR PROCESSES II: SPECTRAL DENSITY, LAG OPERATOR, ARMA In this lecture, we continue to discuss covariance stationary processes. Spectral density Gourieroux and Monfort 990), Ch. 5;
More informationMean-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 informationENSC327 Communications Systems 19: Random Processes. Jie Liang School of Engineering Science Simon Fraser University
ENSC327 Communications Systems 19: Random Processes Jie Liang School of Engineering Science Simon Fraser University 1 Outline Random processes Stationary random processes Autocorrelation of random processes
More informationAsymptotic results for empirical measures of weighted sums of independent random variables
Asymptotic results for empirical measures of weighted sums of independent random variables B. Bercu and W. Bryc University Bordeaux 1, France Seminario di Probabilità e Statistica Matematica Sapienza Università
More informationProduct measure and Fubini s theorem
Chapter 7 Product measure and Fubini s theorem This is based on [Billingsley, Section 18]. 1. Product spaces Suppose (Ω 1, F 1 ) and (Ω 2, F 2 ) are two probability spaces. In a product space Ω = Ω 1 Ω
More informationI forgot to mention last time: in the Ito formula for two standard processes, putting
I forgot to mention last time: in the Ito formula for two standard processes, putting dx t = a t dt + b t db t dy t = α t dt + β t db t, and taking f(x, y = xy, one has f x = y, f y = x, and f xx = f yy
More informationNonparametric estimation using wavelet methods. Dominique Picard. Laboratoire Probabilités et Modèles Aléatoires Université Paris VII
Nonparametric estimation using wavelet methods Dominique Picard Laboratoire Probabilités et Modèles Aléatoires Université Paris VII http ://www.proba.jussieu.fr/mathdoc/preprints/index.html 1 Nonparametric
More informationConvergence to equilibrium of Markov processes (eventually piecewise deterministic)
Convergence to equilibrium of Markov processes (eventually piecewise deterministic) A. Guillin Université Blaise Pascal and IUF Rennes joint works with D. Bakry, F. Barthe, F. Bolley, P. Cattiaux, R. Douc,
More informationGAUSSIAN PROCESSES GROWTH RATE OF CERTAIN. successfully employed in dealing with certain Gaussian processes not possessing
1. Introduction GROWTH RATE OF CERTAIN GAUSSIAN PROCESSES STEVEN OREY UNIVERSITY OF MINNESOTA We will be concerned with real, continuous Gaussian processes. In (A) of Theorem 1.1, a result on the growth
More informationSTAT 7032 Probability Spring Wlodek Bryc
STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,
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 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 informationPerhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows.
Chapter 5 Two Random Variables In a practical engineering problem, there is almost always causal relationship between different events. Some relationships are determined by physical laws, e.g., voltage
More information