Limit theorems for dependent regularly varying functions of Markov chains
|
|
- Griffin Wright
- 5 years ago
- Views:
Transcription
1 Limit theorems for functions of with extremal linear behavior Limit theorems for dependent regularly varying functions of In collaboration with T. Mikosch Olivier Wintenberger CEREMADE, University Paris Dauphine and LFA, CREST. Strasbourg, October 23, 2012 Limit theorems for dependent regularly varying functions of
2 Limit theorems for functions of with extremal linear behavior Motivation: extension of the iid case Theorem (A.V. and S.V. Nagaev, 1969, 1979, Cline and Hsing, 1998) (X i ) iid random variables with regularly varying (centered if α > 1) distribution: p, q 0 with p + q = 1 and a slowly varying function L such that P(X > x) P( X > x) p L(x) x α and P(X x) P( X > x) q L(x) x α, x. Then S n = n i=1 X i satisfies the precise large deviations relation lim sup P(S n > x) n n P( X > x) p = 0 and lim sup P(S n x) n n P( X > x) q = 0. x b n x b n 1 α > 2 = b n = an log n with a > α 2, 2 α (0, 2] = b n = n δ+1/α for any δ > 0. Limit theorems for dependent regularly varying functions of
3 Limit theorems for functions of with extremal linear behavior Motivation: extension of the iid case (b n ) larger than the rate of convergences in law 1 α > 2 = n = o(b n ) in the TLC, 2 α (0, 2] = n 1/α L(n) = o(b n ) where L is slowly varying. Heavy tail phenomena If np( X > x) 0 and p 0 P(S n > x) x np(x > x) x P(max(X 1,..., X n ) > x). Also true for other sub-exponential distributions (EKM, 1997). What is happening for dependent sequences for whom extremes cluster? Limit theorems for dependent regularly varying functions of
4 Outline Limit theorems for functions of with extremal linear behavior 1 Irreducibility and splitting scheme Regular variation and drift condition 2 Limit theorems for functions of Central Limit Theorem Regular variation of cycles Large deviations 3 with extremal linear behavior Limit theorems for dependent regularly varying functions of
5 Limit theorems for functions of with extremal linear behavior Irreducibility and splitting scheme Regular variation and drift condition Regeneration of with an accessible atom (Doeblin, 1939) Definition (Φ t ) is a Markov chain of kernel P on R d and A B(R d ). A is an atom if a measure ν on B(R d ) st P(x, B) = ν(b) for all x A. A is accessible, i.e. k Pk (x, A) > 0 for all x R d, Let (τ A (j)) j 1 visiting times to the set A, i.e. τ A (1) = τ A = min{k > 0 : X k A} and τ A (j + 1) = min{k > τ A (j) : X k A}. Regeneration cycles 1 N A (t) = #{j 1 : τ A (j) t}, t 0, is a renewal process, 2 The cycles (Φ τa (t)+1,..., Φ τa (t+1)) are iid. Limit theorems for dependent regularly varying functions of
6 Limit theorems for functions of with extremal linear behavior Irreducibility and splitting scheme Regular variation and drift condition Irreducible Markov chain and Nummelin scheme Definition (Minorization condition, Meyn and Tweedie, 1993) δ > 0, C B(R d ) and a distribution ν on C such that (MC k ) P k (x, B) δν(b), x C, B B(R d ). (MC 1 ) is called the strongly aperiodic case. If P is an irreducible aperiodic Markov chain then it satisfies (MC k ) for some k N. Nummelin splitting scheme Under (MC 1 ) an enlargement of (Φ t ) on R d {0, 1} R d+1 possesses an accessible atom A = C {1} = the enlarged Markov chain regenerates. Limit theorems for dependent regularly varying functions of
7 Limit theorems for functions of with extremal linear behavior Regularly varying sequences Irreducibility and splitting scheme Regular variation and drift condition Regularly varying condition of order α > 0 A stationary sequence (X t ) is regularly varying if a non-null Radon measure µ d is such that (RV α ) n P(a 1 n (X 1,..., X d ) ) v µ d ( ), where (a n ) satisfies n P( X > a n ) 1 and µ d (ta) = t α µ d (A), t > 0. Definition (Basrak & Segers, 2009) It is equivalent to the existence of the spectral tail process (Θ t ) defined for k 0, P( X 0 1 (X 0,..., X k ) X 0 > x) w P((Θ 0,..., Θ k ) ), x. Limit theorems for dependent regularly varying functions of
8 Limit theorems for functions of with extremal linear behavior Main assumptions Irreducibility and splitting scheme Regular variation and drift condition Assume that (Φ t ) (possibly enlarged) possesses an accessible atom A, the existence of its invariant measure π and Φ 0 π. Assume the existence of f such that: 1 There exist constants β (0, 1), b > 0 such that for any y, (DC p ) E( f (Φ 1 ) p Φ 0 = y) β f (y) p + b 1 A (y). 2 (X t = f (Φ t )) satisfies (RV α ) with index α > 0 and spectral tail process (Θ t ). Remarks 1 it is absolutely (β )mixing with exponential rate, 2 sup x A E x (κ τ A ) for some κ > 1. 3 (DC p ) = (DC p ) for 0 < p p. Limit theorems for dependent regularly varying functions of
9 Illustrations Limit theorems for functions of with extremal linear behavior Irreducibility and splitting scheme Regular variation and drift condition ts(ser^2) ts(garch@h.t) Time Time CAC40 index Volatility estimated by a GARCH(1,1) Limit theorems for dependent regularly varying functions of
10 The cluster index Limit theorems for functions of with extremal linear behavior Irreducibility and splitting scheme Regular variation and drift condition Under (RV α ) denote b k (±) = lim n n P(±S k > a n ), k 1. Theorem Assume (RV α ) for some α > 0 and (DC p ) for some positive p (α 1, α). Then the limits (called cluster indexes) b ± : = lim k+1(±) b k (±)) k = [( k ) α ( k ) α ] lim Θ t Θ t k ± ± t=0 t=1 [( ) α ( ) α ] = E Θ t Θ t ± ± t=0 exist and are finite. Here (Θ t ) is the spectral tail process of (X t ). [( ) α ( ) α ] The extremal index 0 < θ = E sup t 0 Θ t sup t 1 Θ t E[(Θ 0 ) α +]. + + t=1 Limit theorems for dependent regularly varying functions of
11 Limit theorems for functions of with extremal linear behavior Gaussian Central Limit Theorem Central Limit Theorem Regular variation of cycles Large deviations Theorem (Samur, 2004) Assume that (DC p ) holds for p = 1, E X 2 < and EX = 0. Then 1 The central limit theorem n 1/2 S n d N (0, σ 2 ) where [( ) 2 ( ) 2 ] σ 2 = E X t X t <. t=0 2 The full cycles S A (t) = τ A (t+1) i=1 f (Φ τa (t)+i) have finite moments of order 2 with E A (S(1)) = 0 and E A [S(1) 2 ] = σ 2. t=1 Limit theorems for dependent regularly varying functions of
12 Limit theorems for functions of with extremal linear behavior Stable Central Limit Theorem Central Limit Theorem Regular variation of cycles Large deviations Theorem Assume (RV α ) with 0 < α < 2, α 1 and (DC p ) with (α 1) + < p < α then the Central Limit Theorem a 1 n S n d ξα is satisfied for a centered α-stable r.v. ξ α with characteristic function ψ α (x) = exp( x α χ α (x, b +, b )), where χ α (x, b +, b ) = Γ(2 α) 1 α Proof: apply Bartkiewicz et al., ( ) (b + + b ) cos(πα/2) i sign(x)(b + b ) sin(π α/2). Limit theorems for dependent regularly varying functions of
13 Limit theorems for functions of with extremal linear behavior Regular variation of cycles Central Limit Theorem Regular variation of cycles Large deviations Theorem Assume (RV α ) with α > 0 and (DC p ) with (α 1) + < p < α and b± 0 then P A ( ± τ A i=1 ) f (Φ i ) > x x b ± E A (τ A ) P( X > x). Remarks 1 The full cycles S A (t) = τ A (t+1) i=1 f (Φ τa (t)+i) are regularly varying with the same index α > 0 than X t, 2 If τ A is independent of (X t ) then P A (S A (1) > x) x E A (τ A ) P(X > x), 3 The distribution of the cycles depends of the choice of the atom A. Limit theorems for dependent regularly varying functions of
14 Limit theorems for functions of with extremal linear behavior Sketch of the proof Central Limit Theorem Regular variation of cycles Large deviations P(S n > b n ) n P( X > b n ) b + P(S n > b n ) n (P(S k+1 > b n ) P(S k > b n )) n P( X > b n ) + P(S k+1 > b n ) P(S k > b n ) b +. P( X > b n ) 1 In the second term, write X truncated X at b n /k 2 and S k = S k + S k and deal with S k using a lemma from Jakubowski, Using Nagaev-Fuk inequality of Bertail and Clemençon (2009), under (DC p ) P lim lim sup k n ( n ) i=1 X i1 { Xi b n/k 2 } > b n /k = 0. n P( X > b n ) 3 Use the regeneration scheme to prove that P(S n > b n ) n P A (S A > b n ) (E A(τ A )) 1 0, Limit theorems for dependent regularly varying functions of
15 Limit theorems for functions of with extremal linear behavior Precise large deviations Central Limit Theorem Regular variation of cycles Large deviations Corollary (Under the hypothesis of the Theorem) P(±S n > x) If 0 < α < 1 then lim n sup x bn n P( X > x) b ± = 0, P(±S n > x) else lim n sup bn x c n n P( X > x) b ± = 0 if P(τ A > n) = o(np( X > c n )). Determination of the constant in LD of Davis and Hsing (1995) valid for α < 2. Sketch of the proof: Use S n = τ A 1 X i + N A (n) 1 t=1 S A (t) + n τ A (N A (n))+1 X i. Under P(τ A > n) = o(np( X > c n )) we can restrict to N A (n) 1. The first and last cycles are negligible using Pitman s identity. Use Nagaev s inequality on the iid regularly varying cycles S A (t). Limit theorems for dependent regularly varying functions of
16 Limit theorems for functions of with extremal linear behavior with extremal linear behavior (Kesten, 1974, Goldie, 1991, Segers, 2007, Mirek, 2011) Assume (A, B) is absolutely continuous on R + R with EA α = 1, X t = Ψ t (X t 1 ) with iid iterated Lipschitz functions Ψ t with negative top Lyapunov exponent and A t X t 1 B t X t A t X t 1 + B t. Proposition If E(X ) = 0 when E X <, the conclusions of the theorems hold with [( b + = E 1 + t ) α ( t ) α ] A i A i t=1 i=1 t=1 i=1 and b = 0. Limit theorems for dependent regularly varying functions of
17 Limit theorems for functions of with extremal linear behavior Examples 1 Random difference equation X t = AX t 1 + B. The region [b n, c n ] seems optimal (Buraczewski et al., 2011): P(S n > x) np( X > x) b + + P(S n > x, τ A > n) = b + + r(x) np( X > x) and r(x) seems not negligible for some x >> c n. 2 X t = max(a t X t 1, B t ), 3 Letac s model X t = A t max(c t, X t 1 ) + D t. Limit theorems for dependent regularly varying functions of
18 Limit theorems for functions of with extremal linear behavior The GARCH(1,1) model (Bollorslev, 1986, Mikosch and Starica, 2000) We consider a GARCH(1,1) process X t = σ t Z t, where (Z t ) is iid with E[Z 0 ] = 0 and E[Z 2 0 ] = 1 and σ 2 t = α 0 + σ 2 t 1(α 1 Z 2 t 1 + β 1 ) = α 0 + σ 2 t 1A t. Considering the Markov chain (X t, σ t ) under conditions of irreducibility, aperiodicity and E(α 1 Z β 1) α/2 = 1, α > 0 and E Z α+ɛ < we obtain Proposition If Z is symmetric, the conclusions of the theorems hold with [ Z0 E + t=1 Z t α t i=1 Ai t=1 Z t α] t i=1 Ai b ± = E Z 0 α. Limit theorems for dependent regularly varying functions of
19 Limit theorems for functions of with extremal linear behavior Application to the autocovariance of the squared log-ratios Series log_rendement_ftse^2 Threshold ACF (cov) alpha (CI, p =0.95) Lag Order Statistics For α/2 (0, 2), an 1 n h t=1 X t 2 Xt+h 2 d ξ α/4 with (Θ t ) t 0 = (czt 2 Zt+h 2 Π tπ t+h ) t 0, = b = 0 and ξ α/4 is supported by [0, ). Limit theorems for dependent regularly varying functions of
20 Limit theorems for functions of with extremal linear behavior Conclusion Cluster indices b ± determine the large deviations of the sums of dependent and regularly varying variables, Explicit expressions of b ± are given for some models, Under the hypothesis of the theorems P(S n > x) n b + θ P(max(X 1,..., X n ) > x) for b n x c n with possibly b + /θ 1 on models... Limit theorems for dependent regularly varying functions of
21 Limit theorems for functions of with extremal linear behavior Conclusion Thank you for your attention! Limit theorems for dependent regularly varying functions of
Practical conditions on Markov chains for weak convergence of tail empirical processes
Practical conditions on Markov chains for weak convergence of tail empirical processes Olivier Wintenberger University of Copenhagen and Paris VI Joint work with Rafa l Kulik and Philippe Soulier Toronto,
More informationThe largest eigenvalues of the sample covariance matrix. in the heavy-tail case
The largest eigenvalues of the sample covariance matrix 1 in the heavy-tail case Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia NY), Johannes Heiny (Aarhus University)
More informationHeavy Tailed Time Series with Extremal Independence
Heavy Tailed Time Series with Extremal Independence Rafa l Kulik and Philippe Soulier Conference in honour of Prof. Herold Dehling Bochum January 16, 2015 Rafa l Kulik and Philippe Soulier Regular variation
More informationNonlinear Time Series Modeling
Nonlinear Time Series Modeling Part II: Time Series Models in Finance Richard A. Davis Colorado State University (http://www.stat.colostate.edu/~rdavis/lectures) MaPhySto Workshop Copenhagen September
More informationStable limits for sums of dependent infinite variance random variables
Probab. Theory Relat. Fields DOI 10.1007/s00440-010-0276-9 Stable limits for sums of dependent infinite variance random variables Katarzyna Bartkiewicz Adam Jakubowski Thomas Mikosch Olivier Wintenberger
More informationTail inequalities for additive functionals and empirical processes of. Markov chains
Tail inequalities for additive functionals and empirical processes of geometrically ergodic Markov chains University of Warsaw Banff, June 2009 Geometric ergodicity Definition A Markov chain X = (X n )
More informationExtremogram and Ex-Periodogram for heavy-tailed time series
Extremogram and Ex-Periodogram for heavy-tailed time series 1 Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia) and Yuwei Zhao (Ulm) 1 Jussieu, April 9, 2014 1 2 Extremal
More informationExtremogram and ex-periodogram for heavy-tailed time series
Extremogram and ex-periodogram for heavy-tailed time series 1 Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia) and Yuwei Zhao (Ulm) 1 Zagreb, June 6, 2014 1 2 Extremal
More informationGARCH processes probabilistic properties (Part 1)
GARCH processes probabilistic properties (Part 1) Alexander Lindner Centre of Mathematical Sciences Technical University of Munich D 85747 Garching Germany lindner@ma.tum.de http://www-m1.ma.tum.de/m4/pers/lindner/
More informationThe sample autocorrelations of financial time series models
The sample autocorrelations of financial time series models Richard A. Davis 1 Colorado State University Thomas Mikosch University of Groningen and EURANDOM Abstract In this chapter we review some of the
More informationAssessing the dependence of high-dimensional time series via sample autocovariances and correlations
Assessing the dependence of high-dimensional time series via sample autocovariances and correlations Johannes Heiny University of Aarhus Joint work with Thomas Mikosch (Copenhagen), Richard Davis (Columbia),
More informationTail process and its role in limit theorems Bojan Basrak, University of Zagreb
Tail process and its role in limit theorems Bojan Basrak, University of Zagreb The Fields Institute Toronto, May 2016 based on the joint work (in progress) with Philippe Soulier, Azra Tafro, Hrvoje Planinić
More informationStrong approximation for additive functionals of geometrically ergodic Markov chains
Strong approximation for additive functionals of geometrically ergodic Markov chains Florence Merlevède Joint work with E. Rio Université Paris-Est-Marne-La-Vallée (UPEM) Cincinnati Symposium on Probability
More informationStochastic volatility models with possible extremal clustering
Bernoulli 19(5A), 213, 1688 1713 DOI: 1.315/12-BEJ426 Stochastic volatility models with possible extremal clustering THOMAS MIKOSCH 1 and MOHSEN REZAPOUR 2 1 University of Copenhagen, Department of Mathematics,
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 informationConsistency of the maximum likelihood estimator for general hidden Markov models
Consistency of the maximum likelihood estimator for general hidden Markov models Jimmy Olsson Centre for Mathematical Sciences Lund University Nordstat 2012 Umeå, Sweden Collaborators Hidden Markov models
More informationLectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 4. Coupling and Harris Processes
Lectures on Stochastic Stability Sergey FOSS Heriot-Watt University Lecture 4 Coupling and Harris Processes 1 A simple example Consider a Markov chain X n in a countable state space S with transition probabilities
More informationPositive and null recurrent-branching Process
December 15, 2011 In last discussion we studied the transience and recurrence of Markov chains There are 2 other closely related issues about Markov chains that we address Is there an invariant distribution?
More informationRegular Variation and Extreme Events for Stochastic Processes
1 Regular Variation and Extreme Events for Stochastic Processes FILIP LINDSKOG Royal Institute of Technology, Stockholm 2005 based on joint work with Henrik Hult www.math.kth.se/ lindskog 2 Extremes for
More informationSTAT STOCHASTIC PROCESSES. Contents
STAT 3911 - STOCHASTIC PROCESSES ANDREW TULLOCH Contents 1. Stochastic Processes 2 2. Classification of states 2 3. Limit theorems for Markov chains 4 4. First step analysis 5 5. Branching processes 5
More informationRandom recurrence equations and ruin in a Markov-dependent stochastic economic environment
To appear in The Annals of Applied Probability received May 2007, revised November 2008). Random recurrence equations and ruin in a Markov-dependent stochastic economic environment Jeffrey F. Collamore
More informationRelative growth of the partial sums of certain random Fibonacci-like sequences
Relative growth of the partial sums of certain random Fibonacci-like sequences Alexander Roitershtein Zirou Zhou January 9, 207; Revised August 8, 207 Abstract We consider certain Fibonacci-like sequences
More informationTAIL ESTIMATES FOR STOCHASTIC FIXED POINT EQUATIONS VIA NONLINEAR RENEWAL THEORY
Submitted arxiv: math.pr/1103.2317 TAIL ESTIMATES FOR STOCHASTIC FIXED POINT EQUATIONS VIA NONLINEAR RENEWAL THEORY By Jeffrey F. Collamore and Anand N. Vidyashankar University of Copenhagen and George
More informationSample Autocorrelations for Financial Time Series Models. Richard A. Davis Colorado State University Thomas Mikosch University of Copenhagen
Sample Auocorrelaions for Financial Time Series Models Richard A. Davis Colorado Sae Universiy Thomas Mikosch Universiy of Copenhagen Ouline Characerisics of some financial ime series IBM reurns NZ-USA
More informationLARGE DEVIATION PROBABILITIES FOR SUMS OF HEAVY-TAILED DEPENDENT RANDOM VECTORS*
LARGE EVIATION PROBABILITIES FOR SUMS OF HEAVY-TAILE EPENENT RANOM VECTORS* Adam Jakubowski Alexander V. Nagaev Alexander Zaigraev Nicholas Copernicus University Faculty of Mathematics and Computer Science
More informationP i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=
2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]
More informationLARGE DEVIATIONS FOR SOLUTIONS TO STOCHASTIC RECURRENCE EQUATIONS UNDER KESTEN S CONDITION D. BURACZEWSKI, E. DAMEK, T. MIKOSCH AND J.
LARGE DEVIATIONS FOR SOLUTIONS TO STOCHASTIC RECURRENCE EQUATIONS UNDER KESTEN S CONDITION D. BURACZEWSKI, E. DAMEK, T. MIKOSCH AND J. ZIENKIEWICZ Abstract. In this paper we prove large deviations results
More informationStochastic volatility models: tails and memory
: tails and memory Rafa l Kulik and Philippe Soulier Conference in honour of Prof. Murad Taqqu 19 April 2012 Rafa l Kulik and Philippe Soulier Plan Model assumptions; Limit theorems for partial sums and
More informationMS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10
MS&E 321 Spring 12-13 Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10 Section 3: Regenerative Processes Contents 3.1 Regeneration: The Basic Idea............................... 1 3.2
More informationNew Bernstein and Hoeffding type inequalities for regenerative Markov chains
New Bernstein and Hoeffding type inequalities for regenerative Markov chains Patrice Bertail Gabriela Ciolek To cite this version: Patrice Bertail Gabriela Ciolek. New Bernstein and Hoeffding type inequalities
More informationSimultaneous drift conditions for Adaptive Markov Chain Monte Carlo algorithms
Simultaneous drift conditions for Adaptive Markov Chain Monte Carlo algorithms Yan Bai Feb 2009; Revised Nov 2009 Abstract In the paper, we mainly study ergodicity of adaptive MCMC algorithms. Assume that
More informationRichard A. Davis Colorado State University Bojan Basrak Eurandom Thomas Mikosch University of Groningen
Mulivariae Regular Variaion wih Applicaion o Financial Time Series Models Richard A. Davis Colorado Sae Universiy Bojan Basrak Eurandom Thomas Mikosch Universiy of Groningen Ouline + Characerisics of some
More informationRegeneration-based statistics for Harris recurrent Markov chains
1 Regeneration-based statistics for Harris recurrent Markov chains Patrice Bertail 1 and Stéphan Clémençon 2 1 CREST-LS, 3, ave Pierre Larousse, 94205 Malakoff, France Patrice.Bertail@ensae.fr 2 MODAL
More informationModèles de dépendance entre temps inter-sinistres et montants de sinistre en théorie de la ruine
Séminaire de Statistiques de l'irma Modèles de dépendance entre temps inter-sinistres et montants de sinistre en théorie de la ruine Romain Biard LMB, Université de Franche-Comté en collaboration avec
More informationOperational Risk and Pareto Lévy Copulas
Operational Risk and Pareto Lévy Copulas Claudia Klüppelberg Technische Universität München email: cklu@ma.tum.de http://www-m4.ma.tum.de References: - Böcker, K. and Klüppelberg, C. (25) Operational VaR
More informationConcentration inequalities and tail bounds
Concentration inequalities and tail bounds John Duchi Outline I Basics and motivation 1 Law of large numbers 2 Markov inequality 3 Cherno bounds II Sub-Gaussian random variables 1 Definitions 2 Examples
More informationImportance Sampling Methodology for Multidimensional Heavy-tailed Random Walks
Importance Sampling Methodology for Multidimensional Heavy-tailed Random Walks Jose Blanchet (joint work with Jingchen Liu) Columbia IEOR Department RESIM Blanchet (Columbia) IS for Heavy-tailed Walks
More informationJanuary 22, 2013 MEASURES OF SERIAL EXTREMAL DEPENDENCE AND THEIR ESTIMATION
January 22, 2013 MASURS OF SRIAL XTRMAL DPNDNC AND THIR STIMATION RICHARD A. DAVIS, THOMAS MIKOSCH, AND YUWI ZHAO Abstract. The goal of this paper is two-fold: 1. We review classical and recent measures
More informationLecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.
1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if
More informationWhen is a Markov chain regenerative?
When is a Markov chain regenerative? Krishna B. Athreya and Vivekananda Roy Iowa tate University Ames, Iowa, 50011, UA Abstract A sequence of random variables {X n } n 0 is called regenerative if it can
More informationLarge deviations for random walks under subexponentiality: the big-jump domain
Large deviations under subexponentiality p. Large deviations for random walks under subexponentiality: the big-jump domain Ton Dieker, IBM Watson Research Center joint work with D. Denisov (Heriot-Watt,
More informationOn the Central Limit Theorem for an ergodic Markov chain
Stochastic Processes and their Applications 47 ( 1993) 113-117 North-Holland 113 On the Central Limit Theorem for an ergodic Markov chain K.S. Chan Department of Statistics and Actuarial Science, The University
More informationarxiv:submit/ [math.pr] 9 Sep 2016
Importance sampling of heavy-tailed iterated random functions By Bohan Chen, Chang-Han Rhee & Bert Zwart arxiv:submit/1661179 [math.pr] 9 Sep 2016 Centrum Wiskunde & Informatica Science Park 123, 1098
More informationThe Convergence Rate for the Normal Approximation of Extreme Sums
The Convergence Rate for the Normal Approximation of Extreme Sums Yongcheng Qi University of Minnesota Duluth WCNA 2008, Orlando, July 2-9, 2008 This talk is based on a joint work with Professor Shihong
More informationSimulation estimators in a dynamic model for food contaminant exposure
Simulation estimators in a dynamic model for food contaminant exposure Joint work with P. Bertail (CREST LS and Paris X) and Stéphan Clémençon (INRA Mét@risk and Paris X) INRA-Mét@risk, Food Risk Analysis
More informationSelected Exercises on Expectations and Some Probability Inequalities
Selected Exercises on Expectations and Some Probability Inequalities # If E(X 2 ) = and E X a > 0, then P( X λa) ( λ) 2 a 2 for 0 < λ
More informationEstimation of arrival and service rates for M/M/c queue system
Estimation of arrival and service rates for M/M/c queue system Katarína Starinská starinskak@gmail.com Charles University Faculty of Mathematics and Physics Department of Probability and Mathematical Statistics
More informationErgodicity in data assimilation methods
Ergodicity in data assimilation methods David Kelly Andy Majda Xin Tong Courant Institute New York University New York NY www.dtbkelly.com April 15, 2016 ETH Zurich David Kelly (CIMS) Data assimilation
More informationSelf-normalized Cramér-Type Large Deviations for Independent Random Variables
Self-normalized Cramér-Type Large Deviations for Independent Random Variables Qi-Man Shao National University of Singapore and University of Oregon qmshao@darkwing.uoregon.edu 1. Introduction Let X, X
More informationMARKOV CHAINS AND HIDDEN MARKOV MODELS
MARKOV CHAINS AND HIDDEN MARKOV MODELS MERYL SEAH Abstract. This is an expository paper outlining the basics of Markov chains. We start the paper by explaining what a finite Markov chain is. Then we describe
More informationNonparametric regression with martingale increment errors
S. Gaïffas (LSTA - Paris 6) joint work with S. Delattre (LPMA - Paris 7) work in progress Motivations Some facts: Theoretical study of statistical algorithms requires stationary and ergodicity. Concentration
More informationReview. DS GA 1002 Statistical and Mathematical Models. Carlos Fernandez-Granda
Review DS GA 1002 Statistical and Mathematical Models http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall16 Carlos Fernandez-Granda Probability and statistics Probability: Framework for dealing with
More informationLecture 8: Information Theory and Statistics
Lecture 8: Information Theory and Statistics Part II: Hypothesis Testing and I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw December 23, 2015 1 / 50 I-Hsiang
More informationConcentration inequalities for linear cocycles and their applications to problems in dynamics and mathematical physics *
Concentration inequalities for linear cocycles and their applications to problems in dynamics and mathematical physics * Silvius Klein Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Brazil
More informationNecessary and sufficient conditions for strong R-positivity
Necessary and sufficient conditions for strong R-positivity Wednesday, November 29th, 2017 The Perron-Frobenius theorem Let A = (A(x, y)) x,y S be a nonnegative matrix indexed by a countable set S. We
More informationMFM Practitioner Module: Quantitiative Risk Management. John Dodson. October 14, 2015
MFM Practitioner Module: Quantitiative Risk Management October 14, 2015 The n-block maxima 1 is a random variable defined as M n max (X 1,..., X n ) for i.i.d. random variables X i with distribution function
More informationFaithful couplings of Markov chains: now equals forever
Faithful couplings of Markov chains: now equals forever by Jeffrey S. Rosenthal* Department of Statistics, University of Toronto, Toronto, Ontario, Canada M5S 1A1 Phone: (416) 978-4594; Internet: jeff@utstat.toronto.edu
More informationLecture 22 Girsanov s Theorem
Lecture 22: Girsanov s Theorem of 8 Course: Theory of Probability II Term: Spring 25 Instructor: Gordan Zitkovic Lecture 22 Girsanov s Theorem An example Consider a finite Gaussian random walk X n = n
More informationA regeneration proof of the central limit theorem for uniformly ergodic Markov chains
A regeneration proof of the central limit theorem for uniformly ergodic Markov chains By AJAY JASRA Department of Mathematics, Imperial College London, SW7 2AZ, London, UK and CHAO YANG Department of Mathematics,
More informationMarkov chain Monte Carlo
1 / 26 Markov chain Monte Carlo Timothy Hanson 1 and Alejandro Jara 2 1 Division of Biostatistics, University of Minnesota, USA 2 Department of Statistics, Universidad de Concepción, Chile IAP-Workshop
More informationOn the Bennett-Hoeffding inequality
On the Bennett-Hoeffding inequality of Iosif 1,2,3 1 Department of Mathematical Sciences Michigan Technological University 2 Supported by NSF grant DMS-0805946 3 Paper available at http://arxiv.org/abs/0902.4058
More informationLecture 21. David Aldous. 16 October David Aldous Lecture 21
Lecture 21 David Aldous 16 October 2015 In continuous time 0 t < we specify transition rates or informally P(X (t+δ)=j X (t)=i, past ) q ij = lim δ 0 δ P(X (t + dt) = j X (t) = i) = q ij dt but note these
More informationGeometric ρ-mixing property of the interarrival times of a stationary Markovian Arrival Process
Author manuscript, published in "Journal of Applied Probability 50, 2 (2013) 598-601" Geometric ρ-mixing property of the interarrival times of a stationary Markovian Arrival Process L. Hervé and J. Ledoux
More informationMixing time for a random walk on a ring
Mixing time for a random walk on a ring Stephen Connor Joint work with Michael Bate Paris, September 2013 Introduction Let X be a discrete time Markov chain on a finite state space S, with transition matrix
More informationPositive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network. Haifa Statistics Seminar May 5, 2008
Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network Yoni Nazarathy Gideon Weiss Haifa Statistics Seminar May 5, 2008 1 Outline 1 Preview of Results 2 Introduction Queueing
More informationLecture 8: The Metropolis-Hastings Algorithm
30.10.2008 What we have seen last time: Gibbs sampler Key idea: Generate a Markov chain by updating the component of (X 1,..., X p ) in turn by drawing from the full conditionals: X (t) j Two drawbacks:
More information1 Continuous-time chains, finite state space
Université Paris Diderot 208 Markov chains Exercises 3 Continuous-time chains, finite state space Exercise Consider a continuous-time taking values in {, 2, 3}, with generator 2 2. 2 2 0. Draw the diagramm
More informationOn Differentiability of Average Cost in Parameterized Markov Chains
On Differentiability of Average Cost in Parameterized Markov Chains Vijay Konda John N. Tsitsiklis August 30, 2002 1 Overview The purpose of this appendix is to prove Theorem 4.6 in 5 and establish various
More information10-704: Information Processing and Learning Spring Lecture 8: Feb 5
10-704: Information Processing and Learning Spring 2015 Lecture 8: Feb 5 Lecturer: Aarti Singh Scribe: Siheng Chen Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal
More informationIn 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 informationDepartment of Econometrics and Business Statistics
ISSN 440-77X Australia Department of Econometrics and Business Statistics http://www.buseco.monash.edu.au/depts/ebs/pubs/wpapers/ Nonlinear Regression with Harris Recurrent Markov Chains Degui Li, Dag
More informationLecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.
Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution
More informationPoisson Cluster process as a model for teletraffic arrivals and its extremes
Poisson Cluster process as a model for teletraffic arrivals and its extremes Barbara González-Arévalo, University of Louisiana Thomas Mikosch, University of Copenhagen Gennady Samorodnitsky, Cornell University
More information25.1 Ergodicity and Metric Transitivity
Chapter 25 Ergodicity This lecture explains what it means for a process to be ergodic or metrically transitive, gives a few characterizes of these properties (especially for AMS processes), and deduces
More informationarxiv: v2 [math.st] 13 Sep 2016
arxiv:1511.0175v [math.st] 13 Sep 016 Exponential inequalities for unbounded functions of geometrically ergodic Markov chains. Applications to quantitative error bounds for regenerative Metropolis algorithms.
More informationSTA205 Probability: Week 8 R. Wolpert
INFINITE COIN-TOSS AND THE LAWS OF LARGE NUMBERS The traditional interpretation of the probability of an event E is its asymptotic frequency: the limit as n of the fraction of n repeated, similar, and
More informationEstablishing Stationarity of Time Series Models via Drift Criteria
Establishing Stationarity of Time Series Models via Drift Criteria Dawn B. Woodard David S. Matteson Shane G. Henderson School of Operations Research and Information Engineering Cornell University January
More informationPerturbed Proximal Gradient Algorithm
Perturbed Proximal Gradient Algorithm Gersende FORT LTCI, CNRS, Telecom ParisTech Université Paris-Saclay, 75013, Paris, France Large-scale inverse problems and optimization Applications to image processing
More informationMath 576: Quantitative Risk Management
Math 576: Quantitative Risk Management Haijun Li lih@math.wsu.edu Department of Mathematics Washington State University Week 11 Haijun Li Math 576: Quantitative Risk Management Week 11 1 / 21 Outline 1
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 informationGradient Estimation for Attractor Networks
Gradient Estimation for Attractor Networks Thomas Flynn Department of Computer Science Graduate Center of CUNY July 2017 1 Outline Motivations Deterministic attractor networks Stochastic attractor networks
More informationStability of Nonlinear Stochastic Recursions with Application to Nonlinear AR-GARCH Models
Stability of Nonlinear Stochastic Recursions with Application to Nonlinear AR-GARCH Models Daren B.H. Cline 1 Department of Statistics Texas A&M University College Station TX 77843-3143 25 March 2007 Abstract.
More informationEfficient Rare-event Simulation for Perpetuities
Efficient Rare-event Simulation for Perpetuities Blanchet, J., Lam, H., and Zwart, B. We consider perpetuities of the form Abstract D = B 1 exp Y 1 ) + B 2 exp Y 1 + Y 2 ) +..., where the Y j s and B j
More informationMultivariate Markov-switching ARMA processes with regularly varying noise
Multivariate Markov-switching ARMA processes with regularly varying noise Robert Stelzer 23rd June 2006 Abstract The tail behaviour of stationary R d -valued Markov-Switching ARMA processes driven by a
More informationRARE EVENT SIMULATION FOR PROCESSES GENERATED VIA STOCHASTIC FIXED POINT EQUATIONS
Submitted arxiv: math.pr/0000000 RARE EVENT SIMULATION FOR PROCESSES GENERATED VIA STOCHASTIC FIXED POINT EQUATIONS By Jeffrey F. Collamore, Guoqing Diao, and Anand N. Vidyashankar University of Copenhagen
More informationSusceptible-Infective-Removed Epidemics and Erdős-Rényi random
Susceptible-Infective-Removed Epidemics and Erdős-Rényi random graphs MSR-Inria Joint Centre October 13, 2015 SIR epidemics: the Reed-Frost model Individuals i [n] when infected, attempt to infect all
More informationPreface. X t ¼ A t X t 1 þ B t ; t 2 Z: ð1þ
Preface The Stochastic Equation. The authors of this text (called DB, ED and TM) started their collaboration with the paper Buraczewski et al. [76] in 2011. We studied large deviations and ruin probabilities
More informationAdditive functionals of infinite-variance moving averages. Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535
Additive functionals of infinite-variance moving averages Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535 Departments of Statistics The University of Chicago Chicago, Illinois 60637 June
More informationChapter 2: Markov Chains and Queues in Discrete Time
Chapter 2: Markov Chains and Queues in Discrete Time L. Breuer University of Kent 1 Definition Let X n with n N 0 denote random variables on a discrete space E. The sequence X = (X n : n N 0 ) is called
More informationThomas Mikosch and Daniel Straumann: Stable Limits of Martingale Transforms with Application to the Estimation of Garch Parameters
MaPhySto The Danish National Research Foundation: Network in Mathematical Physics and Stochastics Research Report no. 11 March 2004 Thomas Mikosch and Daniel Straumann: Stable Limits of Martingale Transforms
More informationprocess on the hierarchical group
Intertwining of Markov processes and the contact process on the hierarchical group April 27, 2010 Outline Intertwining of Markov processes Outline Intertwining of Markov processes First passage times of
More informationComputational statistics
Computational statistics Markov Chain Monte Carlo methods Thierry Denœux March 2017 Thierry Denœux Computational statistics March 2017 1 / 71 Contents of this chapter When a target density f can be evaluated
More informationCSE 312 Final Review: Section AA
CSE 312 TAs December 8, 2011 General Information General Information Comprehensive Midterm General Information Comprehensive Midterm Heavily weighted toward material after the midterm Pre-Midterm Material
More informationExtreme Value Analysis and Spatial Extremes
Extreme Value Analysis and Department of Statistics Purdue University 11/07/2013 Outline Motivation 1 Motivation 2 Extreme Value Theorem and 3 Bayesian Hierarchical Models Copula Models Max-stable Models
More informationPhenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012
Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 202 BOUNDS AND ASYMPTOTICS FOR FISHER INFORMATION IN THE CENTRAL LIMIT THEOREM
More information8.1 Concentration inequality for Gaussian random matrix (cont d)
MGMT 69: Topics in High-dimensional Data Analysis Falll 26 Lecture 8: Spectral clustering and Laplacian matrices Lecturer: Jiaming Xu Scribe: Hyun-Ju Oh and Taotao He, October 4, 26 Outline Concentration
More informationMonte Carlo and cold gases. Lode Pollet.
Monte Carlo and cold gases Lode Pollet lpollet@physics.harvard.edu 1 Outline Classical Monte Carlo The Monte Carlo trick Markov chains Metropolis algorithm Ising model critical slowing down Quantum Monte
More informationAn invariance principle for sums and record times of regularly varying stationary sequences
An invariance principle for sums and record times of regularly varying stationary sequences Bojan Basrak Hrvoje Planinić Philippe Soulier arxiv:1609.00687v2 [math.pr] 4 Dec 2017 December 5, 2017 Abstract
More informationGARCH processes continuous counterparts (Part 2)
GARCH processes continuous counterparts (Part 2) Alexander Lindner Centre of Mathematical Sciences Technical University of Munich D 85747 Garching Germany lindner@ma.tum.de http://www-m1.ma.tum.de/m4/pers/lindner/
More informationRare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions
Rare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk The University of
More information