| Title: |
Mixing patterns in graphs with higher-order structure : the role of inter-subgraph correlations |
| Authors: |
Mann, Peter; Fang, Lei; Dobson, Simon |
| Contributors: |
EPSRC; University of St Andrews.Centre for Research into Ecological & Environmental Modelling; University of St Andrews.School of Computer Science; University of St Andrews.Institute of Engineering; University of St Andrews.Centre for Interdisciplinary Research in Computational Algebra; University of St Andrews.Sir James Mackenzie Institute for Early Diagnosis |
| Publication Year: |
2026 |
| Collection: |
University of St Andrews: Digital Research Repository |
| Subject Terms: |
Complex networks; Higher-order networks; Percolation; QA75 Electronic computers. Computer science; T-NDAS; MCC; QA75 |
| Description: |
Funding: This work was partially supported by the UK Engineering and Physical Sciences Research Council under grant number EP/N007565/1 (Science of Sensor Systems Software). ; In this paper, the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree) are examined. Our analytical method is based on generating functions and is exact for the networks we model. We also propose a Monte Carlo graph generation algorithm to draw random networks from the ensemble of graphs with fixed statistics. The proposed model is used to understand the effect that network microstructure has, through the arrangement of inter-subgraph clustering, on the global connective properties of the network. We find that even in k-regular networks, with fixed joint degree distributions and clustering coefficients, the arrangement of clustering has a non-trivial influence on the percolation properties of the network. We find that subgraph disassortativity increases the percolation threshold, whilst assortativity among subgraphs decreases and broadens the transition. Finally, we use an edge disjoint clique cover to represent empirical networks using our formulation, finding the resultant model offers a significant improvement over edge-based theory. ; Peer reviewed |
| Document Type: |
article in journal/newspaper |
| File Description: |
application/pdf |
| Language: |
English |
| Relation: |
Journal of Physics: Complexity; 328555529; 105025428094; https://hdl.handle.net/10023/33437; EP/N007565/1 |
| DOI: |
10.1088/2632-072X/ae16f7 |
| Availability: |
https://hdl.handle.net/10023/33437; https://doi.org/10.1088/2632-072X/ae16f7 |
| Rights: |
Copyright © 2025 The Author(s). Published by IOP Publishing Ltd. Original content from this work may be used under the terms of the Creative Commons Attribution 4.0 licence. |
| Accession Number: |
edsbas.8BB45D43 |
| Database: |
BASE |