Related papers: The Likelihood of Mixed Hitting Times
Intermittent demand fluctuations pose significant challenges in disaster logistics and medical supply systems. In this study, we formulate cumulative demand as a generalized L\'evy process composed of a drift term, Poisson jumps, and…
This paper considers an extension of the multivariate symmetric Laplace distribution to matrix variate case. The symmetric Laplace distribution is a scale mixture of normal distribution. The maximum likelihood estimators (MLE) of the…
The first hitting times of a stochastic process, i.e., the first time a process reaches a particular level, are of significant interest across various scientific disciplines, including biology, chemistry, and economics. We modify the…
This paper focuses on hypothesis testing for the input of a L\'evy-driven storage system by sampling of the storage level. As the likelihood is not explicit we propose two tests that rely on transformation of the data. The first approach…
We propose Mecke-Palm formulas for multiple integrals with respect to a Poisson random measure interlaced with its intensity measure. We apply such formulas to multiple mixed L\'evy systems of L\'evy processes and obtain moment formulas for…
We construct in the small-time setting the upper and lower estimates for the transition probability density of a L\'evy process in $\rn$. Our approach relies on the complex analysis technique and the asymptotic analysis of the inverse…
Estimating the mixing density of a latent mixture model is an important task in signal processing. Nonparametric maximum likelihood estimation is one popular approach to this problem. If the latent variable distribution is assumed to be…
In this note, we consider the performance of the classic method of moments for parameter estimation of symmetric variance-gamma (generalized Laplace) distributions. We do this through both theoretical analysis (multivariate delta method)…
In this paper we find the Laplace transforms of the weighted occupation times for a spectrally negative L\'evy surplus process to spend below its running maximum up to the first exit times. The results are expressed in terms of generalized…
In this paper, we will discuss an approximation of the characteristic function of the first passage time for a Levy process using the martingale approach. The characteristic function of the first passage time of the tempered stable process…
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…
This paper aims at semi-parametrically estimating the input process to a L\'evy-driven queue by sampling the workload process at Poisson times. We construct a method-of-moments based estimator for the L\'evy process' characteristic…
For spectrally negative L\'evy processes, we prove several fluctuation results involving a general draw-down time, which is a downward exit time from a dynamic level that depends on the running maximum of the process. In particular, we find…
Let be $X(t)= x - \mu t + \sigma B_t - N_t$ a L$\acute{\text{e}}$vy process starting from $x >0,$ where $ \mu \ge 0, \ \sigma \ge 0, \ B_t$ is a standard BM, and $N_t$ is a homogeneous Poisson process with intensity $ \theta >0,$ starting…
This study introduces a novel approach for learning mixtures of Markov chains, a critical process applicable to various fields, including healthcare and the analysis of web users. Existing research has identified a clear divide in…
Our goal is to estimate the characteristic exponent of the input to a L\'evy-driven storage system from a sample of equispaced workload observations. The estimator relies on an approximate moment equation associated with the…
We consider a wide class of increasing L\'evy processes perturbed by an independent Brownian motion as a degradation model. Such family contains almost all classical degradation models considered in the literature. Classically failure time…
This article provides the first procedure for computing a fully data-dependent interval that traps the mixing time $t_{\text{mix}}$ of a finite reversible ergodic Markov chain at a prescribed confidence level. The interval is computed from…
In this paper we introduce five different algorithms based on method of moments, maximum likelihood and full Bayesian estimation for learning the parameters of the Inverse Gamma distribution. We also provide an expression for the KL…
Conditioning Markov processes to avoid a set is a classical problem that has been studied in many settings. In the present article we study the question if a Levy process can be conditioned to avoid an interval and, if so, the path behavior…