Valued Ties Tell Fewer Lies: Why Not To Dichotomize Network Edges With Thresholds

Abstract

In order to conduct analyses of networked systems where connections between individuals take on a range of values - counts, continuous strengths or ordinal rankings - a common technique is to dichotomize the data according to their positions with respect to a threshold value. However, there are two issues to consider: how the results of the analysis depend on the choice of threshold, and what role the presence of noise has on a system with respect to a fixed threshold value. We show that while there are principled criteria of keeping information from the valued graph in the dichotomized version, they produce such a wide range of binary graphs that only a fraction of the relevant information will be kept. Additionally, while dichotomization of predictors in linear models has a known asymptotic efficiency loss, the same process applied to network edges in a time series model will lead to an efficiency loss that grows larger as the network increases in size.

36 pages, 15 figures

References in corpus (1)

• The Product Space Conditions the Development of Nations

Cited by in corpus (10)

• Exponential-Family Random Graph Models for Valued Networks
• Adapting the Stochastic Block Model to Edge-Weighted Networks
• Exponential-Family Random Graph Models for Rank-Order Relational Data
• A Weighted and Normalized Gould-Fernandez brokerage measure
• The Strength of Arcs and Edges in Interaction Networks: Elements of a Model-Based Approach
• Valued Ties Tell Fewer Lies, II: Why Not To Dichotomize Network Edges With Bounded Outdegrees
• The Social Contagion Hypothesis: Comment on "Social Contagion Theory: Examining Dynamic Social Networks and Human Behavior"
• Clustering on the Edge: Learning Structure in Graphs
• Persistent homology method to detect block structures in weighted networks
• A Practical Two-Sample Test for Weighted Random Graphs