English
Related papers

Related papers: Mixing properties of Skellam-GARCH processes

200 papers

This paper aims at providing statistical guarantees for a kernel based estimation of time varying parameters driving the dynamic of local stationary processes. We extend the results of Dahlhaus et al. (2018) considering the local stationary…

Statistics Theory · Mathematics 2020-10-22 J. -M. Bardet , P. Doukhan , O. Wintenberger

This note outlines a method for clustering time series based on a statistical model in which volatility shifts at unobserved change-points. The model accommodates some classical stylized features of returns and its relation to GARCH is…

Methodology · Statistics 2019-06-26 Nick Whiteley

Consider a Markov chain with finite state space and suppose you wish to change time replacing the integer step index $n$ with a random counting process $N(t)$. What happens to the mixing time of the Markov chain? We present a partial reply…

Probability · Mathematics 2021-11-17 Nicos Georgiou , Enrico Scalas

We develop a practical approach to establish the stability, that is, the recurrence in a given set, of a large class of controlled Markov chains. These processes arise in various areas of applied science and encompass important numerical…

Statistics Theory · Mathematics 2015-02-02 Christophe Andrieu , Vladislav B. Tadić , Matti Vihola

Recent computer simulations reveal several intriguing features in the evolution of properties of amorphous solids subjected to repeated cyclic shear deformation. These include the divergence of the number of cycles to reach steady states as…

In the analysis of Markov chains and processes, it is sometimes convenient to replace an unbounded state space with a "truncated" bounded state space. When such a replacement is made, one often wants to know whether the equilibrium behavior…

Probability · Mathematics 2022-06-24 Alex Infanger , Peter W. Glynn

We give examples of stochastic processes in the Gelfand Tsetlin cone in which each component evolves independently apart from a blocking and pushing interaction. The processes give couplings to certain conditioned Markov processes, last…

Probability · Mathematics 2009-11-29 Jon Warren , Peter Windridge

At high levels, the asymptotic distribution of a stationary, regularly varying Markov chain is conveniently given by its tail process. The latter takes the form of a geometric random walk, the increment distribution depending on the sign of…

Methodology · Statistics 2014-12-11 Holger Drees , Johan Segers , Michał Warchoł

This paper considers a Markov-modulated duplication-deletion random graph where at each time instant, one node can either join or leave the network; the probabilities of joining or leaving evolve according to the realization of a finite…

Information Theory · Computer Science 2013-03-04 Maziyar Hamdi , Vikram Krishnamurthy , George Yin

We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…

Probability · Mathematics 2009-06-26 Nobuo Yoshida

The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it sequentially adds new random edges so that the degree of each…

Combinatorics · Mathematics 2025-08-13 Michael Molloy , Erlang Surya , Lutz Warnke

In this paper, we build upon the asymptotic theory for GARCH processes, considering the general class of augmented GARCH($p$, $q$) processes. Our contribution is to complement the well-known univariate asymptotics by providing a joint…

Statistics Theory · Mathematics 2019-12-24 Marcel Bräutigam , Marie Kratz

We give a new rapid mixing result for a natural random walk on the independent sets of a graph $G$. We show that when $G$ has bounded treewidth, this random walk -- known as the Glauber dynamics for the hardcore model -- mixes rapidly for…

Data Structures and Algorithms · Computer Science 2023-10-03 David Eppstein , Daniel Frishberg

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

Probability · Mathematics 2026-03-10 Partha S. Dey , S. Rasoul Etesami , Aditya S. Gopalan

Discrete time random dynamical systems with countably many maps which admit countable Markov partitions on complete metric spaces such that the resulting Markov systems are uniform continuous and contractive are considered. A notion of a…

Probability · Mathematics 2015-06-16 Ivan Werner

This paper is concerned with some properties of the generalized GARCH models, obtained by extending GARCH models with exogenous variables, the so-called GARCH extended (GARCHX) models. For these, we establish sufficient conditions for some…

Statistics Theory · Mathematics 2013-07-26 Giles-Arnaud Nzouankeu Nana , Ralf Korn , Christina Erlwein-Sayer

In this paper an original interacting particle system approach is developed for studying Markov chains in rare event regimes. The proposed particle system is theoretically studied through a genealogical tree interpretation of Feynman--Kac…

Probability · Mathematics 2007-05-23 Pierre Del Moral , Josselin Garnier

We introduce a stochastic model of coupled genetic oscillators in which chains of chemical events involved in gene regulation and expression are represented as sequences of Poisson processes. We characterize steady states by their…

Biological Physics · Physics 2018-03-28 David J. Jörg , Luis G. Morelli , Frank Jülicher

For the multivariate COGARCH(1,1) volatility process we show sufficient conditions for the existence of a unique stationary distribution, for the geometric ergodicity and for the finiteness of moments of the stationary distribution by a…

Probability · Mathematics 2019-10-01 Robert Stelzer , Johanna Vestweber

This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…

Probability · Mathematics 2020-06-01 Julia Gaudio , Yury Polyanskiy
‹ Prev 1 8 9 10 Next ›