English
Related papers

Related papers: Second-Order Converses via Reverse Hypercontractiv…

200 papers

A linear programming (LP) based framework is presented for obtaining converses for finite blocklength lossy joint source-channel coding problems. The framework applies for any loss criterion, generalizes certain previously known converses,…

Information Theory · Computer Science 2017-05-04 Sharu Theresa Jose , Ankur A. Kulkarni

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Keerthi S. K. Arumugam , Matthieu R. Bloch

We analyse and improve the volume-penalty method, a simple and versatile way to model objects in fluid flows. The volume-penalty method is a kind of fictitious-domain method that approximates no-slip boundary conditions with rapid linear…

Numerical Analysis · Mathematics 2020-12-09 Eric W. Hester , Geoffrey M. Vasil , Keaton J. Burns

We establish the classical capacity of optical quantum channels as a sharp transition between two regimes---one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly…

Quantum Physics · Physics 2015-03-17 Bhaskar Roy Bardhan , Raul Garcia-Patron , Mark M. Wilde , Andreas Winter

We let $\Omega$ be a smooth bounded domain of $\mathbb{R}^4$ and a sequence of fonctions $(V_k)_{k\in\mathbb{N}}\in C^0(\Omega)$ such that $\lim_{k\to +\infty}V_k=1$ in $C^0_{loc}(\Omega)$. We consider a sequence of functions…

Analysis of PDEs · Mathematics 2007-05-23 Frederic Robert

The paper derives the optimal second-order coding rate for the continuous-time Poisson channel. We also obtain bounds on the third-order coding rate. This is the first instance of a second-order result for a continuous-time channel. The…

Information Theory · Computer Science 2020-08-18 Yuta Sakai , Vincent Y. F. Tan , Mladen Kovačević

This article addresses the weak convergence of numerical methods for Brownian dynamics. Typical analyses of numerical methods for stochastic differential equations focus on properties such as the weak order which estimates the asymptotic…

Numerical Analysis · Mathematics 2015-06-18 B. Leimkuhler , C. Matthews , M. V. Tretyakov

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski

In their work on a sharp compactness theorem for the Yamabe problem, Khuri, Marques and Schoen apply a refined blow-up analysis (what we call `second order blow-up argument' in this article) to obtain highly accurate approximate solutions…

Analysis of PDEs · Mathematics 2017-07-11 Man Chun Leung

We introduce and investigate the asymptotic behaviour of the trajectories of a second order dynamical system with Tikhonov regularization for solving a monotone equation with single valued, monotone and continuous operator acting on a real…

Optimization and Control · Mathematics 2024-11-27 Ernö Robert Csetnek , Szilárd Csaba László

In this paper, we derive a sharp version of the singular Trudinger-Moser inequality, which was originally established by Adimurthi and Sandeep (Nonlinear Differ. Equ. Appl. 2007). Moreover, extremal functions for those singular…

Analysis of PDEs · Mathematics 2018-03-28 Yunyan Yang , Xiaobao Zhu

We consider the focusing energy-critical wave equation in space dimension $N\in \{3, 4, 5\}$ for radial data. We study type II blow-up solutions which concentrate one bubble of energy. It is known that such solutions decompose in the energy…

Analysis of PDEs · Mathematics 2016-08-10 Jacek Jendrej

Past works on remote lossy source coding studied the rate under average distortion and the error exponent of excess distortion probability. In this work, we look into how fast the excess distortion probability converges to 1 at small rates,…

Information Theory · Computer Science 2025-04-24 Han Wu , Hamdi Joudeh

The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as compressive sensing, and subset selection in…

Information Theory · Computer Science 2016-08-31 Jonathan Scarlett , Volkan Cevher

This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…

Information Theory · Computer Science 2018-12-17 Shota Saito , Hideki Yagi , Toshiyasu Matsushima

We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive,…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-27 Mohammad T. Hajiaghayi , Dariusz R. Kowalski , Jan Olkowski

Value iteration is a fixed point iteration technique utilized to obtain the optimal value function and policy in a discounted reward Markov Decision Process (MDP). Here, a contraction operator is constructed and applied repeatedly to arrive…

Machine Learning · Computer Science 2021-09-21 Chandramouli Kamanchi , Raghuram Bharadwaj Diddigi , Shalabh Bhatnagar

We study the strong solution to the 3-D compressible Navier--Stokes equations. We propose a new blow up criterion for barotropic gases in terms of the integral norm of density $\rho$ and the divergence of the velocity $\bu$ without any…

Analysis of PDEs · Mathematics 2017-05-16 Hi Jun Choe , Minsuk Yang

This paper is devoted to the study of the regularity of solutions to some systems of reaction--diffusion equations, with reaction terms having a subquadratic growth. We show the global boundedness and regularity of solutions, without…

Analysis of PDEs · Mathematics 2009-01-29 M. Cristina Caputo , Alexis Vasseur

A strong direct product theorem states that, in order to solve k instances of a problem, if we provide less than k times the resource required to compute one instance, then the probability of overall success is exponentially small in k. In…

Computational Complexity · Computer Science 2013-02-20 Rahul Jain , Penghui Yao