Structural Bounds on the Dyadic Effect

Abstract

In this paper we consider the dyadic effect introduced in complex networks when nodes are distinguished by a binary characteristic. Under these circumstances two independent parameters, namely dyadicity and heterophilicity, are able to measure how much the assigned characteristic affects the network topology. All possible configurations can be represented in a phase diagram lying in a two-dimensional space that represents the feasible region of the dyadic effect, which is bound by two upper bounds on dyadicity and heterophilicity. Using some network's structural arguments, we are able to improve such upper bounds and introduce two new lower bounds, providing a reduction of the feasible region of the dyadic effect as well as constraining dyadicity and heterophilicity within a specific range. Some computational experiences show the bounds' effectiveness and their usefulness with regards to different classes of networks.

References in corpus (2)

• The Rich-Club Phenomenon In The Internet Topology
• Assortativity Decreases the Robustness of Interdependent Networks

Cited by in corpus (5)

• Network constraints on the mixing patterns of binary node metadata
• Rich-Club Ordering and the Dyadic Effect: Two Interrelated Phenomena
• Investigating the configurations in cross-shareholding: a joint copula-entropy approach
• Tsallis entropy for cross-shareholding network configurations
• Influence measures in subnetworks using vertex centrality