Complex networks with complex weights

DOI10.1103/PHYSREVE.109.024314arXiv2212.06257MaRDI QIDQ6507283FDOQ6507283

Authors: Lucas Böttcher, Mason A. Porter 

Abstract: In many scientific applications, it is common to use binary (i.e., unweighted) edges in the study of networks to examine collections of entities that are either adjacent or not adjacent. Researchers have generalized such binary networks to incorporate edge weights, which allow one to encode node--node interactions with heterogeneous intensities or frequencies (e.g., in transportation networks, supply chains, and social networks). Most such studies have considered real-valued weights, despite the fact that networks with complex weights arise in fields as diverse as quantum information, quantum chemistry, electrodynamics, rheology, and machine learning. Many of the standard approaches from network science that originated in the study of classical systems and are based on real-valued edge weights cannot be applied directly to networks with complex edge weights. In this paper, we examine how standard network-analysis methods fail to capture structural features of networks with complex weights. We then generalize several network measures to the complex domain and show that random-walk centralities provide a useful tool to examine node importances in networks with complex weights.

This page was built for publication: Complex networks with complex weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507283)