Edge removal in undirected networks

Michael Langberg, Michelle Effros

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The edge-removal problem asks whether the removal of a \lambda-capacity edge from a given network can decrease the communication rate between source-terminal pairs by more than \lambda. We prove that for undirected networks, removing a \lambda capacity edge decreases the rate by O(\lambda. Through previously known reductive arguments, here newly applied to undirected networks, our result implies that the zero-error capacity region of an undirected network equals its vanishing-error capacity region. Whether it is possible to prove similar results for directed networks remains an open question.

Original languageEnglish
Title of host publication2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781538682098
StatePublished - 12 Jul 2021
Externally publishedYes
Event2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia
Duration: 12 Jul 202120 Jul 2021

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Conference2021 IEEE International Symposium on Information Theory, ISIT 2021
CityVirtual, Melbourne

Bibliographical note

Publisher Copyright:
© 2021 IEEE.


Dive into the research topics of 'Edge removal in undirected networks'. Together they form a unique fingerprint.

Cite this