Related papers: Generalized Cut-Set Bounds for Broadcast Networks
We propose an entirely new meta-learning framework for network pruning. It is a general framework that can be theoretically applied to almost all types of networks with all kinds of pruning and has great generality and transferability.…
Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…
A network is a typical expressive form of representing complex systems in terms of vertices and links, in which the pattern of interactions amongst components of the network is intricate. The network can be static that does not change over…
Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks. Here, we fill this gap of knowledge by developing a classical framework for…
Finding the set of nodes, which removed or (de)activated can stop the spread of (dis)information, contain an epidemic or disrupt the functioning of a corrupt/criminal organization is still one of the key challenges in network science. In…
One of the important unsolved problems in information theory is the conjecture that network coding has no rate benefit over routing in undirected unicast networks. Three known bounds on the symmetric rate in undirected unicast information…
Shannon's secrecy system is studied in a setting, where both the legitimate decoder and the wiretapper have access to side information sequences correlated to the source, but the wiretapper receives both the coded information and the side…
Frequency estimation in data streams is one of the classical problems in streaming algorithms. Following much research, there are now almost matching upper and lower bounds for the trade-off needed between the number of samples and the…
We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a…
We consider the multi-broadcast problem in arbitrary connected radio networks consisting of $n$ nodes. There are $k$ designated source nodes for some fixed $k \in \{1,\ldots,n\}$, and each source node has a distinct piece of information…
We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…
Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the…
An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…
Compress-forward (CF) schemes are studied in general networks. The CF rate for the one-relay channel defines outerbounds on both the CF rate for general networks and the compression rate-vector region supporting this rate. We show the…
Let $P$ be a set of nodes in a wireless network, where each node is modeled as a point in the plane, and let $s\in P$ be a given source node. Each node $p$ can transmit information to all other nodes within unit distance, provided $p$ is…
Recently, Tian et al. [1] considered joint source-channel coding of transmitting a Gaussian source over $K$-user Gaussian broadcast channel, and derived an outer bound on the admissible distortion region. In [1], they stated "due to its…
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for bounding the capacity of general networks, but their…
Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables,…
This paper is concerned with distributed detection of central nodes in complex networks using closeness centrality. Closeness centrality plays an essential role in network analysis. Evaluating closeness centrality exactly requires complete…
We consider a network of nodes distributed in physical space without physical links communicating through message broadcasting over specified distances. Typically, communication using smaller distances is desirable due to savings in energy…