Rice method for the maximum of Gaussian fields

Size: px
Start display at page:

Download "Rice method for the maximum of Gaussian fields"

Transcription

1 Rice method for the maximum of Gaussian fields IWAP, July 8, 2010 Jean-Marc AZAÏS Institut de Mathématiques, Université de Toulouse Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 1 / 24

2 Examples 1 Examples 2 3 Second order Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 2 / 24

3 Examples Signal + noise model Spatial Statistics often uses signal + noise model, for example : precision agriculture neuro-sciences sea-waves modelling Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 3 / 24

4 Examples Signal + noise model Spatial Statistics often uses signal + noise model, for example : precision agriculture neuro-sciences sea-waves modelling Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 3 / 24

5 Examples Signal + noise model Spatial Statistics often uses signal + noise model, for example : precision agriculture neuro-sciences sea-waves modelling Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 3 / 24

6 Examples Precision agriculture Representation of the yield per unit by GPS harvester. Is there only noise or some region with higher fertility?? Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 4 / 24

7 Examples Neuroscience The activity of the brain is recorded under some particular action and the same question is asked source : Maureen CLERC Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 5 / 24

8 Examples Sea-waves spectrum Locally in time and frequency the spectrum of waves is registered. We want to localize transition periods. Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 6 / 24

9 Examples In all these situations a good statistics consists in observing the maximum of the (absolute value) of the random field for deciding if it is typically (Noise) or too large (signal). Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 7 / 24

10 Examples The Rice method M is the maximum of a smooth random process X(t), t R d (d = 1) or field (d > 1). We want to evaluate P{M > u} In dimension 1 : count the number of up-crossing In larger dimension search for an other geometrical characteristic number of connected component of the excursion set :open problem Euler characteristic an alternative to the preceding : Conceptually complicated, computationally easy Number of maxima above the considered level : difficult to compute the determinant but gives bounds Particular points on the level set : the record method Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 8 / 24

11 Examples The Rice method M is the maximum of a smooth random process X(t), t R d (d = 1) or field (d > 1). We want to evaluate P{M > u} In dimension 1 : count the number of up-crossing In larger dimension search for an other geometrical characteristic number of connected component of the excursion set :open problem Euler characteristic an alternative to the preceding : Conceptually complicated, computationally easy Number of maxima above the considered level : difficult to compute the determinant but gives bounds Particular points on the level set : the record method Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 8 / 24

12 Examples The Rice method M is the maximum of a smooth random process X(t), t R d (d = 1) or field (d > 1). We want to evaluate P{M > u} In dimension 1 : count the number of up-crossing In larger dimension search for an other geometrical characteristic number of connected component of the excursion set :open problem Euler characteristic an alternative to the preceding : Conceptually complicated, computationally easy Number of maxima above the considered level : difficult to compute the determinant but gives bounds Particular points on the level set : the record method Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 8 / 24

13 Examples The Rice method M is the maximum of a smooth random process X(t), t R d (d = 1) or field (d > 1). We want to evaluate P{M > u} In dimension 1 : count the number of up-crossing In larger dimension search for an other geometrical characteristic number of connected component of the excursion set :open problem Euler characteristic an alternative to the preceding : Conceptually complicated, computationally easy Number of maxima above the considered level : difficult to compute the determinant but gives bounds Particular points on the level set : the record method Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 8 / 24

14 Examples The Rice method M is the maximum of a smooth random process X(t), t R d (d = 1) or field (d > 1). We want to evaluate P{M > u} In dimension 1 : count the number of up-crossing In larger dimension search for an other geometrical characteristic number of connected component of the excursion set :open problem Euler characteristic an alternative to the preceding : Conceptually complicated, computationally easy Number of maxima above the considered level : difficult to compute the determinant but gives bounds Particular points on the level set : the record method Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 8 / 24

15 Examples The Rice method M is the maximum of a smooth random process X(t), t R d (d = 1) or field (d > 1). We want to evaluate P{M > u} In dimension 1 : count the number of up-crossing In larger dimension search for an other geometrical characteristic number of connected component of the excursion set :open problem Euler characteristic an alternative to the preceding : Conceptually complicated, computationally easy Number of maxima above the considered level : difficult to compute the determinant but gives bounds Particular points on the level set : the record method Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 8 / 24

16 Examples Let us forget boundaries {M > u} = There is a maximum above u =: {M u > 0} P{M > u} E(M u ) + = dx E [ det(x (t)) 1I X (t) 0 X(t) = x, X (t) = 0 ] P X(t),X (t)(x, 0)dt u S Very difficult to compute the expectation of the determinant Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 9 / 24

17 1 Examples 2 3 Second order Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 10 / 24

18 Under some conditions, Roughly speaking the event is almost equal to the events {M > u} The level curve at level u is non-empty The point at the southern extremity of the level curve exists There exists a point on the level curve : X(t) = u; X 1 X (t) = t 1 = 0; X 2 X (t) = t 2 > 0 X 11 (t) = 2 X < 0 t1 2 Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 11 / 24

19 Forget the boundary and define Z(t) := ( X(t) X 1 (t) ) The probability above is bounded by the expectation of the number of roots of Z(t) (u, 0) Rice formula P{M > u} Boundary terms + E( det(z (t) 1I X 1 (t)<0 1I X 2 (t)>0 X(t) = u, X 1(t) = 0)p X(t),X 1 (t)(u, 0)dt, S The difficulty lies in the computation of the expectation of the determinant Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 12 / 24

20 The key point is that under the condition {X(t) = u, X 1 (t)} = 0, the quantity det(z (t) = X 1 X 2 X 11 X 12 is simply equal to X 2 X 11. Taking into account conditions, we get the following expression for the second integral + E( X 11(t) X 2(t) + X(t) = u, X 1 (t) = 0)p X(t),X 1 (t)(u, 0)dt. S Moreover under stationarity or some more general hypotheses, these two random variables are independent. Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 13 / 24

21 Extension to dimension 3 Using Fourier method (Li and Wei 2009) we are able to compute the expectation of the absolute value of a determinant in dimension 2. It is a simple quadratic form. We are able to extend the result to dimension 3 (Pham 2010). Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 14 / 24

22 1 Examples 2 3 Second order Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 15 / 24

23 Consider a realization with M > u, then necessarily there exist a local maxima or a border maxima above U Border maxima : local maxima in relative topology If the consider sets that are union of manifolds of dimension 1 to d of this kind Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 16 / 24

24 In fact result are simpler (and stronger) in term of the density p M (x) of the maximum. Bound for the distribution are obtained by integration. Theorem p M (x) p M (x) := 1 2 [p M (x) + pec M (x)]with p M (x) := E ( det(x (t)) /X(t) = x, X (t) = 0 ) p X(t),X j (t)(x, 0)dt+boundary term and p EC M (x) := ( 1) d S S E ( det(x (t))/x(t) = x, X (t) = 0 ) p X(t),X j (t)(x, 0)dt+boundary Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 17 / 24

25 Quantity p EC M (x) is easy to compute using the work by Adler and properties of symmetry of the order 4 tensor of variance of X ( under the conditional distribution) ) Lemma E ( det(x (t))/x(t) = x, X (t) = 0 ) = det(λ)h d (x) where H d (x) is the dth Hermite polynomial and Λ := Var(X (t)) main advantage of Euler characteristic method lies in this result. Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 18 / 24

26 computation of p m The key point is the following If X is stationary and isotropic with covariance ρ( t 2 ) normalized by Var(X(t)) = 1 et Var(X (t)) = Id Then under the condition X(t) = x, X (t) = 0 X (t) = 8ρ G + ξ ρ ρ 2 Id + xid Where G is a GOE matrix (Gaussian Orthogonal Ensemble), and ξ a standard normal independent variable. We use recent result on the the characteristic polynomials of the GOE. Fyodorov(2004) Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 19 / 24

27 Theorem Assume that the random field X is centered, Gaussian, stationary and isotrpic and is regular Let S have polyhedral shape. Then, d 0 [( ρ ) j/2hj p(x) = ϕ(x) σ 0 (t) + (x) + R j (x) ] g j π t S 0 j=1 (1) g j = S j θj (t)σ j (dt), σ j (t) is the normalized solid angle of the cone of the extended outward directions at t in the normal space with the convention σ d (t) = 1. For convex or other usual polyhedra σ j (t) is constant for t S j, H j is the j th(probabilistic) Hermite polynomial. Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 20 / 24

28 Theorem (continued) R j (x) = ( ) 2ρ j Γ((j+1)/2 + 2 π ( π ρ Tj(v) exp y2 2 v := (2) 1/2( (1 γ 2 ) 1/2 y γx ) with γ := ρ (ρ ) 1/2, (2) T j (v) := [ j 1 k=0 ) dy Hk 2(v) ] 2 k e v2 /2 H j(v) k! 2 j (j 1)! I j 1(v), (3) [ n 1 2 ] I n (v) = 2e v2 /2 k=0 2 k (n 1)!! (n 1 2k)!! H n 1 2k(v) (4) + 1I {n even} 2 n 2 (n 1)!! 2π(1 Φ(x)) Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 21 / 24

29 Second order Second order study Using an exact implicit formula Theorem Under conditions above + Var(X(t)) 1 Then lim x + 2 x 2 log [ p M (x) p M (x) ] 1 + inf t S σ 2 t := Var ( X(s) X(t), X (t) ) sup s S\{t} (1 r(s, t)) 2 and κ t is some geometrical characteristic et Λ t = GEV(Λ(t)) The right hand side is finite and > 1 1 σ 2 t + λ(t)κ 2 t Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 22 / 24

30 References Adler R.J. and Taylor J. E. Random fields and geometry. Springer. Azaïs,J-M. and Wschebor M. Level set and extrema of random processes and fields, Wiley (2009). Mercadier, C. (2006), Numerical Bounds for the Distribution of the Maximum of Some One- and Two-Parameter Gaussian Processes, Adv. in Appl. Probab. 38, pp Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 23 / 24

31 References THANK-YOU GRACIAS Jean-Marc AZAÏS ( Institut de Mathématiques, Université de Toulouse ) 24 / 24

Gaussian Random Fields: Excursion Probabilities

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

Evgeny Spodarev WIAS, Berlin. Limit theorems for excursion sets of stationary random fields

Evgeny Spodarev WIAS, Berlin. Limit theorems for excursion sets of stationary random fields Evgeny Spodarev 23.01.2013 WIAS, Berlin Limit theorems for excursion sets of stationary random fields page 2 LT for excursion sets of stationary random fields Overview 23.01.2013 Overview Motivation Excursion

More information

Random Processes Why we Care

Random Processes Why we Care Random Processes Why we Care I Random processes describe signals that change randomly over time. I Compare: deterministic signals can be described by a mathematical expression that describes the signal

More information

RANDOM FIELDS AND GEOMETRY. Robert Adler and Jonathan Taylor

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

THE EXCURSION PROBABILITY OF GAUSSIAN AND ASYMPTOTICALLY GAUSSIAN RANDOM FIELDS. Dan Cheng

THE EXCURSION PROBABILITY OF GAUSSIAN AND ASYMPTOTICALLY GAUSSIAN RANDOM FIELDS. Dan Cheng THE EXCURSION PROBABILITY OF GAUSSIAN AND ASYMPTOTICALLY GAUSSIAN RANDOM FIELDS By Dan Cheng A DISSERTATION Submitted to Michigan State University in partial fulfillment of the requirements for the degree

More information

A test for a conjunction

A test for a conjunction A test for a conjunction K.J. Worsley a,, K.J. Friston b a Department of Mathematics and Statistics, McGill University, Montreal, Canada H3A 2K6 b Wellcome Department of Cognitive Neurology, Institute

More information

On the roots of a random system of equations. The theorem of Shub & Smale and some extensions.

On the roots of a random system of equations. The theorem of Shub & Smale and some extensions. On the roots of a random system of equations. The theorem of Shub & Smale and some extensions. Jean-Marc Azaïs, azais@cict.fr Mario Wschebor, wschebor@cmat.edu.uy August 2, 24 Abstract We give a new proof

More information

Functional Central Limit Theorem for the Measure of Level Sets Generated by a Gaussian Random Field

Functional Central Limit Theorem for the Measure of Level Sets Generated by a Gaussian Random Field Functional Central Limit Theorem for the Measure of Level Sets Generated by a Gaussian Random Field Daniel Meschenmoser Institute of Stochastics Ulm University 89069 Ulm Germany daniel.meschenmoser@uni-ulm.de

More information

Properties of the Autocorrelation Function

Properties of the Autocorrelation Function Properties of the Autocorrelation Function I The autocorrelation function of a (real-valued) random process satisfies the following properties: 1. R X (t, t) 0 2. R X (t, u) =R X (u, t) (symmetry) 3. R

More information

Central limit theorem for specular points

Central limit theorem for specular points Colloquium IFUM Dec 2009 IMT,ESP,University of Toulouse joint work with Mario Wschebor and Jose Léon 1 2 3 4 Specular points Jean-Marc Azaı s Specular points Jean-Marc Azaı s Specular points The cylindric

More information

Random Fields and Random Geometry. I: Gaussian fields and Kac-Rice formulae

Random Fields and Random Geometry. I: Gaussian fields and Kac-Rice formulae Random Fields and Random Geometry. I: Gaussian fields and Kac-Rice formulae Robert Adler Electrical Engineering Technion Israel Institute of Technology. and many, many others October 25, 2011 I do not

More information

Topics in Stochastic Geometry. Lecture 4 The Boolean model

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

More information

Econometría 2: Análisis de series de Tiempo

Econometría 2: Análisis de series de Tiempo Econometría 2: Análisis de series de Tiempo Karoll GOMEZ kgomezp@unal.edu.co http://karollgomez.wordpress.com Segundo semestre 2016 II. Basic definitions A time series is a set of observations X t, each

More information

Time Series 2. Robert Almgren. Sept. 21, 2009

Time Series 2. Robert Almgren. Sept. 21, 2009 Time Series 2 Robert Almgren Sept. 21, 2009 This week we will talk about linear time series models: AR, MA, ARMA, ARIMA, etc. First we will talk about theory and after we will talk about fitting the models

More information

STAT/MATH 395 A - PROBABILITY II UW Winter Quarter Moment functions. x r p X (x) (1) E[X r ] = x r f X (x) dx (2) (x E[X]) r p X (x) (3)

STAT/MATH 395 A - PROBABILITY II UW Winter Quarter Moment functions. x r p X (x) (1) E[X r ] = x r f X (x) dx (2) (x E[X]) r p X (x) (3) STAT/MATH 395 A - PROBABILITY II UW Winter Quarter 07 Néhémy Lim Moment functions Moments of a random variable Definition.. Let X be a rrv on probability space (Ω, A, P). For a given r N, E[X r ], if it

More information

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process

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

Stochastic Processes: I. consider bowl of worms model for oscilloscope experiment:

Stochastic Processes: I. consider bowl of worms model for oscilloscope experiment: Stochastic Processes: I consider bowl of worms model for oscilloscope experiment: SAPAscope 2.0 / 0 1 RESET SAPA2e 22, 23 II 1 stochastic process is: Stochastic Processes: II informally: bowl + drawing

More information

On the Goodness-of-Fit Tests for Some Continuous Time Processes

On the Goodness-of-Fit Tests for Some Continuous Time Processes On the Goodness-of-Fit Tests for Some Continuous Time Processes Sergueï Dachian and Yury A. Kutoyants Laboratoire de Mathématiques, Université Blaise Pascal Laboratoire de Statistique et Processus, Université

More information

Bernardo D Auria Stochastic Processes /10. Notes. Abril 13 th, 2010

Bernardo D Auria Stochastic Processes /10. Notes. Abril 13 th, 2010 1 Stochastic Calculus Notes Abril 13 th, 1 As we have seen in previous lessons, the stochastic integral with respect to the Brownian motion shows a behavior different from the classical Riemann-Stieltjes

More information

STOCHASTIC GEOMETRY BIOIMAGING

STOCHASTIC GEOMETRY BIOIMAGING CENTRE FOR STOCHASTIC GEOMETRY AND ADVANCED BIOIMAGING 2018 www.csgb.dk RESEARCH REPORT Anders Rønn-Nielsen and Eva B. Vedel Jensen Central limit theorem for mean and variogram estimators in Lévy based

More information

1. Stochastic Processes and filtrations

1. Stochastic Processes and filtrations 1. Stochastic Processes and 1. Stoch. pr., A stochastic process (X t ) t T is a collection of random variables on (Ω, F) with values in a measurable space (S, S), i.e., for all t, In our case X t : Ω S

More information

Exponential tail inequalities for eigenvalues of random matrices

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

2015 School Year. Graduate School Entrance Examination Problem Booklet. Mathematics

2015 School Year. Graduate School Entrance Examination Problem Booklet. Mathematics 2015 School Year Graduate School Entrance Examination Problem Booklet Mathematics Examination Time: 10:00 to 12:30 Instructions 1. Do not open this problem booklet until the start of the examination is

More information

UPPER AND LOWER BOUNDS FOR THE TAILS OF THE DISTRIBUTION OF THE CONDITION NUMBER OF A GAUSSIAN MATRIX

UPPER AND LOWER BOUNDS FOR THE TAILS OF THE DISTRIBUTION OF THE CONDITION NUMBER OF A GAUSSIAN MATRIX UPPER AND LOWER BOUNDS FOR THE TAILS OF THE DISTRIBUTION OF THE CONDITION NUMBER OF A GAUSSIAN MATRIX JEAN-MARC AZAïS AND MARIO WSCHEBOR Abstract. Let A be an m m real random matrix with i.i.d. standard

More information

Polynomial Chaos and Karhunen-Loeve Expansion

Polynomial Chaos and Karhunen-Loeve Expansion Polynomial Chaos and Karhunen-Loeve Expansion 1) Random Variables Consider a system that is modeled by R = M(x, t, X) where X is a random variable. We are interested in determining the probability of the

More information

Random systems of polynomial equations. The expected number of roots under smooth analysis

Random systems of polynomial equations. The expected number of roots under smooth analysis Bernoulli 15(1), 2009, 249 266 DOI: 10.3150/08-BEJ149 arxiv:0807.0262v2 [math.pr] 9 Feb 2009 Random systems of polynomial equations. The expected number of roots under smooth analysis DIEGO ARMENTANO *

More information

Module 9: Stationary Processes

Module 9: Stationary Processes Module 9: Stationary Processes Lecture 1 Stationary Processes 1 Introduction A stationary process is a stochastic process whose joint probability distribution does not change when shifted in time or space.

More information

In terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3.

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

A Convexity Theorem For Isoparametric Submanifolds

A Convexity Theorem For Isoparametric Submanifolds A Convexity Theorem For Isoparametric Submanifolds Marco Zambon January 18, 2001 1 Introduction. The main objective of this paper is to discuss a convexity theorem for a certain class of Riemannian manifolds,

More information

Example 4.1 Let X be a random variable and f(t) a given function of time. Then. Y (t) = f(t)x. Y (t) = X sin(ωt + δ)

Example 4.1 Let X be a random variable and f(t) a given function of time. Then. Y (t) = f(t)x. Y (t) = X sin(ωt + δ) Chapter 4 Stochastic Processes 4. Definition In the previous chapter we studied random variables as functions on a sample space X(ω), ω Ω, without regard to how these might depend on parameters. We now

More information

COMPLEX HERMITE POLYNOMIALS: FROM THE SEMI-CIRCULAR LAW TO THE CIRCULAR LAW

COMPLEX HERMITE POLYNOMIALS: FROM THE SEMI-CIRCULAR LAW TO THE CIRCULAR LAW Serials Publications www.serialspublications.com OMPLEX HERMITE POLYOMIALS: FROM THE SEMI-IRULAR LAW TO THE IRULAR LAW MIHEL LEDOUX Abstract. We study asymptotics of orthogonal polynomial measures of the

More information

Large deviations and averaging for systems of slow fast stochastic reaction diffusion equations.

Large deviations and averaging for systems of slow fast stochastic reaction diffusion equations. Large deviations and averaging for systems of slow fast stochastic reaction diffusion equations. Wenqing Hu. 1 (Joint work with Michael Salins 2, Konstantinos Spiliopoulos 3.) 1. Department of Mathematics

More information

ASSIGNMENT I GURU JAMBHESHWAR UNIVERSITY OF SCIENCE & TECHNOLOGY, HISAR DIRECTORATE OF DISTANCE EDUCATION. Programme: M.Sc.

ASSIGNMENT I GURU JAMBHESHWAR UNIVERSITY OF SCIENCE & TECHNOLOGY, HISAR DIRECTORATE OF DISTANCE EDUCATION. Programme: M.Sc. ASSIGNMENT I GURU JAMBHESHWAR UNIVERSITY OF SCIENCE & TECHNOLOGY, HISAR Paper Code: MAL-51 Total Marks = 15 Nomenclature of Paper: Abstract Algebra Q 1. Show that the square matrix of order n is similar

More information

Deterministic. Deterministic data are those can be described by an explicit mathematical relationship

Deterministic. Deterministic data are those can be described by an explicit mathematical relationship Random data Deterministic Deterministic data are those can be described by an explicit mathematical relationship Deterministic x(t) =X cos r! k m t Non deterministic There is no way to predict an exact

More information

ELEMENTS OF PROBABILITY THEORY

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

Approximately Gaussian marginals and the hyperplane conjecture

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

Stochastic Processes. A stochastic process is a function of two variables:

Stochastic Processes. A stochastic process is a function of two variables: Stochastic Processes Stochastic: from Greek stochastikos, proceeding by guesswork, literally, skillful in aiming. A stochastic process is simply a collection of random variables labelled by some parameter:

More information

Newton Method on Riemannian Manifolds: Covariant Alpha-Theory.

Newton Method on Riemannian Manifolds: Covariant Alpha-Theory. Newton Method on Riemannian Manifolds: Covariant Alpha-Theory. Jean-Pierre Dedieu a, Pierre Priouret a, Gregorio Malajovich c a MIP. Département de Mathématique, Université Paul Sabatier, 31062 Toulouse

More information

Stochastic Differential Equations

Stochastic Differential Equations Chapter 5 Stochastic Differential Equations We would like to introduce stochastic ODE s without going first through the machinery of stochastic integrals. 5.1 Itô Integrals and Itô Differential Equations

More information

Curvature and the continuity of optimal transportation maps

Curvature and the continuity of optimal transportation maps Curvature and the continuity of optimal transportation maps Young-Heon Kim and Robert J. McCann Department of Mathematics, University of Toronto June 23, 2007 Monge-Kantorovitch Problem Mass Transportation

More information

Extremes and ruin of Gaussian processes

Extremes and ruin of Gaussian processes International Conference on Mathematical and Statistical Modeling in Honor of Enrique Castillo. June 28-30, 2006 Extremes and ruin of Gaussian processes Jürg Hüsler Department of Math. Statistics, University

More information

Solution for Problem 7.1. We argue by contradiction. If the limit were not infinite, then since τ M (ω) is nondecreasing we would have

Solution for Problem 7.1. We argue by contradiction. If the limit were not infinite, then since τ M (ω) is nondecreasing we would have 362 Problem Hints and Solutions sup g n (ω, t) g(ω, t) sup g(ω, s) g(ω, t) µ n (ω). t T s,t: s t 1/n By the uniform continuity of t g(ω, t) on [, T], one has for each ω that µ n (ω) as n. Two applications

More information

Stochastic Processes

Stochastic Processes Elements of Lecture II Hamid R. Rabiee with thanks to Ali Jalali Overview Reading Assignment Chapter 9 of textbook Further Resources MIT Open Course Ware S. Karlin and H. M. Taylor, A First Course in Stochastic

More information

6.1 Moment Generating and Characteristic Functions

6.1 Moment Generating and Characteristic Functions Chapter 6 Limit Theorems The power statistics can mostly be seen when there is a large collection of data points and we are interested in understanding the macro state of the system, e.g., the average,

More information

Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes

Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes Fundamentals of Digital Commun. Ch. 4: Random Variables and Random Processes Klaus Witrisal witrisal@tugraz.at Signal Processing and Speech Communication Laboratory www.spsc.tugraz.at Graz University of

More information

Reflected Brownian Motion

Reflected Brownian Motion Chapter 6 Reflected Brownian Motion Often we encounter Diffusions in regions with boundary. If the process can reach the boundary from the interior in finite time with positive probability we need to decide

More information

Statistics 910, #5 1. Regression Methods

Statistics 910, #5 1. Regression Methods Statistics 910, #5 1 Overview Regression Methods 1. Idea: effects of dependence 2. Examples of estimation (in R) 3. Review of regression 4. Comparisons and relative efficiencies Idea Decomposition Well-known

More information

A Note on the Central Limit Theorem for the Eigenvalue Counting Function of Wigner and Covariance Matrices

A Note on the Central Limit Theorem for the Eigenvalue Counting Function of Wigner and Covariance Matrices A Note on the Central Limit Theorem for the Eigenvalue Counting Function of Wigner and Covariance Matrices S. Dallaporta University of Toulouse, France Abstract. This note presents some central limit theorems

More information

Statistical applications of geometry and random

Statistical applications of geometry and random Statistical applications of geometry and random fields 3 e Cycle romand de statistique et probabilités appliquées Based on joint work with: R. Adler, K. Worsley Jonathan Taylor Stanford University / Université

More information

Classic Time Series Analysis

Classic Time Series Analysis Classic Time Series Analysis Concepts and Definitions Let Y be a random number with PDF f Y t ~f,t Define t =E[Y t ] m(t) is known as the trend Define the autocovariance t, s =COV [Y t,y s ] =E[ Y t t

More information

Gaussian with mean ( µ ) and standard deviation ( σ)

Gaussian with mean ( µ ) and standard deviation ( σ) Slide from Pieter Abbeel Gaussian with mean ( µ ) and standard deviation ( σ) 10/6/16 CSE-571: Robotics X ~ N( µ, σ ) Y ~ N( aµ + b, a σ ) Y = ax + b + + + + 1 1 1 1 1 1 1 1 1 1, ~ ) ( ) ( ), ( ~ ), (

More information

Steepest descent method on a Riemannian manifold: the convex case

Steepest descent method on a Riemannian manifold: the convex case Steepest descent method on a Riemannian manifold: the convex case Julien Munier Abstract. In this paper we are interested in the asymptotic behavior of the trajectories of the famous steepest descent evolution

More information

Optimal transportation and optimal control in a finite horizon framework

Optimal transportation and optimal control in a finite horizon framework Optimal transportation and optimal control in a finite horizon framework Guillaume Carlier and Aimé Lachapelle Université Paris-Dauphine, CEREMADE July 2008 1 MOTIVATIONS - A commitment problem (1) Micro

More information

Optimality Conditions for Constrained Optimization

Optimality Conditions for Constrained Optimization 72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)

More information

5th-order differentiation

5th-order differentiation ARBITRARY-ORDER REAL-TIME EXACT ROBUST DIFFERENTIATION A. Levant Applied Mathematics Dept., Tel-Aviv University, Israel E-mail: levant@post.tau.ac.il Homepage: http://www.tau.ac.il/~levant/ 5th-order differentiation

More information

MATH 205C: STATIONARY PHASE LEMMA

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

Free Entropy for Free Gibbs Laws Given by Convex Potentials

Free Entropy for Free Gibbs Laws Given by Convex Potentials Free Entropy for Free Gibbs Laws Given by Convex Potentials David A. Jekel University of California, Los Angeles Young Mathematicians in C -algebras, August 2018 David A. Jekel (UCLA) Free Entropy YMC

More information

Uncertainty quantification and systemic risk

Uncertainty quantification and systemic risk Uncertainty quantification and systemic risk Josselin Garnier (Université Paris Diderot) with George Papanicolaou and Tzu-Wei Yang (Stanford University) February 3, 2016 Modeling systemic risk We consider

More information

This examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS

This examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 08 December 2009 This examination consists of

More information

Gaussian, Markov and stationary processes

Gaussian, Markov and stationary processes Gaussian, Markov and stationary processes Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ November

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

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

More information

ON THE KAC-RICE FORMULA

ON THE KAC-RICE FORMULA ON THE KAC-RCE FORMULA LVU. NCOLAESCU Abstract. This is an informal introduction to the Kac-Rice formula and some of its mostly one-dimensional applications. Contents. Gaussian random functions 2. The

More information

Some superconcentration inequalities for extrema of stationary Gaussian processes

Some superconcentration inequalities for extrema of stationary Gaussian processes Some superconcentration inequalities for extrema of stationary Gaussian processes Kevin Tanguy University of Toulouse, France Kevin Tanguy is with the Institute of Mathematics of Toulouse (CNRS UMR 5219).

More information

Testing Algebraic Hypotheses

Testing Algebraic Hypotheses Testing Algebraic Hypotheses Mathias Drton Department of Statistics University of Chicago 1 / 18 Example: Factor analysis Multivariate normal model based on conditional independence given hidden variable:

More information

Problem set 2 The central limit theorem.

Problem set 2 The central limit theorem. Problem set 2 The central limit theorem. Math 22a September 6, 204 Due Sept. 23 The purpose of this problem set is to walk through the proof of the central limit theorem of probability theory. Roughly

More information

In Memory of Wenbo V Li s Contributions

In Memory of Wenbo V Li s Contributions In Memory of Wenbo V Li s Contributions Qi-Man Shao The Chinese University of Hong Kong qmshao@cuhk.edu.hk The research is partially supported by Hong Kong RGC GRF 403513 Outline Lower tail probabilities

More information

Scientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1

Scientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1 Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,

More information

Lecture 4: Numerical solution of ordinary differential equations

Lecture 4: Numerical solution of ordinary differential equations Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor

More information

Journal of Computational and Applied Mathematics

Journal of Computational and Applied Mathematics Journal of Computational and Applied Mathematics 234 (2) 538 544 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam

More information

LAURENTIAN UNIVERSITY UNIVERSITÉ LAURENTIENNE

LAURENTIAN UNIVERSITY UNIVERSITÉ LAURENTIENNE Page 1 of 15 LAURENTIAN UNIVERSITY UNIVERSITÉ LAURENTIENNE Wednesday, December 13 th Course and No. 2006 MATH 2066 EL Date................................... Cours et no........................... Total

More information

Approximation of convex bodies by polytopes. Viktor Vígh

Approximation of convex bodies by polytopes. Viktor Vígh Approximation of convex bodies by polytopes Outline of Ph.D. thesis Viktor Vígh Supervisor: Ferenc Fodor Doctoral School in Mathematics and Computer Science Bolyai Institute, University of Szeged 2010

More information

Gaussian vectors and central limit theorem

Gaussian vectors and central limit theorem Gaussian vectors and central limit theorem Samy Tindel Purdue University Probability Theory 2 - MA 539 Samy T. Gaussian vectors & CLT Probability Theory 1 / 86 Outline 1 Real Gaussian random variables

More information

Second Order Results for Nodal Sets of Gaussian Random Waves

Second Order Results for Nodal Sets of Gaussian Random Waves 1 / 1 Second Order Results for Nodal Sets of Gaussian Random Waves Giovanni Peccati (Luxembourg University) Joint works with: F. Dalmao, G. Dierickx, D. Marinucci, I. Nourdin, M. Rossi and I. Wigman Random

More information

Concentration Inequalities for Random Matrices

Concentration Inequalities for Random Matrices Concentration Inequalities for Random Matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify the asymptotic

More information

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno Stochastic Processes M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno 1 Outline Stochastic (random) processes. Autocorrelation. Crosscorrelation. Spectral density function.

More information

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

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

More information

Part III Example Sheet 1 - Solutions YC/Lent 2015 Comments and corrections should be ed to

Part III Example Sheet 1 - Solutions YC/Lent 2015 Comments and corrections should be  ed to TIME SERIES Part III Example Sheet 1 - Solutions YC/Lent 2015 Comments and corrections should be emailed to Y.Chen@statslab.cam.ac.uk. 1. Let {X t } be a weakly stationary process with mean zero and let

More information

Gaussian Random Field: simulation and quantification of the error

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

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Milan Korda 1, Didier Henrion,3,4 Draft of December 1, 016 Abstract Moment-sum-of-squares hierarchies

More information

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

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

More information

Existence of minimizers for the pure displacement problem in nonlinear elasticity

Existence of minimizers for the pure displacement problem in nonlinear elasticity Existence of minimizers for the pure displacement problem in nonlinear elasticity Cristinel Mardare Université Pierre et Marie Curie - Paris 6, Laboratoire Jacques-Louis Lions, Paris, F-75005 France Abstract

More information

THE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON

THE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON GEORGIAN MATHEMATICAL JOURNAL: Vol. 3, No. 2, 1996, 153-176 THE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON M. SHASHIASHVILI Abstract. The Skorokhod oblique reflection problem is studied

More information

Gaussian processes for inference in stochastic differential equations

Gaussian processes for inference in stochastic differential equations Gaussian processes for inference in stochastic differential equations Manfred Opper, AI group, TU Berlin November 6, 2017 Manfred Opper, AI group, TU Berlin (TU Berlin) inference in SDE November 6, 2017

More information

Topological Phase Transitions

Topological Phase Transitions 1 Topological Phase Transitions Robert Adler Electrical Engineering Technion Israel Institute of Technology Stochastic Geometry Poitiers August 2015 Topological Phase Transitions (Nature abhors complexity)

More information

A mechanistic model for seed dispersal

A mechanistic model for seed dispersal A mechanistic model for seed dispersal Tom Robbins Department of Mathematics University of Utah and Centre for Mathematical Biology, Department of Mathematics University of Alberta A mechanistic model

More information

Harmonic Analysis. 1. Hermite Polynomials in Dimension One. Recall that if L 2 ([0 2π] ), then we can write as

Harmonic Analysis. 1. Hermite Polynomials in Dimension One. Recall that if L 2 ([0 2π] ), then we can write as Harmonic Analysis Recall that if L 2 ([0 2π] ), then we can write as () Z e ˆ (3.) F:L where the convergence takes place in L 2 ([0 2π] ) and ˆ is the th Fourier coefficient of ; that is, ˆ : (2π) [02π]

More information

6. Brownian Motion. Q(A) = P [ ω : x(, ω) A )

6. Brownian Motion. Q(A) = P [ ω : x(, ω) A ) 6. Brownian Motion. stochastic process can be thought of in one of many equivalent ways. We can begin with an underlying probability space (Ω, Σ, P) and a real valued stochastic process can be defined

More information

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1).

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1). Name M362K Final Exam Instructions: Show all of your work. You do not have to simplify your answers. No calculators allowed. There is a table of formulae on the last page. 1. Suppose X 1,..., X 1 are independent

More information

Brunn Minkowski Theory in Minkowski space-times. François Fillastre Université de Cergy Pontoise France

Brunn Minkowski Theory in Minkowski space-times. François Fillastre Université de Cergy Pontoise France Brunn Minkowski Theory in Minkowski space-times François Fillastre Université de Cergy Pontoise France Convex bodies A convex body is a (non empty) compact convex set of R d+1 Convex bodies A convex body

More information

ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172.

ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172. ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172. 1. Enter your name, student ID number, e-mail address, and signature in the space provided on this page, NOW! 2. This is a closed book exam.

More information

RESTRICTION. Alex Iosevich. Section 0: Introduction.. A natural question to ask is, does the boundedness of R : L 2(r+1)

RESTRICTION. Alex Iosevich. Section 0: Introduction.. A natural question to ask is, does the boundedness of R : L 2(r+1) FOURIER TRANSFORM, L 2 THEOREM, AND SCALING RESTRICTION Alex Iosevich Abstract. We show, using a Knapp-type homogeneity argument, that the (L p, L 2 ) restriction theorem implies a growth condition on

More information

SRI VIDYA COLLEGE OF ENGINEERING AND TECHNOLOGY UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS

SRI VIDYA COLLEGE OF ENGINEERING AND TECHNOLOGY UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS UNIT 3 RANDOM PROCESS TWO MARK QUESTIONS 1. Define random process? The sample space composed of functions of time is called a random process. 2. Define Stationary process? If a random process is divided

More information

The Relativistic Heat Equation

The Relativistic Heat Equation Maximum Principles and Behavior near Absolute Zero Washington University in St. Louis ARTU meeting March 28, 2014 The Heat Equation The heat equation is the standard model for diffusion and heat flow,

More information

The Canonical Gaussian Measure on R

The Canonical Gaussian Measure on R The Canonical Gaussian Measure on R 1. Introduction The main goal of this course is to study Gaussian measures. The simplest example of a Gaussian measure is the canonical Gaussian measure P on R where

More information

New ideas in the non-equilibrium statistical physics and the micro approach to transportation flows

New ideas in the non-equilibrium statistical physics and the micro approach to transportation flows New ideas in the non-equilibrium statistical physics and the micro approach to transportation flows Plenary talk on the conference Stochastic and Analytic Methods in Mathematical Physics, Yerevan, Armenia,

More information

On 1.9, you will need to use the facts that, for any x and y, sin(x+y) = sin(x) cos(y) + cos(x) sin(y). cos(x+y) = cos(x) cos(y) - sin(x) sin(y).

On 1.9, you will need to use the facts that, for any x and y, sin(x+y) = sin(x) cos(y) + cos(x) sin(y). cos(x+y) = cos(x) cos(y) - sin(x) sin(y). On 1.9, you will need to use the facts that, for any x and y, sin(x+y) = sin(x) cos(y) + cos(x) sin(y). cos(x+y) = cos(x) cos(y) - sin(x) sin(y). (sin(x)) 2 + (cos(x)) 2 = 1. 28 1 Characteristics of Time

More information

Discrete time processes

Discrete time processes Discrete time processes Predictions are difficult. Especially about the future Mark Twain. Florian Herzog 2013 Modeling observed data When we model observed (realized) data, we encounter usually the following

More information

Lecture 19 : Brownian motion: Path properties I

Lecture 19 : Brownian motion: Path properties I Lecture 19 : Brownian motion: Path properties I MATH275B - Winter 2012 Lecturer: Sebastien Roch References: [Dur10, Section 8.1], [Lig10, Section 1.5, 1.6], [MP10, Section 1.1, 1.2]. 1 Invariance We begin

More information

Uncertainty and Spectrogram Geometry

Uncertainty and Spectrogram Geometry From uncertainty...... to localization Spectrogram geometry CNRS & École Normale Supérieure de Lyon, France Erwin Schrödinger Institute, December 2012 * based on joint work with François Auger and Éric

More information

Sharpening Jensen s Inequality

Sharpening Jensen s Inequality Sharpening Jensen s Inequality arxiv:1707.08644v [math.st] 4 Oct 017 J. G. Liao and Arthur Berg Division of Biostatistics and Bioinformatics Penn State University College of Medicine October 6, 017 Abstract

More information