Related papers: Subadditivity Beyond Trees and the Chi-Squared Mut…
Quantum spin networks overcome the challenges of traditional charge-based electronics by encoding the information into spin degrees of freedom. Although beneficial for transmitting information with minimal losses when compared to their…
Fisher-information inequalities have recently been used as operational witnesses of nonclassical metrological behavior, but their physical meaning is often tied to a particular narrative, such as, segmented dynamics or discrete…
We consider percolation on interdependent locally treelike networks, recently introduced by Buldyrev et al., Nature 464, 1025 (2010), and demonstrate that the problem can be simplified conceptually by deleting all references to cascades of…
Transport through generalized trees is considered. Trees contain the simple nodes and supernodes, either well-structured regular subgraphs or those with many triangles. We observe a superdiffusion for the highly connected nodes while it is…
The continuity properties of the convex closure of the output entropy of infinite dimensional channels and their applications to the additivity problem are considered. The main result of this paper is the statement that the superadditivity…
Decision trees are important both as interpretable models amenable to high-stakes decision-making, and as building blocks of ensemble methods such as random forests and gradient boosting. Their statistical properties, however, are not well…
This paper revisits the study of (minimum) broadcast graphs, i.e., graphs enabling fast information dissemination from every source node to all the other nodes (and having minimum number of edges for this property). This study is performed…
The channel capacity for the binary symmetric channel is investigated based on the symmetrized definition of the mutual information, which is arising from an attempt of extension of information content based on the nonadditivity. The…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing…
Graphs naturally lend themselves to model the complexities of Hyperspectral Image (HSI) data as well as to serve as semi-supervised classifiers by propagating given labels among nearest neighbours. In this work, we present a novel framework…
We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…
We prove new quantitative limitations on any approximate simultaneous cloning or broadcasting of mixed states. The results are based on information-theoretic (entropic) considerations and generalize the well known no-cloning and…
In this paper, we study Sibson's $\alpha$-mutual information in the context of the additive Gaussian noise channel. While the classical case $\alpha = 1$ is well understood and admits deep connections to estimation-theoretic quantities,…
This paper presents a novel theoretical study of the general problem of multiple source adaptation using the notion of Renyi divergence. Our results build on our previous work [12], but significantly broaden the scope of that work in…
This paper first focuses on deriving an alternative approach for proving an extremal entropy inequality (EEI), originally presented in [11]. The proposed approach does not rely on the channel enhancement technique, and has the advantage…
This paper contributes tail bounds of the age-of-information of a general class of parallel systems and explores their potential. Parallel systems arise in relevant cases, such as in multi-band mobile networks, multi-technology wireless…
Message passing neural networks iteratively generate node embeddings by aggregating information from neighboring nodes. With increasing depth, information from more distant nodes is included. However, node embeddings may be unable to…
Electromagnetic scattering bounds on subwavelength structures play an important role in estimating performances of antennas, RFID tags, and other wireless communication devices. An appealing approach to increase a scattering cross-section…
We prove quasi-multiplicativity for critical level-sets of Gaussian free fields (GFF) on the metric graphs $\widetilde{\mathbb{Z}}^d$ ($d\ge 3$). Specifically, we study the probability of connecting two general sets located on opposite…