Homologous nodes in annotated complex networks

📅 2025-05-29
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
Conventional node homology identification in complex networks with node class labels is constrained by connectivity assumptions, limiting discovery of functionally homologous nodes that lack direct links. Method: We propose a connectivity-agnostic approach that clusters nodes based on quantitative similarity of their neighborhood label distributions, formalizing and identifying “disconnected yet functionally homologous” node groups. Our framework jointly models network topology and semantic labels via neighborhood label distribution modeling, statistical significance–driven similarity measurement, and interpretable clustering. Results: Extensive cross-domain experiments on heterogeneous real-world networks—including biological interaction, academic citation, and social recommendation graphs—demonstrate robust identification of functionally coherent homologous node groups. The method exhibits strong generalizability, intrinsic interpretability, and practical transferability across domains.

Technology Category

Data Mining & Knowledge Management: Graph Mining, Social Network Analysis & CommunityConstraint Satisfaction and Optimization: Distributed CSP/OptimizationMachine Learning: Graph-based Machine Learning

Application Category

Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphsSemantics and Knowledge: Methods to enhance, augment, integrate or synergize semantic models such as knowledge graphs and LLMsSocial Networks and Social Media: Social mining and social search on the Web
📝 Abstract
Many real-world networks have associated metadata that assigns categorical labels to nodes. Analysis of these annotations can complement the topological analysis of complex networks. Annotated networks have typically been used to evaluate community detection approaches. Here, we introduce an approach that combines the quantitative analysis of annotations and network structure, which groups nodes according to similar distributions of node annotations in their neighbourhoods. Importantly the nodes that are grouped together, which we call homologues may not be connected to each other at all. By applying our approach to three very different real-world networks we show that these groupings identify common functional roles and properties of nodes in the network.
Problem

Research questions and friction points this paper is trying to address.

Groups nodes by similar annotation distributions in neighborhoods
Identifies functional roles of unconnected homologous nodes
Combines metadata and topology for complex network analysis
Innovation

Methods, ideas, or system contributions that make the work stand out.

Combines annotation and network structure analysis
Groups nodes by similar neighborhood annotation distributions
Identifies functional roles of unconnected homologous nodes
🔎 Similar Papers
2024-04-23arXiv.orgCitations: 2
S
Sung Soo Moon
Department of Chemical Engineering and Biotechnology, University of Cambridge, Philippa Fawcett Drive, Cambridge CB3 0AS, UK
S
S. Ahnert
Department of Chemical Engineering and Biotechnology, University of Cambridge, Philippa Fawcett Drive, Cambridge CB3 0AS, UK; The Alan Turing Institute, 96 Euston Road, London NW1 2DB, UK