Dynamic Homophily with Imperfect Recall: Modeling Resilience in Adversarial Networks
Not on the map. Why?
Abstract (arXiv)
The purpose of this study is to investigate how homophily, memory constraints, and adversarial disruptions collectively shape the resilience and adaptability of complex networks. To achieve this, we develop a new framework that integrates explicit memory decay mechanisms into homophily-based models and systematically evaluate their performance across diverse graph structures and adversarial settings. Our methods involve extensive experimentation on synthetic datasets, where we vary decay functions, reconnection probabilities, and similarity measures, primarily comparing cosine similarity with traditional metrics such as Jaccard similarity and baseline edge weights. The results show that cosine similarity achieves up to a 30% improvement in stability metrics in sparse, convex, and modular networks. Moreover, the refined value-of-recall metric demonstrates that strategic forgetting can bolster resilience by balancing network robustness and adaptability. The findings underscore the critical importance of aligning memory and similarity parameters with the structural and adversarial dynamics of the network. By quantifying the tangible benefits of incorporating memory constraints into homophily-based analyses, this study offers actionable insights for optimizing real-world applications, including social systems, collaborative platforms, and cybersecurity contexts.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 61 references that are in the map. First posted on arXiv 13 Dec 2025.
Builds on
16 of 61 references.
References · 16
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
- 2020The Pushshift Reddit Datasetcited by 289
- 2019Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensicscited by 158
- 2017Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphscited by 149
- 2022A Survey of Multi-Agent Deep Reinforcement Learning with Communicationcited by 103
- 2015Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveyscited by 59
- 2017Cooperating with Machinescited by 39
- 2016Team-maxmin equilibrium: efficiency bounds and algorithmscited by 9
- 2023Spear and Shield: Adversarial Attacks and Defense Methods for Model-Based Link Prediction on Continuous-Time Dynamic Graphscited by 9
- 2020Reinforcement Learning-based Black-Box Evasion Attacks to Link Prediction in Dynamic Graphscited by 6
- 2024THeGCN: Temporal Heterophilic Graph Convolutional Networkcited by 6
4 more
- 2014Imperfect-Recall Abstractions with Bounds in Gamescited by 5
- 2023Higher-order correlations reveal complex memory in temporal hypergraphscited by 4
- 2024The Value of Recall in Extensive-Form Gamescited by 3
- 2020Forming Compatible Teams in Signed Networkscited by 1
Built on by
Not cited yet.