相关论文: Predictability of sequences and subsequences with …

The paper investigates recoverability of sequences from their periodic subsequences and offers some modification of the approach suggested in papers arXiv:1605.00414 and arXiv:1803.02233. It is shown that there exists a class of sequences…

The paper studies properties of continuous time processes with spectrum degeneracy at a single point where their Fourier transforms vanish with a certain rate. It appears that these processes are linearly predictable in some weak sense,…

The paper presents sufficient conditions of predictability for continuous time processes in deterministic setting. We found that processes with exponential decay on energy for higher frequencies are predictable in some weak sense on some…

The paper studies spectral representation and its applications for non-decaying continuous time signals that are not necessarily bounded at $\pm\infty$. The paper introduces notions of transfer functions, spectrum degeneracy, spectrum gaps,…

The paper studies frequency characteristics and predictability of real sequences, i.e., discrete time processes in deterministic setting. We consider band-limitness and predictability of one-sided sequences. We establish predictability of…

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

The paper investigates recoverability of discrete time signals represented by infinite sequences from incomplte observations. It is shown that there exist wide classes of signals that are everywhere dense in the space of square-summable…

The spectral theory of quantum graphs is related via an exact trace formula with the spectrum of the lengths of periodic orbits (cycles) on the graphs. The latter is a degenerate spectrum, and understanding its structure (i.e.,finding out…

The paper studies recoverability of missing values for sequences in a pathwise setting without probabilistic assumptions. This setting is oriented on a situation where the underlying sequence is considered as a sole sequence rather than a…

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…

Let $Z$ be a projective hypersurface such that its underlying reduced variety has only isolated singularities. In case its irreducible components have constant multiplicities, for instance if $\dim Z>1$, we show that the spectrum of its…

In this paper, we define and study the concept of traceable regressions. These are sequences of regressions in joint or single responses for which a corresponding regression graph captures not only an independence structure but represents,…

Several recent works have identified patterns that must exist in dense subsets of either the vertices or the edges of a large hypercube. We introduce a framework, based on the concept of series-parallel graphs, that unifies and generalizes…

We provide a sufficient criterion for the recurrence of spatial random graphs on the real line based on the scarceness of long-edges. In particular, this complements earlier recurrence results obtained by Gracar et al. (Electron. J. Probab.…

The paper suggests a method of recovering missing values for sequences, including sequences with a multidimensional index, based on optimal approximation by processes featuring spectrum degeneracy. The problem is considered in the pathwise…

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…

Pathwise predictability and predictors for discrete time processes are studied in deterministic setting. It is suggested to approximate convolution sums over future times by convolution sums over past time. It is shown that all band-limited…

This paper examines the feasible region of a standard conic program represented as the intersection of a closed convex cone and a set of linear equalities. It is recently shown that when Slater constraint qualification (strict feasibility)…

A criterion to obtain frequent hypercyclicity for a sequence of convolution operators on the space of entire functions on the complex plane is provided. The criterion involves that the generating functions of the operators do not vanish on…