Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.39297

Spreading Dynamics on Higher-Order Networks: A Structure-Mechanism-Behavior Perspective with Applications

Ming Xie·Shibo He·Qihao Huang·Yuzhen Fan·Jiming Chen
View original source ↗Read source document ↗Export metadata ↓

Abstract

Spreading in real-world networks, including modern communication and networked systems, often unfolds through group interactions rather than isolated pairwise contacts. Higher-order network representations such as simplicial complexes, hypergraphs, and their temporal, multilayer, and directed extensions provide a principled way to encode group interactions. Unfortunately, existing studies on spreading over these substrates remain fragmented and largely model-centric, offering limited insight into how higher-order representations and contagion mechanisms jointly shape emergent dynamics. This review addresses this gap by introducing a structure-mechanism-behavior three-level perspective that provides a systematic mapping from higher-order network structures and spreading mechanisms to collective behaviors. Within this framework, we compare how different higher-order network representations encode group interactions, introduce a taxonomy of contagion mechanisms, and analyze their structural carrying capacity, defined as the ability of a given representation to support specific contagion mechanisms and the associated dynamical behaviors. We further map specific structure-mechanism combinations to three hallmark emergent behaviors, thereby offering a unified cross-level perspective beyond existing model-centric surveys. These insights are particularly relevant for communication systems involving group interactions, such as social information spreading, cooperative protocols, and distributed networked processes. Lastly, leveraging this three-level perspective, we offer a roadmap for guiding and controlling dynamics on higher-order networks, while discussing future directions in representation choice, mechanism design, and data-driven inference.

Explore related subjects

cs.SIphysics.app-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ming Xie, Shibo He, Qihao Huang, Yuzhen Fan, Jiming Chen. 2026-10-29. Spreading Dynamics on Higher-Order Networks: A Structure-Mechanism-Behavior Perspective with Applications. https://arxiv.org/abs/2610.39297

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversing Polarization through Tolerance-Aware Recommendation and Adaptive Diversification

Recommender systems face a tension between broadening exposure to diverse viewpoints and avoiding interactions that reinforce extreme positions. This tension is especially consequential in already polarized populations. Here we investigate whether recommendation strategies can reverse polarization rather than merely slow its development. Building on the Attraction--Repulsion Model of opinion dynamics, we introduce two complementary design principles: Tolerance-aware recommendation, which seeks to learn each individual's tolerance for disagreement and reduces exposure to viewpoints beyond that tolerance, and adaptive diversification, which broadens exposure for agents with more extreme opinions while retaining stronger personalization for moderates. Agent-based experiments show that highly personalized recommendations intensify polarization under polarized initial conditions. Tolerance awareness alone primarily slows polarization, whereas combining it with adaptive diversification can reduce polarization below its initial level and, under suitable conditions, restore consensus. Additional experiments incorporating persistent extreme influencers and a spiral-of-silence mechanism show that the combined strategy can mitigate polarization under social pressure and selective participation. To examine whether these findings extend beyond predefined opinion-update rules, we repeat the experiments on a simulated social platform populated by 100 LLM-driven agents prompted to move toward opinions similar to their own and away from those that differ substantially. Across three runs, the combined strategy is again the only recommendation policy tested that reverses polarization in every run. These findings distinguish polarization prevention from reversal and identify tolerance-aware, adaptive exposure as a promising recommendation design principle for reconnecting divided populations.

cs.SI↗
arXiv2026

Discovery of connectivity-trainability trade-off of IQP circuits for Hamiltonian optimization

Instantaneous Quantum Polynomial-time (IQP) circuits are promising candidates for near-term quantum computing due to the conjectured classical hardness of their sampling task and their shallow, highly parallelizable structure. Despite extensive studies of their complexity-theoretic properties, the role of circuit connectivity in their trainability as variational ansatze remains poorly understood. In this work, we present an investigation of IQP circuits for Hamiltonian optimization that traces a mechanistic chain linking circuit connectivity, entanglement generation, and gradient scaling: increasing connectivity drives the circuit output toward Haar-like statistics and volume-law entanglement, and this increase in entanglement is consistently associated with an exponential decay of the gradient variance and degraded optimization performance, while sparser architectures retain stable gradients at the cost of global expressibility and entanglement capacity. This connectivity-entanglement-gradient mechanism produces a nontrivial connectivity-trainability trade-off, demonstrating that effective IQP-based Hamiltonian optimization requires a balance between global expressibility and trainability rather than maximal expressivity alone. In particular, on our benchmarks, a circuit generating no entanglement already matches the optimization performance of more highly connected circuits, and a circular topology retains entanglement capacity while preserving trainability, making it a broadly effective choice among the architectures considered.

cs.SI↗
arXiv2026

Density Decomposition on Hypergraphs

Hypergraphs capture higher-order interactions involving multiple entities. Existing decomposition models, such as $k$-core and nbr-$k$-core, rely on degree or neighborhood constraints and may overlook fine-grained density variations. We propose a $(k,δ)$-dense subhypergraph model based on capped hyperedge contributions. For each parameter pair, the unique dense set is the inclusionwise smallest maximizer of a penalized capped hyperedge contribution. These dense sets form a nested hierarchy characterized by egalitarian $δ$-orientations and hypergraph reachability. We develop three algorithms for dense subhypergraph search and two for complete density decomposition. Both decomposition algorithms use integral flow balancing: Flow-Decomp extracts density levels through strongly connected component condensation, while Reverse-Decomp uses direct reverse propagation. Once an egalitarian orientation is obtained, both recover all density levels in linear time. We further derive sandwich bounds that restrict computation to equivalent residual subproblems and develop incremental algorithms for maintaining the hierarchy under hyperedge insertions and deletions. Experiments on nine real-world hypergraphs, including datasets with over 15 million vertices, compare our methods with four established decomposition models. The results show that Reverse-Decomp improves decomposition efficiency, incremental maintenance outperforms recomputation in the tested settings, and the proposed model captures density structures overlooked by degree-based decompositions.

cs.SI↗