Introduction
Traditional network modeling often assumes that the strength of a connection between two nodes is static. However, in real-world scenarios like social media or academic citations, interactions are typically driven by specific topics. For instance, two researchers might frequently cite each other on "machine learning" but never on "gardening." Standard models, such as the Stochastic Block Model, rely on a single adjacency matrix, failing to capture how the underlying connection structure shifts based on the topic of interaction.
This paper introduces a latent model that endows each node with specific "influence" and "receptivity" scores across various topics. By observing a sequence of interactions, the proposed algorithm can recover these hidden structures with provable theoretical guarantees, outperforming state-of-the-art methods in both efficiency and accuracy.
The Influence-Receptivity Model
The authors propose a parameter-efficient approach called the Influence-Receptivity Model. Instead of a massive $p \times p$ matrix to represent the network (where $p$ is the number of nodes), they use two $p \times K$ matrices, where $K$ is the number of topics:
- Influence Matrix ($B_1$): Measures how authoritative a node is on each topic.
- Receptivity Matrix ($B_2$): Measures how susceptible or interested a node is in each topic.
For any event with a known or unknown topic distribution, the probability of an edge forming between two nodes is determined by the weighted sum of their respective influence and receptivity scores. This separation of roles captures directed dynamics—such as a prominent professor who influences many but is receptive only to a few peers.
Efficiency and Generalization
A major advantage of this model is its parameter efficiency. While traditional "K-matrix" models require $p^2 K$ parameters, this model only requires $2pK$. This reduction prevents the model from overfitting to noise, a common issue in complex network analysis.
As shown in the results above, the proposed method achieves significantly lower test error compared to unconstrained models, despite having a higher training error. This indicates that the influence-receptivity structure captures the true underlying dynamics of the network rather than just memorizing the training data.
Interpretability in Real-World Networks
The model's effectiveness was tested on an ArXiv collaboration and citation dataset containing high-energy physics papers. The algorithm successfully identified the research specialties of prominent physicists based solely on their citation patterns.
For example, the model correctly identified Ashoke Sen’s primary interests in "string theory" and "black holes." This level of interpretability, combined with a "safety net" of theoretical guarantees—proving linear convergence to the true structure—makes the model a robust tool for analyzing complex, topic-driven networks.
Conclusion
By moving beyond static adjacency matrices, the Influence-Receptivity Model provides a more nuanced and accurate representation of real-world interactions. Future work may involve integrating natural language processing to link latent topics directly to text or adding time-varying components to capture how a node's interests evolve over time.
Summary updated