Bridges of Markov counting processes: quantitative estimates
From MaRDI portal
Abstract: In this paper we investigate the behavior of the bridges of a Markov counting process in several directions. We first characterize convexity(concavity) in time of the mean value in terms of lower (upper) bounds on the so called extit{reciprocal characteristics}. This result gives a natural criterion to determine whether bridges are "lazy" or "hurried". Under the hypothesis of global bounds on the reciprocal characteristics we prove sharp estimates for the marginal distributions and a comparison theorem for the jump times. When the height of the bridge tends to infinity we show the convergence to a deterministic curve, after a proper rescaling.
Recommendations
Cited in
(7)- Markovian bridges: weak continuity and pathwise constructions
- Markov Bridges, Bisection and Variance Reduction
- Fluctuations of bridges, reciprocal characteristics and concentration of measure
- Bridges of Markov counting processes. Reciprocal classes and duality formulas
- Latency and liquidity risk
- Large deviations for Markov bridges with jumps
- (Homogeneous) Markovian bridges
This page was built for publication: Bridges of Markov counting processes: quantitative estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287801)
