Related papers: Almost-lossless compression of a low-rank random t…
We establish asymptotic normality of weighted sums of periodograms of a stationary linear process where weights depend on the sample size. Such sums appear in numerous statistical applications and can be regarded as a discretized versions…
Data processing lower bounds on the expected distortion are derived in the finite-alphabet semi-deterministic setting, where the source produces a deterministic, individual sequence, but the channel model is probabilistic, and the decoder…
We consider the Riemannian random wave model of Gaussian linear combinations of Laplace eigenfunctions on a general compact Riemannian manifold. With probability one with respect to the Gaussian coefficients, we establish that, both for…
Lieanders are special cases of meanders and first appeared in connection with Lie algebras. Using the results from the author with E. Goujard, P. Zograf and A. Zorich, we prove a polynomial asymptotics for the number of lieanders with fixed…
In this paper we study asymptotic distributions associated to piecewise quasi-polynomials. The main result obtained here is used in another paper of the authors "The equivariant index of twisted Dirac operators and semi-classical limits".
We show existence of a isoperimetric $3$-partition of $\mathbb R^8$, with one set of finite volume and two of infinite volume, which is asymptotic to a singular minimal cone.
We provide new estimates of an asymptotic upper bound on the entropy of English using the large language model LLaMA-7B as a predictor for the next token given a window of past tokens. This estimate is significantly smaller than currently…
We define the notion of asymptotically free for locally restricted compositions, which means roughly that large parts can often be replaced by any larger parts. Two well-known examples are Carlitz and alternating compositions. We show that…
We establish sufficient conditions for the asymptotic normality of kernel density estimators, applied to causal linear random fields. Our conditions on the coefficients of linear random fields are weaker than known results, although our…
We study the problem of low-rank tensor factorization in the presence of missing data. We ask the following question: how many sampled entries do we need, to efficiently and exactly reconstruct a tensor with a low-rank orthogonal…
Canonical Polyadic (or CANDECOMP/PARAFAC, CP) decompositions (CPD) are widely applied to analyze high order tensors. Existing CPD methods use alternating least square (ALS) iterations and hence need to unfold tensors to each of the $N$…
We consider the problem of recovering a low-multilinear-rank tensor from a small amount of linear measurements. We show that the Riemannian gradient algorithm initialized by one step of iterative hard thresholding can reconstruct an…
The tensor rank decomposition is a useful tool for the geometric interpretation of the tensors in the canonical tensor model (CTM) of quantum gravity. In order to understand the stability of this interpretation, it is important to be able…
In the paper, the author presents a double inequality for completely monotonic degree of a remainder for an asymptotic expansion of the trigamma function. This result partially confirms one in a series of conjectures on completely monotonic…
The low-rank canonical polyadic tensor decomposition is useful in data analysis and can be computed by solving a sequence of overdetermined least squares subproblems. Motivated by consideration of sparse tensors, we propose sketching each…
We introduce a dynamical low-rank method to reduce the computational complexity for solving the multi-scale multi-dimensional linear transport equation. The method is based on a macro-micro decomposition of the equation. The proposed…
We present a complete classification of Hausdorff locally compact polycyclic monoids up to a topological isomorphism. A {\em polycyclic monoid} is an inverse monoid with zero, generated by a subset $\Lambda$ such that $xx^{-1}=1$ for any…
New-generation wireless communication systems will employ large-scale antenna arrays to satisfy the increasing capacity demand. This massive scenario brings new challenges to the channel equalization problem due to the increased signal…
This paper provides tight bounds on the R\'enyi entropy of a function of a discrete random variable with a finite number of possible values, where the considered function is not one-to-one. To that end, a tight lower bound on the R\'enyi…
Many information sources are not just sequences of distinguishable symbols but rather have invariances governed by alternative counting paradigms such as permutations, combinations, and partitions. We consider an entire classification of…