Structure of Heterogeneous Networks
Rumi Ghosh, Kristina Lerman

TL;DR
This paper introduces a mathematical framework for analyzing heterogeneous networks, extending centrality and community detection methods to preserve multi-entity relationships and reveal new structural insights.
Contribution
It generalizes Bonacich centrality and modularity-maximization to heterogeneous networks, enabling more accurate analysis of complex multi-entity systems.
Findings
New insights into network structure from multi-entity link analysis
Tunable parameter reveals important nodes at different interaction scales
Enhanced community detection considering diverse entity types
Abstract
Heterogeneous networks play a key role in the evolution of communities and the decisions individuals make. These networks link different types of entities, for example, people and the events they attend. Network analysis algorithms usually project such networks unto simple graphs composed of entities of a single type. In the process, they conflate relations between entities of different types and loose important structural information. We develop a mathematical framework that can be used to compactly represent and analyze heterogeneous networks that combine multiple entity and link types. We generalize Bonacich centrality, which measures connectivity between nodes by the number of paths between them, to heterogeneous networks and use this measure to study network structure. Specifically, we extend the popular modularity-maximization method for community detection to use this centrality…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
