Search arXiv⌕ Search

arXiv · 0708.3895

Applications of a finite-dimensional duality principle to some prediction problems

Abstract

Some of the most important results in prediction theory and time series analysis when finitely many values are removed from or added to its infinite past have been obtained using difficult and diverse techniques ranging from duality in Hilbert spaces of analytic functions (Nakazi, 1984) to linear regression in statistics (Box and Tiao, 1975). We unify these results via a finite-dimensional duality lemma and elementary ideas from the linear algebra. The approach reveals the inherent finite-dimensional character of many difficult prediction problems, the role of duality and biorthogonality for a finite set of random variables. The lemma is particularly useful when the number of missing values is small, like one or two, as in the case of Kolmogorov and Nakazi prediction problems. The stationarity of the underlying process is not a requirement. It opens up the possibility of extending such results to nonstationary processes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yukio Kasahara, Mohsen Pourahmadi, Akihiko Inoue. 2007-08-29. Applications of a finite-dimensional duality principle to some prediction problems. https://arxiv.org/abs/0708.3895

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Random models on regularity-integrability structures

We prove a convergence result for a large class of random models that encompasses the case of the BPHZ models used in the study of singular stochastic PDEs. We introduce for that purpose a useful variation on the notion of regularity structure called a regularity-integrability structure. It allows to deal in a single elementary setting with models on a usual regularity structure and their first order Malliavin derivative.

math.PR↗

Central Limit Theorems for Drift and Entropy of Random Walks on Free Products

In this article we consider a natural class of random walks on free products of graphs, which arise as convex combinations of random walks on the single factors. From the works of Gilch [1,2] it is well-known that for these random walks the asymptotic entropy as well as the drift w.r.t. the natural transition graph distance and also w.r.t. the word length exist. The aim of this article is to formulate three central limit theorems with respect to both drift definitions and also w.r.t. the entropy when seen as the limit of last visit generating functions. In the case that the random walk depends on finitely many parameters we show that the corresponding variances in the central limit theorems w.r.t. both drifts vary real-analytically in terms of these parameters, while the variance in the central limit theorem w.r.t. the entropy varies real-analytically in the case of free products of finite graphs.

math.PR↗

Harnack inequality for $p$-harmonic functions: probabilistic and analytic approaches

We survey analytic and probabilistic approaches to the Harnack inequality for $p$-harmonic functions, $p>1$, with particular attention to the dependence of the constants on $p$ and the dimension. We explain the ideas of Moser iteration, the tug-of-war approach of Luiro, Parviainen and Saksman, and the log-gradient estimate of Kotschwar and Ni. Along the way, we give a quantitative refinement of the probabilistic argument and a direct planar proof.

math.PR↗