Publication
Information Flow Decomposition for Network Coding
Related publications (59)
Towards an Understanding of Hydraulic Sensitivity: Graph Theory Contributions to Water Distribution Analysis
Water distribution systems (WDSs) are complex networks with numerous interconnected junctions and pipes. The robustness and reliability of these systems are critically dependent on their network structure, necessitating detailed analysis for proactive leak ...
Basel2024Unambiguous DNFs and Alon-Saks-Seymour
Mika Tapani Göös, Siddhartha Jain
We exhibit an unambiguous k-DNF formula that requires CNF width (Omega) over tilde (k(2)), which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the Alon-Saks-Seymour problem in graph theory (posed in 1991), which ...
IEEE COMPUTER SOC2022The Paris/Geneva Divide. A Network Analysis of the Archives of the International Committee on Intellectual Cooperation of the League of Nations
The International Committee on Intellectual Cooperation (ICIC) is often framed as a step in the constitution of a “League of Minds” – a place where scientists and writers reign, and a necessary part of a successful and harmonious “League of Nations” – but ...
De Gruyter2022Learning Bollobas-Riordan Graphs Under Partial Observability
This work examines the problem of learning the topology of a network (graph learning) from the signals produced at a subset of the network nodes (partial observability). This challenging problem was recently tackled assuming that the topology is drawn acco ...
IEEE2021Braided rivers networks dynamics: analyzing topographic data from a large flume experiment
Christophe Ancey, Daniel Vito Papa
Braided rivers are highly dynamical systems characterized by varying network-like structures even under quasi-steady conditions. Understanding their dynamics is crucial in geomorphology and river engineering (e.g., river restoration in Alpine and piedmond ...
2020Topological exploration of artificial neuronal network dynamics
Kathryn Hess Bellwald, Gard Spreemann
One of the paramount challenges in neuroscience is to understand the dynamics of individual neurons and how they give rise to network dynamics when interconnected. Historically, researchers have resorted to graph theory, statistics, and statistical mechani ...
MIT PRESS2019Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding
Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu
Computation codes in network information theory are designed for scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding (DSC) that ...
2019Resource Allocation for Underlaying Device-to-Device Communications Using Maximal Independent Sets and Knapsack Algorithm
In this paper, we address the resource allocation problem of device-to-device (D2D) communications underlaying orthogonal frequency division multiple access (OFDMA) based cellular systems by exploiting the efficiency that comes from an ensemble of graph th ...
IEEE2018Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions
We present a fully analytical, heuristic model the "Analytical Transport Network Model" for steady-state, diffusive, potential flow through a 3-D network. Employing a combination of graph theory, linear algebra, and geometry, the model explicitly relates a ...
Elsevier Science Bv2017A Precise Threshold For Quasi-Ramsey Numbers
We consider the variation of Ramsey numbers introduced by Erdos and Pach [J. Graph Theory, 7 (1983), pp. 137-147], where instead of seeking complete or independent sets we only seek a t-homogeneous set, a vertex subset that induces a subgraph of minimum de ...
Siam Publications2015