Exit times for multivariate autoregressive processes
نویسندگان
چکیده
منابع مشابه
Bootstrap prediction regions for multivariate autoregressive processes
Riassunto: L’obiettivo del presente lavoro è studiare il comportamento di una nuova procedura per la determinazione di regioni di previsione per processi autoregressivi multidimensionali. Le regioni di previsione, basate sulla tecnica bootstrap, non fanno affidamento su alcuna assunzione distributiva per i disturbi ed inoltre tengono conto della variabilità derivante dalla necessità di stimare ...
متن کاملOn first exit times for homogeneous diffusion processes
Here t ≥ 0, wt is a standard d-dimensional Wiener process, coordinated as usual with some rightcontinuous non-decreasing flow of σ-algebras Ft ⊂ F ; fi and βi are nonrandom functions with respective values in R and R, (here and elsewhere i = 1, 2). The random vectors ai are measurable with respect to the σ-algebra F0 and ai ∈ Q̄ with probability 1(Q̄ denotes the closure of the region Q ). All vec...
متن کاملParametric Estimation of Diffusion Processes Sampled at First Exit Times
This paper introduces a family of recursively defined estimators of the parameters of a diffusion process. We use ideas of stochastic algorithms for the construction of the estimators. Asymptotic consistency of these estimators and asymptotic normality of an appropriate normalization are proved. The results are applied to two examples from the financial literature; viz., Cox-Ingersoll-Ross’ mod...
متن کاملOn exit times of Lévy-driven Ornstein–Uhlenbeck processes
We prove two martingale identities which involve exit times of Lévy-driven Ornstein–Uhlenbeck processes. Using these identities we find an explicit formula for the Laplace transform of the exit time under the assumption that positive jumps of the Lévy process are exponentially distributed.
متن کاملInverse Exit times ∗
Normalized cut is a widely used measure of separation between clusters in a graph. In this paper we provide a novel probabilistic perspective on this measure. We show that for a partition of a graph into two weakly connected sets, V = A B, the multiway normalized cut is approximately MNcut ≈ 1/τA→B + 1/τB→A, where τA→B is the unidirectional characteristic exit time of a random walk from subset ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2013
ISSN: 0304-4149
DOI: 10.1016/j.spa.2013.03.003