English
Related papers

Related papers: $(\epsilon, n)$ Fixed-Length Strong Coordination C…

200 papers

In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fundamental limits when the transmitter wishes to communicate…

Information Theory · Computer Science 2019-06-18 Sadaf Salehkalaibar , Mohammad Hossein Yassaee , Vincent Y. F. Tan

The rate of convergence of the distribution of the length of the longest increasing subsequence, toward the maximal eigenvalue of certain matrix ensembles, is investigated. For finite-alphabet uniform and nonuniform i.i.d. sources, a rate…

Probability · Mathematics 2012-11-30 Christian Houdré , Zsolt Talata

This paper proposes a novel reaction-diffusion system approximation tailored for singular diffusion problems, typified by the fast diffusion equation. While such approximation methods have been successfully applied to degenerate parabolic…

Analysis of PDEs · Mathematics 2026-04-01 Hideki Murakawa , Florian Salin

Gibbs sampling is a common procedure used to fit finite mixture models. However, it is known to be slow to converge when exploring correlated regions of a parameter space and so blocking correlated parameters is sometimes implemented in…

Statistics Theory · Mathematics 2024-11-04 David Michael Swanson

We study random compositions of transformations having certain uniform fiberwise properties and prove bounds which in combination with other results yield a quenched central limit theorem equipped with a convergence rate, also in the…

Dynamical Systems · Mathematics 2020-01-08 Olli Hella , Mikko Stenlund

In this paper, we construct a moment inequality for mixing dependent random variables, it is of independent interest. As applications, the consistency of the kernel density estimation is investigated. Several limit theorems are established:…

Statistics Theory · Mathematics 2013-06-07 Yuexu Zhao , Zhengyan Lin

This paper studies the fundamental limits of the minimum average length of lossless and lossy variable-length compression, allowing a nonzero error probability $\epsilon$, for lossless compression. We give non-asymptotic bounds on the…

Information Theory · Computer Science 2015-10-09 Victoria Kostina , Yury Polyanskiy , Sergio Verdú

In this paper we introduce a notion of tightness for a family of nonlinear expectations and show that the tightness can be applied to obtain weak compactness in a framework of nonlinear expectation space. This criterion is very useful for…

Probability · Mathematics 2010-06-15 Shi-Ge Peng

The Poisson-Boltzmann approach gives asymptotically exact counter-ion density profiles around charged objects in the weak-coupling limit of low valency and high temperature. In this paper we derive, using field-theoretic methods, a theory…

Soft Condensed Matter · Physics 2009-10-31 Andre G. Moreira , Roland R. Netz

We consider universal variable-to-fixed length compression of memoryless sources with a fidelity criterion. We design a dictionary codebook over the reproduction alphabet which is used to parse the source stream. Once a source subsequence…

Information Theory · Computer Science 2022-11-24 Nematollah Iri

This paper studies the behavior of singularly perturbed nonlinear differential equations with boundary-layer solutions that do not necessarily converge to an equilibrium. Using the average of the fast variable and assuming the boundary…

Systems and Control · Computer Science 2018-09-24 Mohammad Deghat , Saeed Ahmadizadeh , Dragan Nesic , Chris Manzie

We consider a dense $K$ user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal…

Information Theory · Computer Science 2011-09-12 Oliver Johnson , Matthew Aldridge , Robert Piechocki

We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on the node position distributions and signal attenuation, we…

Information Theory · Computer Science 2010-10-21 Matthew Aldridge , Oliver Johnson , Robert Piechocki

The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of…

Quantum Physics · Physics 2022-07-13 Cillian Harney , Stefano Pirandola

This paper investigates the effective capacity of a point-to-point ultra-reliable low latency communication (URLLC) transmission over multiple parallel sub-channels at finite blocklength (FBL) with imperfect channel state information (CSI).…

Information Theory · Computer Science 2022-10-20 Hongsen Peng , Meixia Tao

Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expression for the average distance spectrum is derived and this expression is used to obtain the asymptotic exponent of the weight…

Information Theory · Computer Science 2015-11-03 Francisco Lázaro , Enrico Paolini , Gianluigi Liva , Gerhard Bauch

The principal results of this contribution are the weak and strong limits of maxima of contracted stationary Gaussian random sequences. Due to the random contraction we introduce a modified Berman condition which is sufficient for the weak…

Probability · Mathematics 2013-12-10 Enkelejd Hashorva , Zhichao Weng

We consider the problem of lossless compression of individual sequences using finite-state (FS) machines, from the perspective of the best achievable empirical cumulant generating function (CGF) of the code length, i.e., the normalized…

Information Theory · Computer Science 2016-05-05 Neri Merhav

We consider energy-constrained infinite-dimensional quantum channels from a given system (satisfying a certain condition) to any other systems. We show that dealing with basic capacities of these channels we may assume (accepting…

Quantum Physics · Physics 2021-09-28 M. E. Shirokov

A fundamental problem in decentralized networked systems is to coordinate actions of different agents so that they reach a state of agreement. In such applications, it is additionally desirable that the actions at various nodes may not be…

Information Theory · Computer Science 2024-11-22 Viswanathan Ramachandran , Tobias J. Oechtering , Mikael Skoglund