The mixing properties of networks are usually inferred by comparing the degree of a node with the average degree of its neighbors. This kind of analysis often leads to incorrect conclusions: Assortative patterns may appear reversed by a mechanism known as Simpson's paradox. We prove this fact by analytical calculations and simulations on three classes of growing networks based on preferential attachment and fitness, where the disassortative behavior observed is a spurious effect. Our results give a crucial contribution to the debate about the origin of disassortative mixing, since networks previously classified as disassortative reveal instead assortative behavior to a careful analysis.
Mixing properties of growing networks and Simpson's paradox
Colaiori F
2006
Abstract
The mixing properties of networks are usually inferred by comparing the degree of a node with the average degree of its neighbors. This kind of analysis often leads to incorrect conclusions: Assortative patterns may appear reversed by a mechanism known as Simpson's paradox. We prove this fact by analytical calculations and simulations on three classes of growing networks based on preferential attachment and fitness, where the disassortative behavior observed is a spurious effect. Our results give a crucial contribution to the debate about the origin of disassortative mixing, since networks previously classified as disassortative reveal instead assortative behavior to a careful analysis.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
