scholarly journals The (True) Concurrent Markov Property and Some Applications to Markov Nets

2005 ◽  
pp. 70-89 ◽  
Author(s):  
Samy Abbes
Keyword(s):  
Markov Property

A review of multistate modelling approaches in monitoring disease progression: Bayesian estimation using the Kolmogorov-Chapman forward equations

2021 ◽  
pp. 096228022199750
Author(s):  
Zvifadzo Matsena Zingoni ◽  
Tobias F Chirwa ◽  
Jim Todd ◽  
Eustasius Musenge
Keyword(s):  
Bayesian Estimation ◽  
Transition Probabilities ◽  
Markov Property ◽  
Likelihood Estimation ◽  
Single Individual ◽  
Transition Rates ◽  
Multistate Models ◽  
Time To Event ◽  
Modeling Framework ◽  
Forward Equations

There are numerous fields of science in which multistate models are used, including biomedical research and health economics. In biomedical studies, these stochastic continuous-time models are used to describe the time-to-event life history of an individual through a flexible framework for longitudinal data. The multistate framework can describe more than one possible time-to-event outcome for a single individual. The standard estimation quantities in multistate models are transition probabilities and transition rates which can be mapped through the Kolmogorov-Chapman forward equations from the Bayesian estimation perspective. Most multistate models assume the Markov property and time homogeneity; however, if these assumptions are violated, an extension to non-Markovian and time-varying transition rates is possible. This manuscript extends reviews in various types of multistate models, assumptions, methods of estimation and data features compatible with fitting multistate models. We highlight the contrast between the frequentist (maximum likelihood estimation) and the Bayesian estimation approaches in the multistate modeling framework and point out where the latter is advantageous. A partially observed and aggregated dataset from the Zimbabwe national ART program was used to illustrate the use of Kolmogorov-Chapman forward equations. The transition rates from a three-stage reversible multistate model based on viral load measurements in WinBUGS were reported.

scholarly journals CLASSICAL MARKOV PROCESSES FROM QUANTUM LÉVY PROCESSES

1999 ◽  
Vol 02 (01) ◽  
pp. 105-129 ◽  
Author(s):  
UWE FRANZ
Keyword(s):  
Markov Process ◽  
Hopf Algebra ◽  
Markov Processes ◽  
Lévy Processes ◽  
Sufficient Conditions ◽  
Markov Property ◽  
Vacuum State ◽  
Levy Processes ◽  
Quantum Process ◽  
Quantum Markov Processes

We show how classical Markov processes can be obtained from quantum Lévy processes. It is shown that quantum Lévy processes are quantum Markov processes, and sufficient conditions for restrictions to subalgebras to remain quantum Markov processes are given. A classical Markov process (which has the same time-ordered moments as the quantum process in the vacuum state) exists whenever we can restrict to a commutative subalgebra without losing the quantum Markov property.8 Several examples, including the Azéma martingale, with explicit calculations are presented. In particular, the action of the generator of the classical Markov processes on polynomials or their moments are calculated using Hopf algebra duality.

The distributional structure of finite moving-average processes

1988 ◽  
Vol 25 (02) ◽  
pp. 313-321 ◽  
Author(s):  
ED McKenzie
Keyword(s):  
Moving Average ◽  
Markov Property ◽  
Covariance Structure ◽  
Time Reversibility ◽  
Linear Processes ◽  
Joint Distributions ◽  
Moving Average Processes ◽  
Standard Models ◽  
Non Gaussian ◽  
Analysis Of Time Series

Analysis of time-series models has, in the past, concentrated mainly on second-order properties, i.e. the covariance structure. Recent interest in non-Gaussian and non-linear processes has necessitated exploration of more general properties, even for standard models. We demonstrate that the powerful Markov property which greatly simplifies the distributional structure of finite autoregressions has an analogue in the (non-Markovian) finite moving-average processes. In fact, all the joint distributions of samples of a qth-order moving average may be constructed from only the (q + 1)th-order distribution. The usefulness of this result is illustrated by references to three areas of application: time-reversibility; asymptotic behaviour; and sums and associated point and count processes. Generalizations of the result are also considered.

scholarly journals Markov properties of cluster processes

1996 ◽  
Vol 28 (2) ◽  
pp. 346-355 ◽  
Author(s):  
A. J. Baddeley ◽  
M. N. M. Van Lieshout ◽  
J. Møller
Keyword(s):  
Poisson Process ◽  
Point Process ◽  
Markov Property ◽  
Nearest Neighbour ◽  
Finite Range ◽  
Cluster Process ◽  
Cluster Point Process ◽  
Poisson Cluster ◽  
Markov Properties ◽  
Uniformly Bounded

We show that a Poisson cluster point process is a nearest-neighbour Markov point process [2] if the clusters have uniformly bounded diameter. It is typically not a finite-range Markov point process in the sense of Ripley and Kelly [12]. Furthermore, when the parent Poisson process is replaced by a Markov or nearest-neighbour Markov point process, the resulting cluster process is also nearest-neighbour Markov, provided all clusters are non-empty. In particular, the nearest-neighbour Markov property is preserved when points of the process are independently randomly translated, but not when they are randomly thinned.

scholarly journals Homogeneity and the Strong Markov Property

1987 ◽  
Vol 15 (1) ◽  
pp. 213-240 ◽  
Author(s):  
Olav Kallenberg
Keyword(s):  
Markov Property ◽  
Strong Markov Property ◽  
Strong Markov

scholarly journals BERGMAN KERNELS AND EQUILIBRIUM MEASURES FOR POLARIZED PSEUDO-CONCAVE DOMAINS

2010 ◽  
Vol 21 (01) ◽  
pp. 77-115 ◽  
Author(s):  
ROBERT J. BERMAN
Keyword(s):  
Toeplitz Operators ◽  
Equilibrium Measure ◽  
Markov Property ◽  
General Setting ◽  
Space Structure ◽  
Tensor Power ◽  
Bergman Kernels ◽  
Equilibrium Measures ◽  
Holomorphic Sections ◽  
Positive Line Bundle

Let X be a domain in a closed polarized complex manifold (Y,L), where L is a (semi-) positive line bundle over Y. Any given Hermitian metric on L induces by restriction to X a Hilbert space structure on the space of global holomorphic sections on Y with values in the k-th tensor power of L (also using a volume form ωn on X. In this paper the leading large k asymptotics for the corresponding Bergman kernels and metrics are obtained in the case when X is a pseudo-concave domain with smooth boundary (under a certain compatibility assumption). The asymptotics are expressed in terms of the curvature of L and the boundary of X. The convergence of the Bergman metrics is obtained in a more general setting where (X,ωn) is replaced by any measure satisfying a Bernstein–Markov property. As an application the (generalized) equilibrium measure of the polarized pseudo-concave domain X is computed explicitly. Applications to the zero and mass distribution of random holomorphic sections and the eigenvalue distribution of Toeplitz operators will be described elsewhere.

scholarly journals Congested Link Inference Algorithms in Dynamic Routing IP Network

2017 ◽  
Vol 2017 ◽  
pp. 1-17
Author(s):  
Yu Chen ◽  
Zhe-min Duan
Keyword(s):  
Markov Property ◽  
Variable Structure ◽  
Dynamic Routing ◽  
Simplified Model ◽  
Maximum A Posteriori ◽  
A Posteriori ◽  
Bayesian Network Model ◽  
Inference Algorithms ◽  
Ip Network ◽  
Link Congestion

The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB) network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP) and Rest Bayesian Network Model (RBNM), we proposed an Improved CLINK (ICLINK) algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient) to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

Sign in / Sign up

Export Citation Format

Share Document