TY - JOUR
T1 - Edge Thresholding Working Group Report
AU - Dwyer, Tim
AU - Healy, Patrick
N1 - Publisher Copyright:
© 2008 Graph Drawing with Applications to Bioinformatics and Social Sciences. All Rights Reserved.
PY - 2008
Y1 - 2008
N2 - When working with very large networks it is typical for scientists to present a "thinned out" version of the network in order to avoid the clutter of the entire network. For example in the hypothetical case of illustrating trading patterns between groups of nations it might be appropriate to limit the inclusion of inter-nation edges to all those that are significant in terms of their weight but do not, say, associate with a country outside the grouping. Arising from a discussion during one of the introductory sessions we became interested in a problem relating to the discovery of "key events" in a network, in terms of an ordered addition of edges to the network.
AB - When working with very large networks it is typical for scientists to present a "thinned out" version of the network in order to avoid the clutter of the entire network. For example in the hypothetical case of illustrating trading patterns between groups of nations it might be appropriate to limit the inclusion of inter-nation edges to all those that are significant in terms of their weight but do not, say, associate with a country outside the grouping. Arising from a discussion during one of the introductory sessions we became interested in a problem relating to the discovery of "key events" in a network, in terms of an ordered addition of edges to the network.
UR - http://www.scopus.com/inward/record.url?scp=85174614494&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85174614494
SN - 1862-4405
VL - 8191
JO - Dagstuhl Seminar Proceedings
JF - Dagstuhl Seminar Proceedings
T2 - Graph Drawing with Applications to Bioinformatics and Social Sciences 2008
Y2 - 4 May 2008 through 9 May 2008
ER -