Temporal Point Processes the Conditional Intensity Function

Size: px
Start display at page:

Download "Temporal Point Processes the Conditional Intensity Function"

Transcription

1 Temporal Point Processes the Conditional Intensity Function Jakob G. Rasmussen Department of Mathematics Aalborg University Denmark February 8, /10

2 Temporal point processes A temporal point process is a point process defined on the time line. Examples of point (= events) patterns: Earthquakes or other disasters Visits at a server Defective products made at a factory Accidents at a road junction Distinguishing features of temporal point processes: S = R the events have the natural order of time Temporal point processes can also have marks: Magnitudes or positions of earthquakes Time spent by a visitor at a server Type or number of defects on a product Severity or cost of an accident 2/10

3 Definition of an unmarked temporal point process Definitions: 1. a random sequence T on R 2. a random sequence of intervals T on [0, ) 3. a random counting measure N on R Interpretations: 1. Event times: T = (...,t 1,t 2,...) is a sequence of event times. 2. Interevent times: T = (...,τ 1,τ 2,...) is a sequence of non-negative random variables interevent times. 3. Number of events: N(A) counts the number of events falling in any Borel set A R. All three definitions are equivalent. Simple (or orderly) point process: We only consider cases where no events occur at the same time with probability one. In practice we often consider a point process defined on an interval of finite length. 3/10

4 Evolutionarity, history and interevent times Evolutionarity: what happens in the present depends only on the past, not the future. History: H t = (...,t 1, t 2,...,t n ) is a vector of all past events t i < t. We can define a point process by the distribution of all interevent times, τ n = t n t n 1, with density function f (t) = f (t H t ) The is a sloppy (but convenient) notation for conditioning on the history. Likelihood function: f (...,t 1, t 2,...) = i f (t i H ti ) = i f (t i ) 4/10

5 A simple examples using interevent time distributions Renewal process: A point process where all the interevent times have i.i.d. distributions. Homogeneous Poisson process: Special case of renewal process with exponential distributed interevent time. Wold process: generalization of renewal process where the interevent times is a homogeneous Markov chain. Note: here f (t) only depends on the last event before time t (renewal/poisson process) or two last events (Wold process). However, more complicated processes are not handled well by specifying the interevent time distribution. 5/10

6 The conditional intensity function Conditional intensity (/risk/rate/hazard) function: λ (t) = f (t) 1 F (t) f (t) is the density function and F (t) is the distribution function of the interevent times. Interpretation: λ (t)dt E[N(dt) H t ] Integrated conditional intensity function: Λ (t) = t 0 λ (s)ds The conditional intensity function for a renewal or Wold process can easily be found using the above equation. (inhomogeneous) Poisson process: if λ (t) = λ(t) is independent of H t we get the Poisson process with intensity λ(t) 6/10

7 Example: Hawkes process Hawkes process: λ (t) = µ + t i <t γ(t t i ) where γ(t) 0, e.g. γ(t) = α exp( βt) This produces clustered point patterns. This model can also be defined as a model with Immigrants: T0 Poisson(µ, R) 1. order offspring: Each immigrant ti T 0 gives birth to T i,1 Poisson(αγ( t i ), R), and T 1 = i T i,1 2. order offspring: Each immigrant tj T 1 gives birth to T j,2 Poisson(αγ( t j ), R), and T 2 = j T j,2 And so on... µ is called immigration rate, γ is called offspring rate This is a model for reproducing populations, e.g. earthquakes, plants or viruses. 7/10

8 Can we choose any function as conditional intensity? Proposition: A conditional intensity function λ (t) uniquely defines a point process if it satisfies the following conditions for all t and all possible point patterns before t: 1. λ (t) is well-defined and non-negative, 2. the integral t t n λ (s)ds is well-defined, 3. t t n λ (s)ds for t. Lemma: ( t ) f (t) = λ (t)exp ( F (t) = 1 exp λ (s)ds t n ) λ (s)ds t n For finite point processes (i.e. a finite number of points with probability one), we drop item 3. in the proposition. t 8/10

9 The marked case History: In the marked case the marks are also included in the history H t = (...,(t 1, κ 1 ), (t 2, κ 2 ),...,(t n, κ n )). Definition: Conditional intensity function: Thus λ (t, κ) = λ (t)f (κ t) λ (t, κ) = λ (t)f (κ t) = f (t)f (κ t) 1 F (t) = f (t, κ) 1 F (t) Note: F (t) is only the distribution function for time (not mark), but may still depend on previous marks. Unpredictable marks: f (κ t) does not depend on the past. Independent marks: f (κ t) does not depend on the past or future (= future does not depend on marks). 9/10

10 Example: ETAS model The ETAS model is a marked Hawkes process with conditional intensity function ( λ (t, κ) = µ + α ) e βκ i e γ(t t i) δe δκ. t i <t Or equivalently, with ground intensity λ (t) = µ + α t i <t e βκ i e γ(t t i), and (conditional) mark density f (κ t) = δe δκ. 10/10

Temporal point processes: the conditional intensity function

Temporal point processes: the conditional intensity function Temporal point processes: the conditional intensity function Jakob Gulddahl Rasmussen December 21, 2009 Contents 1 Introduction 2 2 Evolutionary point processes 2 2.1 Evolutionarity..............................

More information

High-frequency data modelling using Hawkes processes

High-frequency data modelling using Hawkes processes High-frequency data modelling using Hawkes processes Valérie Chavez-Demoulin 1 joint work J.A McGill 1 Faculty of Business and Economics, University of Lausanne, Switzerland Boulder, April 2016 Boulder,

More information

High-frequency data modelling using Hawkes processes

High-frequency data modelling using Hawkes processes Valérie Chavez-Demoulin joint work with High-frequency A.C. Davison data modelling and using A.J. Hawkes McNeil processes(2005), J.A EVT2013 McGill 1 /(201 High-frequency data modelling using Hawkes processes

More information

PERFECT SIMULATION OF HAWKES PROCESSES

PERFECT SIMULATION OF HAWKES PROCESSES 1 December 24 PERFECT SIMULATION OF HAWKES PROCESSES JESPER MØLLER, Aalborg University JAKOB G. RASMUSSEN, Aalborg University Abstract This article concerns a perfect simulation algorithm for unmarked

More information

T. Liggett Mathematics 171 Final Exam June 8, 2011

T. Liggett Mathematics 171 Final Exam June 8, 2011 T. Liggett Mathematics 171 Final Exam June 8, 2011 1. The continuous time renewal chain X t has state space S = {0, 1, 2,...} and transition rates (i.e., Q matrix) given by q(n, n 1) = δ n and q(0, n)

More information

Continuous-Time Markov Chain

Continuous-Time Markov Chain Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),

More information

Poisson Point Processes

Poisson Point Processes Poisson Point Processes Tuesday, April 22, 2014 2:00 PM Homework 4 posted; due Wednesday, May 7. We'll begin with Poisson point processes in one dimension which actually are an example of both a Poisson

More information

Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t

Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t 2.2 Filtrations Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of σ algebras {F t } such that F t F and F t F t+1 for all t = 0, 1,.... In continuous time, the second condition

More information

Stochastic Modelling Unit 1: Markov chain models

Stochastic Modelling Unit 1: Markov chain models Stochastic Modelling Unit 1: Markov chain models Russell Gerrard and Douglas Wright Cass Business School, City University, London June 2004 Contents of Unit 1 1 Stochastic Processes 2 Markov Chains 3 Poisson

More information

Introduction to queuing theory

Introduction to queuing theory Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave

More information

Chapter 8 - Extensions of the basic HMM

Chapter 8 - Extensions of the basic HMM Chapter 8 - Extensions of the basic HMM 02433 - Hidden Markov Models Martin Wæver Pedersen, Henrik Madsen 28 March, 2011 MWP, compiled March 31, 2011 Extensions Second-order underlying Markov chain. Multinomial-like

More information

Lecture 20: Reversible Processes and Queues

Lecture 20: Reversible Processes and Queues Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n

More information

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18. IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas

More information

PROBABILITY DISTRIBUTIONS

PROBABILITY DISTRIBUTIONS Review of PROBABILITY DISTRIBUTIONS Hideaki Shimazaki, Ph.D. http://goo.gl/visng Poisson process 1 Probability distribution Probability that a (continuous) random variable X is in (x,x+dx). ( ) P x < X

More information

1 A Tutorial on Hawkes Processes

1 A Tutorial on Hawkes Processes 1 A Tutorial on Hawkes Processes for Events in Social Media arxiv:1708.06401v2 [stat.ml] 9 Oct 2017 Marian-Andrei Rizoiu, The Australian National University; Data61, CSIRO Young Lee, Data61, CSIRO; The

More information

Simulation of point process using MCMC

Simulation of point process using MCMC Simulation of point process using MCMC Jakob G. Rasmussen Department of Mathematics Aalborg University Denmark March 2, 2011 1/14 Today When do we need MCMC? Case 1: Fixed number of points Metropolis-Hastings,

More information

Poisson Processes. Stochastic Processes. Feb UC3M

Poisson Processes. Stochastic Processes. Feb UC3M Poisson Processes Stochastic Processes UC3M Feb. 2012 Exponential random variables A random variable T has exponential distribution with rate λ > 0 if its probability density function can been written

More information

The exponential distribution and the Poisson process

The exponential distribution and the Poisson process The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]

More information

Normalising constants and maximum likelihood inference

Normalising constants and maximum likelihood inference Normalising constants and maximum likelihood inference Jakob G. Rasmussen Department of Mathematics Aalborg University Denmark March 9, 2011 1/14 Today Normalising constants Approximation of normalising

More information

Lecture 10: Semi-Markov Type Processes

Lecture 10: Semi-Markov Type Processes Lecture 1: Semi-Markov Type Processes 1. Semi-Markov processes (SMP) 1.1 Definition of SMP 1.2 Transition probabilities for SMP 1.3 Hitting times and semi-markov renewal equations 2. Processes with semi-markov

More information

MS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 7

MS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 7 MS&E 321 Spring 12-13 Stochastic Systems June 1, 213 Prof. Peter W. Glynn Page 1 of 7 Section 9: Renewal Theory Contents 9.1 Renewal Equations..................................... 1 9.2 Solving the Renewal

More information

Renewal theory and its applications

Renewal theory and its applications Renewal theory and its applications Stella Kapodistria and Jacques Resing September 11th, 212 ISP Definition of a Renewal process Renewal theory and its applications If we substitute the Exponentially

More information

The Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation.

The Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation. The Distributions of Stopping Times For Ordinary And Compound Poisson Processes With Non-Linear Boundaries: Applications to Sequential Estimation. Binghamton University Department of Mathematical Sciences

More information

Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3. A renewal process is a generalization of the Poisson point process.

Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3. A renewal process is a generalization of the Poisson point process. Renewal Processes Wednesday, December 16, 2015 1:02 PM Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3 A renewal process is a generalization of the Poisson point process. The Poisson point process is completely

More information

IEOR 6711, HMWK 5, Professor Sigman

IEOR 6711, HMWK 5, Professor Sigman IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.

More information

arxiv: v1 [math.st] 21 Dec 2018

arxiv: v1 [math.st] 21 Dec 2018 Point processes on directed linear network Jakob G. Rasmussen Heidi S. Christensen December 21, 218 arxiv:1812.971v1 [math.st] 21 Dec 218 Abstract In this paper we consider point processes specified on

More information

stochnotes Page 1

stochnotes Page 1 stochnotes110308 Page 1 Kolmogorov forward and backward equations and Poisson process Monday, November 03, 2008 11:58 AM How can we apply the Kolmogorov equations to calculate various statistics of interest?

More information

EE126: Probability and Random Processes

EE126: Probability and Random Processes EE126: Probability and Random Processes Lecture 18: Poisson Process Abhay Parekh UC Berkeley March 17, 2011 1 1 Review 2 Poisson Process 2 Bernoulli Process An arrival process comprised of a sequence of

More information

Data analysis and stochastic modeling

Data analysis and stochastic modeling Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt

More information

A hidden semi-markov model for the occurrences of water pipe bursts

A hidden semi-markov model for the occurrences of water pipe bursts A hidden semi-markov model for the occurrences of water pipe bursts T. Economou 1, T.C. Bailey 1 and Z. Kapelan 1 1 School of Engineering, Computer Science and Mathematics, University of Exeter, Harrison

More information

Simulation and Calibration of a Fully Bayesian Marked Multidimensional Hawkes Process with Dissimilar Decays

Simulation and Calibration of a Fully Bayesian Marked Multidimensional Hawkes Process with Dissimilar Decays Simulation and Calibration of a Fully Bayesian Marked Multidimensional Hawkes Process with Dissimilar Decays Kar Wai Lim, Young Lee, Leif Hanlen, Hongbiao Zhao Australian National University Data61/CSIRO

More information

Exponential Distribution and Poisson Process

Exponential Distribution and Poisson Process Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential

More information

CDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical

CDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one

More information

Birth-Death Processes

Birth-Death Processes Birth-Death Processes Birth-Death Processes: Transient Solution Poisson Process: State Distribution Poisson Process: Inter-arrival Times Dr Conor McArdle EE414 - Birth-Death Processes 1/17 Birth-Death

More information

Statistics 150: Spring 2007

Statistics 150: Spring 2007 Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities

More information

Point process models for earthquakes with applications to Groningen and Kashmir data

Point process models for earthquakes with applications to Groningen and Kashmir data Point process models for earthquakes with applications to Groningen and Kashmir data Marie-Colette van Lieshout colette@cwi.nl CWI & Twente The Netherlands Point process models for earthquakes with applications

More information

Figure 10.1: Recording when the event E occurs

Figure 10.1: Recording when the event E occurs 10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable

More information

On oscillating systems of interacting neurons

On oscillating systems of interacting neurons Susanne Ditlevsen Eva Löcherbach Nice, September 2016 Oscillations Most biological systems are characterized by an intrinsic periodicity : 24h for the day-night rhythm of most animals, etc... In other

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

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011 Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions

More information

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Ioannis Glaropoulos November 4, 2012 1 Exercise 3.2 Consider a birth-death process with 3 states, where the transition rate

More information

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes? IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only

More information

PoissonprocessandderivationofBellmanequations

PoissonprocessandderivationofBellmanequations APPENDIX B PoissonprocessandderivationofBellmanequations 1 Poisson process Let us first define the exponential distribution Definition B1 A continuous random variable X is said to have an exponential distribution

More information

Mechanistic spatio-temporal point process models for marked point processes, with a view to forest stand data

Mechanistic spatio-temporal point process models for marked point processes, with a view to forest stand data Aalborg Universitet Mechanistic spatio-temporal point process models for marked point processes, with a view to forest stand data Møller, Jesper; Ghorbani, Mohammad; Rubak, Ege Holger Publication date:

More information

AN EM ALGORITHM FOR HAWKES PROCESS

AN EM ALGORITHM FOR HAWKES PROCESS AN EM ALGORITHM FOR HAWKES PROCESS Peter F. Halpin new york university December 17, 2012 Correspondence should be sent to Dr. Peter F. Halpin 246 Greene Street, Office 316E New York, NY 10003-6677 E-Mail:

More information

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days? IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross

More information

Queuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011

Queuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011 Queuing Theory Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Queuing Theory STAT 870 Summer 2011 1 / 15 Purposes of Today s Lecture Describe general

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 6

MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and

More information

FDST Markov Chain Models

FDST Markov Chain Models FDST Markov Chain Models Tuesday, February 11, 2014 2:01 PM Homework 1 due Friday, February 21 at 2 PM. Reading: Karlin and Taylor, Sections 2.1-2.3 Almost all of our Markov chain models will be time-homogenous,

More information

6.041/6.431 Fall 2010 Final Exam Wednesday, December 15, 9:00AM - 12:00noon.

6.041/6.431 Fall 2010 Final Exam Wednesday, December 15, 9:00AM - 12:00noon. 6.041/6.431 Fall 2010 Final Exam Wednesday, December 15, 9:00AM - 12:00noon. DO NOT TURN THIS PAGE OVER UNTIL YOU ARE TOLD TO DO SO Name: Recitation Instructor: TA: Question Score Out of 1.1 4 1.2 4 1.3

More information

Part I Stochastic variables and Markov chains

Part I Stochastic variables and Markov chains Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)

More information

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution

More information

Statistics & Data Sciences: First Year Prelim Exam May 2018

Statistics & Data Sciences: First Year Prelim Exam May 2018 Statistics & Data Sciences: First Year Prelim Exam May 2018 Instructions: 1. Do not turn this page until instructed to do so. 2. Start each new question on a new sheet of paper. 3. This is a closed book

More information

Limit theorems for dependent regularly varying functions of Markov chains

Limit theorems for dependent regularly varying functions of Markov chains Limit theorems for functions of with extremal linear behavior Limit theorems for dependent regularly varying functions of In collaboration with T. Mikosch Olivier Wintenberger wintenberger@ceremade.dauphine.fr

More information

Readings: Finish Section 5.2

Readings: Finish Section 5.2 LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout

More information

Erdős-Renyi random graphs basics

Erdős-Renyi random graphs basics Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between

More information

Dynamic network sampling

Dynamic network sampling Dynamic network sampling Steve Thompson Simon Fraser University thompson@sfu.ca Graybill Conference Colorado State University June 10, 2013 Dynamic network sampling The population of interest has spatial

More information

Fast MCMC sampling for Markov jump processes and extensions

Fast MCMC sampling for Markov jump processes and extensions Fast MCMC sampling for Markov jump processes and extensions Vinayak Rao and Yee Whye Teh Rao: Department of Statistical Science, Duke University Teh: Department of Statistics, Oxford University Work done

More information

Intro to Probability Instructor: Alexandre Bouchard

Intro to Probability Instructor: Alexandre Bouchard www.stat.ubc.ca/~bouchard/courses/stat302-sp2017-18/ Intro to Probability Instructor: Alexandre Bouchard Info on midterm CALCULATOR: only NON-programmable, NON-scientific, NON-graphing (and of course,

More information

The story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes

The story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes The story of the film so far... Mathematics for Informatics 4a José Figueroa-O Farrill Lecture 19 28 March 2012 We have been studying stochastic processes; i.e., systems whose time evolution has an element

More information

Controlling conventional generation to minimize forecast error cost

Controlling conventional generation to minimize forecast error cost Controlling conventional generation to minimize forecast error cost Ksenia Chernysh Heriot-Watt University xeniachernysh@gmailcom 25 April 2013 Ksenia Chernysh (Heriot-Watt University) Controlling conventional

More information

The random counting variable. Barbara Russo

The random counting variable. Barbara Russo The random counting variable Barbara Russo Counting Random Variable } Until now we have seen the point process through two sets of random variables } T i } X i } We introduce a new random variable the

More information

Temporal Models.

Temporal Models. Temporal Models www.cs.wisc.edu/~page/cs760/ Goals for the lecture (with thanks to Irene Ong, Stuart Russell and Peter Norvig, Jakob Rasmussen, Jeremy Weiss, Yujia Bao, Charles Kuang, Peggy Peissig, and

More information

The cost/reward formula has two specific widely used applications:

The cost/reward formula has two specific widely used applications: Applications of Absorption Probability and Accumulated Cost/Reward Formulas for FDMC Friday, October 21, 2011 2:28 PM No class next week. No office hours either. Next class will be 11/01. The cost/reward

More information

Exercises in Extreme value theory

Exercises in Extreme value theory Exercises in Extreme value theory 2016 spring semester 1. Show that L(t) = logt is a slowly varying function but t ǫ is not if ǫ 0. 2. If the random variable X has distribution F with finite variance,

More information

Section 7.3: Continuous RV Applications

Section 7.3: Continuous RV Applications Section 7.3: Continuous RV Applications Discrete-Event Simulation: A First Course c 2006 Pearson Ed., Inc. 0-13-142917-5 Discrete-Event Simulation: A First Course Section 7.3: Continuous RV Applications

More information

Efficient Monitoring Algorithm for Fast News Alert

Efficient Monitoring Algorithm for Fast News Alert Efficient Monitoring Algorithm for Fast News Alert Ka Cheung Richard Sia kcsia@cs.ucla.edu UCLA Backgroud Goal Monitor and collect information from the Web Answer most of users queries Challenges Billions

More information

Math 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time

Math 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time Math 416 Lecture 11 Math 416 Lecture 16 Exam 2 next time Birth and death processes, queueing theory In arrival processes, the state only jumps up. In a birth-death process, it can either jump up or down

More information

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

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

More information

Bayesian Inference for Clustered Extremes

Bayesian Inference for Clustered Extremes Newcastle University, Newcastle-upon-Tyne, U.K. lee.fawcett@ncl.ac.uk 20th TIES Conference: Bologna, Italy, July 2009 Structure of this talk 1. Motivation and background 2. Review of existing methods Limitations/difficulties

More information

Limit theorems for Hawkes processes

Limit theorems for Hawkes processes Limit theorems for nearly unstable and Mathieu Rosenbaum Séminaire des doctorants du CMAP Vendredi 18 Octobre 213 Limit theorems for 1 Denition and basic properties Cluster representation of Correlation

More information

Continuous-time Markov Chains

Continuous-time Markov Chains Continuous-time Markov Chains Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ October 23, 2017

More information

Bernoulli Counting Process with p=0.1

Bernoulli Counting Process with p=0.1 Stat 28 October 29, 21 Today: More Ch 7 (Sections 7.4 and part of 7.) Midterm will cover Ch 7 to section 7.4 Review session will be Nov. Exercises to try (answers in book): 7.1-, 7.2-3, 7.3-3, 7.4-7 Where

More information

Assignment 3 with Reference Solutions

Assignment 3 with Reference Solutions Assignment 3 with Reference Solutions Exercise 3.: Poisson Process Given are k independent sources s i of jobs as shown in the figure below. The interarrival time between jobs for each source is exponentially

More information

Theory of earthquake recurrence times

Theory of earthquake recurrence times Theory of earthquake recurrence times Alex SAICHEV1,2 and Didier SORNETTE1,3 1ETH Zurich, Switzerland 2Mathematical Department, Nizhny Novgorod State University, Russia. 3Institute of Geophysics and Planetary

More information

Stat 150 Practice Final Spring 2015

Stat 150 Practice Final Spring 2015 Stat 50 Practice Final Spring 205 Instructor: Allan Sly Name: SID: There are 8 questions. Attempt all questions and show your working - solutions without explanation will not receive full credit. Answer

More information

Point processes, temporal

Point processes, temporal Point processes, temporal David R. Brillinger, Peter M. Guttorp & Frederic Paik Schoenberg Volume 3, pp 1577 1581 in Encyclopedia of Environmetrics (ISBN 0471 899976) Edited by Abdel H. El-Shaarawi and

More information

POINT PROCESSES. Frederic Paik Schoenberg. UCLA Department of Statistics, MS Los Angeles, CA

POINT PROCESSES. Frederic Paik Schoenberg. UCLA Department of Statistics, MS Los Angeles, CA POINT PROCESSES Frederic Paik Schoenberg UCLA Department of Statistics, MS 8148 Los Angeles, CA 90095-1554 frederic@stat.ucla.edu July 2000 1 A point process is a random collection of points falling in

More information

Branching Processes II: Convergence of critical branching to Feller s CSB

Branching Processes II: Convergence of critical branching to Feller s CSB Chapter 4 Branching Processes II: Convergence of critical branching to Feller s CSB Figure 4.1: Feller 4.1 Birth and Death Processes 4.1.1 Linear birth and death processes Branching processes can be studied

More information

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv

More information

Probability Distributions

Probability Distributions Lecture : Background in Probability Theory Probability Distributions The probability mass function (pmf) or probability density functions (pdf), mean, µ, variance, σ 2, and moment generating function (mgf)

More information

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

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

More information

Decomposition of variance for spatial Cox processes

Decomposition of variance for spatial Cox processes Decomposition of variance for spatial Cox processes Rasmus Waagepetersen Department of Mathematical Sciences Aalborg University Joint work with Abdollah Jalilian and Yongtao Guan December 13, 2010 1/25

More information

An M/M/1 Queue in Random Environment with Disasters

An M/M/1 Queue in Random Environment with Disasters An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,

More information

Other properties of M M 1

Other properties of M M 1 Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected

More information

Markov processes and queueing networks

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

More information

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Queueing Theory. VK Room: M Last updated: October 17, 2013. Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server

More information

Measuring Student Engagement During Collaboration

Measuring Student Engagement During Collaboration Measuring Student Engagement During Collaboration Peter F. Halpin Joint work with Alina von Davier 1 / 53 Outline Part 1: An overview of temporal point processes 1 Step 1 Defining and detecting dependence

More information

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010 Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]

More information

P (L d k = n). P (L(t) = n),

P (L d k = n). P (L(t) = n), 4 M/G/1 queue In the M/G/1 queue customers arrive according to a Poisson process with rate λ and they are treated in order of arrival The service times are independent and identically distributed with

More information

Lecture 9 Point Processes

Lecture 9 Point Processes Lecture 9 Point Processes Dennis Sun Stats 253 July 21, 2014 Outline of Lecture 1 Last Words about the Frequency Domain 2 Point Processes in Time and Space 3 Inhomogeneous Poisson Processes 4 Second-Order

More information

arxiv:math/ v1 [math.pr] 6 Jun 2003

arxiv:math/ v1 [math.pr] 6 Jun 2003 ECOLOGICAL SUCCESSION MODEL By Nicolas Lanchier Université de Rouen arxiv:math/0306113v1 [math.pr] 6 Jun 003 Abstract We introduce in this paper a new interacting particle system intended to model an example

More information

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam. Final Examination Closed book. 120 minutes. Cover page plus five pages of exam. To receive full credit, show enough work to indicate your logic. Do not spend time calculating. You will receive full credit

More information

LECTURE #6 BIRTH-DEATH PROCESS

LECTURE #6 BIRTH-DEATH PROCESS LECTURE #6 BIRTH-DEATH PROCESS 204528 Queueing Theory and Applications in Networks Assoc. Prof., Ph.D. (รศ.ดร. อน นต ผลเพ ม) Computer Engineering Department, Kasetsart University Outline 2 Birth-Death

More information

1 Delayed Renewal Processes: Exploiting Laplace Transforms

1 Delayed Renewal Processes: Exploiting Laplace Transforms IEOR 6711: Stochastic Models I Professor Whitt, Tuesday, October 22, 213 Renewal Theory: Proof of Blackwell s theorem 1 Delayed Renewal Processes: Exploiting Laplace Transforms The proof of Blackwell s

More information

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

POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS

POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS POISSON PROCESSES 1. THE LAW OF SMALL NUMBERS 1.1. The Rutherford-Chadwick-Ellis Experiment. About 90 years ago Ernest Rutherford and his collaborators at the Cavendish Laboratory in Cambridge conducted

More information

Filtrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition

Filtrations, Markov Processes and Martingales. Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition Filtrations, Markov Processes and Martingales Lectures on Lévy Processes and Stochastic Calculus, Braunschweig, Lecture 3: The Lévy-Itô Decomposition David pplebaum Probability and Statistics Department,

More information