National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
Strong stationary times and convergence of Markov chains
Suk, Luboš ; Prokešová, Michaela (advisor) ; Kříž, Pavel (referee)
In this thesis we study the estimation of speed of convergence of Markov chains to their stacionary distributions. For that purpose we will use the method of strong stationary times. We focus on irreducible and aperiodic chains only since in that case the existence of exactly one stationary distribution is guaranteed. We introduce the mixing time for a Markov chain as the time needed for the marginal distribution of the chain to be sufficiently close to the stationary dis- tribution. The distance between two distributions is measured by the total variation distance. The main goal of this thesis is to construct an appropriate strong stationary time for selected chains and then use it for obtaining an upper bound for the mixing time.
Seasonal state space modeling
Suk, Luboš ; Cipra, Tomáš (advisor) ; Zichová, Jitka (referee)
State space modeling represents a statistical framework for exponential smoo- thing methods and it is often used in time series modeling. This thesis descri- bes seasonal innovations state space models and focuses on recently suggested TBATS model. This model includes Box-Cox transformation, ARMA model for residuals and trigonometric representation of seasonality and it was designed to handle a broad spectrum of time series with complex types of seasonality inclu- ding multiple seasonality, high frequency of data, non-integer periods of seasonal components, and dual-calendar effects. The estimation of the parameters based on maximum likelihood and trigonometric representation of seasonality greatly reduce computational burden in this model. The universatility of TBATS model is demonstrated by four real data time series.
Strong stationary times and convergence of Markov chains
Suk, Luboš ; Prokešová, Michaela (advisor) ; Kříž, Pavel (referee)
In this thesis we study the estimation of speed of convergence of Markov chains to their stacionary distributions. For that purpose we will use the method of strong stationary times. We focus on irreducible and aperiodic chains only since in that case the existence of exactly one stationary distribution is guaranteed. We introduce the mixing time for a Markov chain as the time needed for the marginal distribution of the chain to be sufficiently close to the stationary dis- tribution. The distance between two distributions is measured by the total variation distance. The main goal of this thesis is to construct an appropriate strong stationary time for selected chains and then use it for obtaining an upper bound for the mixing time.

See also: similar author names
6 Suk, Ladislav
Interested in being notified about new results for this query?
Subscribe to the RSS feed.