Hyperbolic Multiplex Network Embedding with Maps of Random Walk
Peiyuan Sun

TL;DR
This paper introduces a novel hyperbolic multiplex network embedding framework that combines community detection and random walk techniques to improve node representations and network analysis in complex multi-channel networks.
Contribution
It proposes a unified framework integrating multiplex hyperbolic embedding with community detection, reducing redundancy and enhancing network analysis accuracy.
Findings
Effective in capturing multiplex community structures
Outperforms state-of-the-art methods in network tasks
Reduces redundancy in multiplex network embeddings
Abstract
Recent research on network embedding in hyperbolic space have proven successful in several applications. However, nodes in real world networks tend to interact through several distinct channels. Simple aggregation or ignorance of this multiplexity will lead to misleading results. On the other hand, there exists redundant information between different interaction patterns between nodes. Recent research reveals the analogy between the community structure and the hyperbolic coordinate. To learn each node's effective embedding representation while reducing the redundancy of multiplex network, we then propose a unified framework combing multiplex network hyperbolic embedding and multiplex community detection. The intuitive rationale is that high order node embedding approach is expected to alleviate the observed network's sparse and noisy structure which will benefit the community detection…
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.
Taxonomy
TopicsComplex Network Analysis Techniques · Advanced Graph Neural Networks · Opinion Dynamics and Social Influence
