Earthquake clusters identification through a Markovian Arrival Process (MAP): Application in Corinth Gulf (Greece)

2020 ◽  
Vol 545 ◽  
pp. 123655
Author(s):  
P. Bountzis ◽  
E. Papadimitriou ◽  
G. Tsaklidis
Keyword(s):  
Markovian Arrival Process ◽  
Arrival Process ◽  
Process Map ◽  
Corinth Gulf ◽  
Earthquake Clusters

scholarly journals Descriptors for point processes based on runs: the Markovian arrival process

1996 ◽  
Vol 9 (4) ◽  
pp. 469-488 ◽  
Author(s):  
Marcel F. Neuts
Keyword(s):  
Point Process ◽  
Point Processes ◽  
General Purpose ◽  
Markovian Arrival Process ◽  
The Other ◽  
Arrival Process ◽  
Qualitative Behavior ◽  
Regular Grid ◽  
Matrix Analytic Methods ◽  
Process Map

This paper is part of a broader investigation of properties of a point process that can be identified by imagining that the process is involved in a competition for the generation of runs of events. The general purpose of that methodology is to quantify the prevalence of gaps and bursts in realizations of the process. The Markovian arrival process (MAP) is highly versatile in qualitative behavior and its analysis is numerically tractable by matrix-analytic methods. It can therefore serve well as a benchmark process in that investigation. In this paper, we consider the MAP and a regular grid competing for runs of lengths at least r1 and r2, respectively. A run of length r in one of the processes is defined as a string of r successive events occurring without an intervening event in the other process.This article is dedicated to the memory of Roland L. Dobrushin.

scholarly journals Transient and stationary characteristics of a packet buffer modelled as an MAP/SM/1/b system

2014 ◽  
Vol 24 (2) ◽  
pp. 429-442 ◽  
Author(s):  
Krzysztof Rusek ◽  
Lucjan Janowski ◽  
Zdzisław Papir
Keyword(s):  
Fixed Number ◽  
Queuing System ◽  
Markovian Arrival Process ◽  
Arrival Process ◽  
Time Interval ◽  
Loss Ratio ◽  
Process Map ◽  
Local Loss ◽  
Proposed Model ◽  
Simulation Results

Abstract A packet buffer limited to a fixed number of packets (regardless of their lengths) is considered. The buffer is described as a finite FIFO queuing system fed by a Markovian Arrival Process (MAP) with service times forming a Semi-Markov (SM) process (MAP /SM /1/b in Kendall’s notation). Such assumptions allow us to obtain new analytical results for the queuing characteristics of the buffer. In the paper, the following are considered: the time to fill the buffer, the local loss intensity, the loss ratio, and the total number of losses in a given time interval. Predictions of the proposed model are much closer to the trace-driven simulation results compared with the prediction of the MAP /G/1/b model.

An application of Markovian arrival process (MAP) to modeling superposed ATM cell streams

2002 ◽  
Vol 50 (4) ◽  
pp. 633-642 ◽  
Author(s):  
S.H. Kang ◽  
Yong Han Kim ◽  
D.K. Sung ◽  
B.D. Choi
Keyword(s):  
Markovian Arrival Process ◽  
Arrival Process ◽  
Process Map ◽  
Atm Cell

scholarly journals Buffer Overflow Period in a MAP Queue

2007 ◽  
Vol 2007 ◽  
pp. 1-18 ◽  
Author(s):  
Andrzej Chydzinski
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Markovian Arrival Process ◽  
Numerical Calculations ◽  
Buffer Overflow ◽  
Arrival Process ◽  
Service Time Distribution ◽  
Process Map ◽  
General Service ◽  
Number Of Cells

The buffer overflow period in a queue with Markovian arrival process (MAP) and general service time distribution is investigated. The results include distribution of the overflow period in transient and stationary regimes and the distribution of the number of cells lost during the overflow interval. All theorems are illustrated via numerical calculations.

scholarly journals Nonidentifiability of the Two-State Markovian Arrival Process

2010 ◽  
Vol 47 (3) ◽  
pp. 630-649 ◽  
Author(s):  
Pepa Ramírez-Cobo ◽  
Rosa E. Lillo ◽  
Michael P. Wiper
Keyword(s):  
Markovian Arrival Process ◽  
Arrival Process ◽  
Process Map

In this paper we consider the problem of identifiability for the two-state Markovian arrival process (MAP2). In particular, we show that the MAP2 is not identifiable, providing the conditions under which two different sets of parameters induce identical stationary laws for the observable process.

Sign in / Sign up

Export Citation Format

Share Document