English
Related papers

Related papers: Sampling Almost Periodic and related Functions

200 papers

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

Number Theory · Mathematics 2011-02-03 Sourav Chatterjee , Kannan Soundararajan

We provide an introduction of some basic facts of uniformly almost periodic functions, such as Fourier series representations. A result is then proved about Fourier coefficients which is a generalization of the purely periodic case. We then…

Classical Analysis and ODEs · Mathematics 2015-10-22 Alec Train , Rohit Jain , Will Carlson

For the space of functions that can be approximated by linear chirps, we prove a reconstruction theorem by random sampling at arbitrary rates.

Probability · Mathematics 2010-08-31 Eric Carlen , R. Vilela Mendes

It is well known that if the power spectral density of a continuous time stationary stochastic process does not have a compact support, data sampled from that process at any uniform sampling rate leads to biased and inconsistent spectrum…

Statistics Theory · Mathematics 2010-06-09 Radhendushka Srivastava , Debasis Sengupta

The notion of supershift generalizes that one of superoscillation and expresses the fact that the sampling of a function in an interval allows to compute the values of the function outside the interval. In a previous paper we discussed the…

Complex Variables · Mathematics 2023-12-11 F. Colombo , I. Sabadini , D. C. Struppa , A. Yger

The aim of this article is to establish asymptotic distributions and consistency of subsampling for spectral density and for magnitude of coherence for non-stationary, almost periodically correlated time series. We show the asymptotic…

Statistics Theory · Mathematics 2011-02-11 Łukasz Lenart

We consider composite functions in the elementary algebraic framework. Without any use of the Fourier transform, we find almost periodic orbits which suitably characterizes certain composite functions. In particular, we provide special…

Machine Learning · Computer Science 2025-06-17 Chikara Nakayama , Tsuyoshi Yoneda

In this paper we address sampling and approximation of functions on combinatorial graphs. We develop filtering on graphs by using Schr\"odinger's group of operators generated by combinatorial Laplace operator. Then we construct a sampling…

Information Theory · Computer Science 2011-11-28 Isaac Z. Pesenson , Meyer Z. Pesenson

We present a unified theory for the almost periodicity of functions with values in an arbitrary Banach space, measures and distributions via almost periodic elements for the action of a locally compact abelian group on a uniform topological…

Functional Analysis · Mathematics 2022-08-03 Daniel Lenz , Timo Spindeler , Nicolae Strungaru

We find asymptotic equalities for exact upper bounds of approximations by Fourier sums in uniform metric on classes of $2\pi$-periodic functions, representable in the form of convolutions of functions $\varphi$, which belong to unit balls…

Classical Analysis and ODEs · Mathematics 2016-03-08 A. S. Serdyuk , T. A. Stepaniuk

In many areas of applied statistics and machine learning, generating an arbitrary number of independent and identically distributed (i.i.d.) samples from a given distribution is a key task. When the distribution is known only through…

Artificial Intelligence · Computer Science 2021-10-29 Ulysse Marteau-Ferey , Francis Bach , Alessandro Rudi

We study a summability method called almost convergence for bounded measurable functions defined on a locally compact abelian group. We define almost convergence using topologically invariant means and exhibit two different kinds of…

Functional Analysis · Mathematics 2023-09-12 Ryoichi Kunisada

We propose an alternative to $k$-nearest neighbors for functional data whereby the approximating neighboring curves are piecewise functions built from a functional sample. Using a locally defined distance function that satisfies…

Methodology · Statistics 2021-06-02 Antonio Elías , Raúl Jiménez , Joe Yukich

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

Data Structures and Algorithms · Computer Science 2009-02-10 Mahdi Cheraghchi , Amin Shokrollahi

Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.

Numerical Analysis · Mathematics 2022-09-01 Qusay Muzaffar , Nira Dyn , David Levin

We study transition probabilities of generalized functions as introduced by Colombeau and Gsponer. We formally introduz the study of H. Bohr almost periodic functions in the generalized context and use them to give exact values of…

General Mathematics · Mathematics 2023-05-17 S. O. Juriaans , P. C. Queiroz

Efficient ab initio calculations of correlated materials at finite temperature require compact representations of the Green's functions both in imaginary time and Matsubara frequency. In this paper, we introduce a general procedure which…

Strongly Correlated Electrons · Physics 2020-04-01 Jia Li , Markus Wallerberger , Naoya Chikano , Chia-Nan Yeh , Emanuel Gull , Hiroshi Shinaoka

We establish a normal approximation for the limiting distribution of partial sums of random Rademacher multiplicative functions over function fields, provided the number of irreducible factors of the polynomials is small enough. This…

Number Theory · Mathematics 2022-07-26 Daksh Aggarwal , Unique Subedi , William Verreault , Asif Zaman , Chenghui Zheng

The local regularity of functional time series is studied under $L^p-m-$appro\-ximability assumptions. The sample paths are observed with error at possibly random design points. Non-asymptotic concentration bounds of the regularity…

Statistics Theory · Mathematics 2024-03-21 Hassan Maissoro , Valentin Patilea , Myriam Vimond

We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…

Number Theory · Mathematics 2021-11-15 Alexander P. Mangerel