Displaying similar documents to “Fitting traffic traces with discrete canonical phase type distributions and markov arrival processes”

On absorption times and Dirichlet eigenvalues

Laurent Miclo (2010)

ESAIM: Probability and Statistics

Similarity:

This paper gives a stochastic representation in spectral terms for the absorption time of a finite Markov chain which is irreducible and reversible outside the absorbing point. This yields quantitative informations on the parameters of a similar representation due to O'Cinneide for general chains admitting real eigenvalues. In the discrete time setting, if the underlying Dirichlet eigenvalues (namely the eigenvalues of the Markov transition operator restricted to the functions vanishing...

A Markov chain model for traffic equilibrium problems

Giandomenico Mastroeni (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We consider a stochastic approach in order to define an equilibrium model for a traffic-network problem. In particular, we assume a markovian behaviour of the users in their movements throughout the zones of the traffic area. This assumption turns out to be effective at least in the context of urban traffic, where, in general, the users tend to travel by choosing the path they find more convenient and not necessarily depending on the already travelled part. The developed model is a homogeneous...

Central limit theorem for hitting times of functionals of Markov jump processes

Christian Paroissin, Bernard Ycart (2004)

ESAIM: Probability and Statistics

Similarity:

A sample of i.i.d. continuous time Markov chains being defined, the sum over each component of a real function of the state is considered. For this functional, a central limit theorem for the first hitting time of a prescribed level is proved. The result extends the classical central limit theorem for order statistics. Various reliability models are presented as examples of applications.

Eigenanalysis and metric multidimensional scaling on hierarchical structures.

Carles Maria Cuadras, Josep-Maria Oller (1987)

Qüestiió

Similarity:

The known hierarchical clustering scheme is equivalent to the concept of ultrametric distance. Every distance can be represented in a spatial model using multidimensional scaling. We relate both classes of representations of proximity data in an algebraic way, obtaining some results and relations on clusters and the eigenvalues of the inner product matrix for an ultrametric distance. Principal coordinate analysis on an ultrametric distance gives two classes of independent coordinates,...