scholarly journals Extensions of Markov Modulated Poisson Processes  and Their Applications to Deep Earthquakes

2021 ◽  
Author(s):  
◽  
Shaochuan Lu

<p>The focus of this thesis is on the Markov modulated Poisson process (MMPP) and its extensions, aiming to propose appropriate statistical models for the occurrence patterns of main New Zealand deep earthquakes. Such an attempt might be beyond the scope of the MMPP and its extensions, however we hope its main patterns can be characterized by current models proposed in three parts of the thesis. The first part of the thesis is concerned with introductions and preliminaries of discrete time hidden Markov models (HMMs) and MMPP. The  exibility in model formulation and openness in model framework of HMMs are reviewed in this part, suggesting also possible extensions of MMPP. The second part of the thesis is mainly about several extensions of MMPP. One extension of MMPP is by associating each occurrence of MMPP with a mark. Such an extension is potentially useful for spatial-temporal modelling or other point  processes with marks. A special case of this type of extension is by allowing the multiple observations of MMPP synchronized together under the same Markov chain. This extension opens the possibility of modelling multiple point process observations with weak dependence. The third extension is motivated by the attempt to describe small scale temporal clustering existing in the deep earthquakes via treating the recognized aftershocks as marks which itself forms a finite point process. The rest of the second part focuses on some information theoretical aspects of MMPPs such as the entropy rate of the underlying Markov chain and observed point process respectively and their mutual information rate. A conjecture on the possible links between mutual information rate of MMPP and the Fisher information of the estimated parameters is suggested. The second part on extensions of MMPP is featured by the derivation of the likelihood and complete likelihood, parameter estimation via EM algorithm, state smoothing estimation and model evaluation through systematic applications of rescaling theory of multivariate point processes and marked point processes. The third part of the thesis includes the applications of these methods to the deep earthquakes in New Zealand. We first evaluate the data coverage, catalogue completeness and explore its descriptive characteristics and empirical properties such as epicentral distributions, depth distributions and magnitude distributions.  Clustering behavior is studied via the second order moment analysis of point processes in the chapter 8. We also apply, the stress release models and the ETAS models which are usually used for shallow earthquakes, to the New Zealand deep earthquakes and provide tentative explanations of why they are not satisfactory for the deep earth-quakes. The chapter 9 is on the applications of MMPP and its extensions to the New Zealand deep earthquakes. Conclusions and future studies are presented in chapter 10.</p>

2021 ◽  
Author(s):  
◽  
Shaochuan Lu

<p>The focus of this thesis is on the Markov modulated Poisson process (MMPP) and its extensions, aiming to propose appropriate statistical models for the occurrence patterns of main New Zealand deep earthquakes. Such an attempt might be beyond the scope of the MMPP and its extensions, however we hope its main patterns can be characterized by current models proposed in three parts of the thesis. The first part of the thesis is concerned with introductions and preliminaries of discrete time hidden Markov models (HMMs) and MMPP. The  exibility in model formulation and openness in model framework of HMMs are reviewed in this part, suggesting also possible extensions of MMPP. The second part of the thesis is mainly about several extensions of MMPP. One extension of MMPP is by associating each occurrence of MMPP with a mark. Such an extension is potentially useful for spatial-temporal modelling or other point  processes with marks. A special case of this type of extension is by allowing the multiple observations of MMPP synchronized together under the same Markov chain. This extension opens the possibility of modelling multiple point process observations with weak dependence. The third extension is motivated by the attempt to describe small scale temporal clustering existing in the deep earthquakes via treating the recognized aftershocks as marks which itself forms a finite point process. The rest of the second part focuses on some information theoretical aspects of MMPPs such as the entropy rate of the underlying Markov chain and observed point process respectively and their mutual information rate. A conjecture on the possible links between mutual information rate of MMPP and the Fisher information of the estimated parameters is suggested. The second part on extensions of MMPP is featured by the derivation of the likelihood and complete likelihood, parameter estimation via EM algorithm, state smoothing estimation and model evaluation through systematic applications of rescaling theory of multivariate point processes and marked point processes. The third part of the thesis includes the applications of these methods to the deep earthquakes in New Zealand. We first evaluate the data coverage, catalogue completeness and explore its descriptive characteristics and empirical properties such as epicentral distributions, depth distributions and magnitude distributions.  Clustering behavior is studied via the second order moment analysis of point processes in the chapter 8. We also apply, the stress release models and the ETAS models which are usually used for shallow earthquakes, to the New Zealand deep earthquakes and provide tentative explanations of why they are not satisfactory for the deep earth-quakes. The chapter 9 is on the applications of MMPP and its extensions to the New Zealand deep earthquakes. Conclusions and future studies are presented in chapter 10.</p>


1993 ◽  
Vol 30 (02) ◽  
pp. 365-372 ◽  
Author(s):  
Søren Asmussen ◽  
Ger Koole

A Markovian arrival stream is a marked point process generated by the state transitions of a given Markovian environmental process and Poisson arrival rates depending on the environment. It is shown that to a given marked point process there is a sequence of such Markovian arrival streams with the property that as m →∞. Various related corollaries (involving stationarity, convergence of moments and ergodicity) and counterexamples are discussed as well.


1993 ◽  
Vol 30 (2) ◽  
pp. 365-372 ◽  
Author(s):  
Søren Asmussen ◽  
Ger Koole

A Markovian arrival stream is a marked point process generated by the state transitions of a given Markovian environmental process and Poisson arrival rates depending on the environment. It is shown that to a given marked point process there is a sequence of such Markovian arrival streams with the property that as m →∞. Various related corollaries (involving stationarity, convergence of moments and ergodicity) and counterexamples are discussed as well.


1998 ◽  
Vol 35 (2) ◽  
pp. 303-312 ◽  
Author(s):  
Timothy C. Brown ◽  
Kais Hamza ◽  
Aihua Xia

Criteria are determined for the variance to mean ratio to be greater than one (over-dispersed) or less than one (under-dispersed). This is done for random variables which are functions of a Markov chain in continuous time, and for the counts in a simple point process on the line. The criteria for the Markov chain are in terms of the infinitesimal generator and those for the point process in terms of the conditional intensity. Examples include a conjecture of Faddy (1994). The case of time-reversible point processes is particularly interesting, and here underdispersion is not possible. In particular, point processes which arise from Markov chains which are time-reversible, have finitely many states and are irreducible are always overdispersed.


1973 ◽  
Vol 5 (2) ◽  
pp. 262-286 ◽  
Author(s):  
Mats Rudemo

For a continuous time Markov chain the time points of transitions, belonging to a subset of the set of all transitions, are observed. Special cases include the point process generated by all transitions and doubly stochastic Poisson processes with a Markovian intensity. Equations are derived for the conditional distribution of the state of the Markov chain, given observations of the point process. This distribution may be used for prediction. For the forward recurrence time of the point process, distributions corresponding to synchronous and asynchronous sampling are also derived. The Palm distribution for the point process is specified in terms of the corresponding initial distribution for the Markov chain. In examples the point processes of arrivals and departures in a queueing system are studied. Two biological applications deal with estimation of population size and detection of epidemics.


2015 ◽  
Vol 27 (7) ◽  
pp. 1438-1460 ◽  
Author(s):  
Xinyi Deng ◽  
Daniel F. Liu ◽  
Kenneth Kay ◽  
Loren M. Frank ◽  
Uri T. Eden

Point process filters have been applied successfully to decode neural signals and track neural dynamics. Traditionally these methods assume that multiunit spiking activity has already been correctly spike-sorted. As a result, these methods are not appropriate for situations where sorting cannot be performed with high precision, such as real-time decoding for brain-computer interfaces. Because the unsupervised spike-sorting problem remains unsolved, we took an alternative approach that takes advantage of recent insights into clusterless decoding. Here we present a new point process decoding algorithm that does not require multiunit signals to be sorted into individual units. We use the theory of marked point processes to construct a function that characterizes the relationship between a covariate of interest (in this case, the location of a rat on a track) and features of the spike waveforms. In our example, we use tetrode recordings, and the marks represent a four-dimensional vector of the maximum amplitudes of the spike waveform on each of the four electrodes. In general, the marks may represent any features of the spike waveform. We then use Bayes’s rule to estimate spatial location from hippocampal neural activity. We validate our approach with a simulation study and experimental data recorded in the hippocampus of a rat moving through a linear environment. Our decoding algorithm accurately reconstructs the rat’s position from unsorted multiunit spiking activity. We then compare the quality of our decoding algorithm to that of a traditional spike-sorting and decoding algorithm. Our analyses show that the proposed decoding algorithm performs equivalent to or better than algorithms based on sorted single-unit activity. These results provide a path toward accurate real-time decoding of spiking patterns that could be used to carry out content-specific manipulations of population activity in hippocampus or elsewhere in the brain.


2014 ◽  
Vol 10 (S306) ◽  
pp. 239-242
Author(s):  
Radu S. Stoica

AbstractThe cosmic web is the intricate network of filaments outlined by the galaxies positions distribution in our Universe. One possible manner to break the complexity of such an elaborate geometrical structure is to assume it made of simple interacting objects. Under this hypothesis, the filamentary network can be considered as the realization of an object or a marked point process. These processes are probabilistic models dealing with configurations of random objects given by random points having random characteristics or marks. Here, the filamentary network is considered as the realization of such a process, with the objects being cylinders that align and connect in order to form the network. The paper presents the use of marked point processes to the detection and the characterization of the galactic filaments.


1985 ◽  
Vol 17 (01) ◽  
pp. 127-146
Author(s):  
Jagadeesh Chandramohan ◽  
Robert D. Foley ◽  
Ralph L. Disney

Cross-covariances between the Bernoulli thinned processes of an arbitrary point process are determined. When the point process is renewal it is shown that zero correlation implies independence. An example is given to show that zero covariance between intervals does not imply zero covariance between counts. Mark-dependent thinning of Markov renewal processes is discussed and the results are applied to the overflow queue. Here we give an example of two uncorrelated but dependent renewal processes, neither of which is Poisson, which yield a Poisson process when superposed. Finally, we study Markov-chain thinning of renewal processes.


Sign in / Sign up

Export Citation Format

Share Document