Related papers: Bounds on Discrete Fourier Transform of Random Mas…
We give an abstract argument that an a priori Fourier restriction estimate for a certain choice of exponents automatically implies maximal and variational Fourier restriction estimates. These, in turn, provide pointwise and quantitative…
This algorithm is designed to perform numerical transforms to convert data from the temporal domain into the spectral domain. This algorithm obtains the spectral magnitude and phase by studying the Coefficient of Determination of a series…
Kernel methods represent one of the most powerful tools in machine learning to tackle problems expressed in terms of function values and derivatives due to their capability to represent and model complex relations. While these methods show…
In this paper, we develop a computational approach for estimating the mean value of a quantity in the presence of uncertainty. We demonstrate that, under some mild assumptions, the upper and lower bounds of the mean value are efficiently…
The Fourier spectrum is a family of dimensions that interpolates between the Fourier and Hausdorff dimensions and are defined in terms of certain energies which capture Fourier decay. In this paper we obtain a convenient discrete…
We present some work relating to fractal transformations on masked iterated function systems and demonstrate how well known algorithms for generating fractal transformations can be modifed for these systems. We also demonstrate that these…
We describe the behavior of the expectation of the maximum for a random assignment process built upon a square matrix with independent entries. Under mild assumptions on the underlying distribution, the answer is expressed in terms of its…
We investigate several infinite product of cosines and find the closed form using the Fourier transform. The answers provide limiting distributions for some elementary probability experiments.
In this paper we examine the problem of inference in Bayesian Networks with discrete random variables that have very large or even unbounded domains. For example, in a domain where we are trying to identify a person, we may have variables…
We establish variational estimates related to the problem of restricting the Fourier transform of a three-dimensional function to the two-dimensional Euclidean sphere. At the same time, we give a short survey of the recent field of maximal…
Following the ideas from a paper by the same author, we prove abstract maximal restriction results for the Fourier transform. Our results deal mainly with maximal operators of convolution-type and $r-$average maximal functions. As a…
Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of randomly distributed points. Asymptotic results are known…
New positivity bounds are derived for generalized (off-forward) parton distributions using the impact parameter representation. These inequalities are stable under the evolution to higher normalization points. The full set of inequalities…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
The normalized maximum likelihood code length has been widely used in model selection, and its favorable properties, such as its consistency and the upper bound of its statistical risk, have been demonstrated. This paper proposes a novel…
We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.
Independent random signs can govern various discrete models that converge to non-isomorphic continuous limits. Convergence of Fourier-Walsh spectra is established under appropriate conditions.
In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…
In this paper non-asymptotic exact rearrangement invariant norm estimates are derived for the maximum distribution of the family elements of some rearrangement invariant (r.i.) space over unbounded measure in the entropy terms and in the…
Let $S$ be a regular set of $\R^d$ and $X : S\rightarrow \R$ be Gaussian field with regular paths. In order to give bound to the tail of the distribution of the maximum, we use the record method of Mercadier. We present some new form in…