DocumentCode
2045727
Title
Identifying sufficient statistics in information networks
Author
Dai, Huaiyu ; Li, Husheng
Author_Institution
Dept. of Electr. & Comput. Eng., NC State Univ., Raleigh, NC
fYear
2008
fDate
19-21 March 2008
Firstpage
1019
Lastpage
1024
Abstract
Given a network targeting information transmission, this paper considers the problem of identifying a set of edges or nodes whose transmission is sufficient to determine information flow at some other parts of the network. We give a simple information theoretic characterization for this problem, which naturally leads to a graph theoretic identifying procedure.
Keywords
channel capacity; graph theory; information theory; statistical analysis; graph theory; information network statistics; information transmission; network capacity; Access protocols; Additive noise; Computer networks; Electronic mail; Gaussian noise; Information theory; Internet; Network coding; Spine; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
Conference_Location
Princeton, NJ
Print_ISBN
978-1-4244-2246-3
Electronic_ISBN
978-1-4244-2247-0
Type
conf
DOI
10.1109/CISS.2008.4558668
Filename
4558668
Link To Document