English
Related papers

Related papers: Semi-Finite Length Analysis for Information Theore…

200 papers

The paper concerned with higher order asymptotic expansion of solutions to the Cauchy problem of abstract hyperbolic equations of the form $u''+Au+u'=0$ in a Hilbert space, where $A$ is a nonnegative selfadjoint operator. The result says…

Analysis of PDEs · Mathematics 2021-05-21 Motohiro Sobajima

In this note, we present an abstract approach to study asymptotic orders for adaptive approximations with respect to a monotone set function $\mathfrak{J}$ defined on dyadic cubes. We determine the exact upper order in terms of the critical…

Optimization and Control · Mathematics 2025-03-18 Marc Kesseböhmer , Aljoscha Niemann

For the problem of prediction with expert advice in the adversarial setting with geometric stopping, we compute the exact leading order expansion for the long time behavior of the value function. Then, we use this expansion to prove that as…

Probability · Mathematics 2020-03-23 Erhan Bayraktar , Ibrahim Ekren , Yili Zhang

The asymptotic rates of information-theoretic protocols - including error exponents, compression rates, and channel capacities - are traditionally defined under the idealised assumption that the underlying resource (state or channel) is…

Quantum Physics · Physics 2026-05-19 Filippo Girardi , Nilanjana Datta , Giacomo De Palma , Ludovico Lami

We present a general approach to the problem of determining tight asymptotic lower bounds for generalized central moments of the optimal alignment score of two independent sequences of i.i.d. random variables. At first, these are obtained…

Probability · Mathematics 2016-11-28 Ruoting Gong , Christian Houdré , Jüri Lember

We consider a one-dimensional random walk $S_n$ with i.i.d. increments with zero mean and finite variance. We study the asymptotic expansion for the tail distribution $\mathbf P(\tau_x>n)$ of the first passage times…

Probability · Mathematics 2024-01-19 Denis Denisov , Alexander Tarasov , Vitali Wachtel

In this paper, we mainly discuss asymptotic profiles of solutions to a class of abstract second-order evolution equations of the form $u''+Au+u'=0$ in real Hilbert spaces, where $A$ is a nonnegative selfadjoint operator. The main result is…

Analysis of PDEs · Mathematics 2024-10-28 Motohiro Sobajima

Integrated task and motion planning problems describe a multi-modal state space, which is often abstracted as a set of smooth manifolds that are connected via sets of transitions states. One approach to solving such problems is to sample…

Robotics · Computer Science 2022-01-21 Rahul Shome , Daniel Nakhimovich , Kostas E. Bekris

We consider the problem of estimating smooth integrated functionals of a monotone nonincreasing density $f$ on $[0,\infty)$ using the nonparametric maximum likelihood based plug-in estimator. We find the exact asymptotic distribution of…

Statistics Theory · Mathematics 2019-04-16 Rajarshi Mukherjee , Bodhisattva Sen

We consider the stochastic sequential assignment problem of Derman, Lieberman and Ross (1972) corresponding to a discrete distribution supported on a finite set of points. We use large deviation estimates to compute the asymptotics of the…

Probability · Mathematics 2022-03-01 Antal A. Járai

We study the large time behavior of solutions to the wave equation with space-dependent damping in an exterior domain. We show that if the damping is effective, then the solution is asymptotically expanded in terms of solutions of…

Analysis of PDEs · Mathematics 2024-03-12 Motohiro Sobajima , Yuta Wakasugi

In this paper we establish the error rate of first order asymptotic approximation for the tail probability of sums of log-elliptical risks. Our approach is motivated by extreme value theory which allows us to impose only some weak…

Probability · Mathematics 2014-12-12 D. Kortschak , E. Hashorva

Uniform asymptotic expansions involving exponential and Airy functions are obtained for Laguerre polynomials $L_{n}^{(\alpha)}(x)$, as well as complementary confluent hypergeometric functions. The expansions are valid for $n$ large and…

Classical Analysis and ODEs · Mathematics 2017-05-04 T. M. Dunster , A. Gil , J. Segura

Directed information and its causally conditioned variations are often used to measure causal influences between random processes. In practice, these quantities must be measured from data. Non-asymptotic error bounds for these estimates are…

Information Theory · Computer Science 2026-05-19 Yuping Zheng , Andrew Lamperski

The classical heuristic complexity of the Number Field Sieve (NFS) is the solution of an optimization problem that involves an unknown function, usually noted $o(1)$ and called $\xi(N)$ throughout this paper, which tends to zero as the…

Cryptography and Security · Computer Science 2021-06-23 Aude Le Gluher , Pierre-Jean Spaenlehauer , Emmanuel Thomé

This survey reviews portfolio selection problem for long-term horizon. We consider two objectives: (i) maximize the probability for outperforming a target growth rate of wealth process (ii) minimize the probability of falling below a target…

Portfolio Management · Quantitative Finance 2014-08-28 Huyen Pham

For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of…

Information Theory · Computer Science 2018-02-28 Krishna Kaipa

This paper develops further and systematically the asymptotic expansion theory that was initiated by Foias and Saut in [11]. We study the long-time dynamics of a large class of dissipative systems of nonlinear ordinary differential…

Dynamical Systems · Mathematics 2020-09-18 Dat Cao , Luan Hoang

For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…

Computational Complexity · Computer Science 2022-05-13 Amol Aggarwal , Josh Alman

We introduce a new framework term coding for extremal problems in discrete mathematics and information flow, where one chooses interpretations of function symbols so as to maximise the number of satisfying assignments of a finite system of…

Information Theory · Computer Science 2026-02-10 Søren Riis