A spatial hypergraph model to smoothly interpolate between pairwise graphs and hypergraphs to study higher-order structures
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910907189166080 |
|---|---|
| author | Eldaghar, Omar Zhu, Yu Gleich, David F. |
| author_facet | Eldaghar, Omar Zhu, Yu Gleich, David F. |
| contents | We introduce a spatial graph and hypergraph model that smoothly interpolates between a graph with purely pairwise edges and a graph where all connections are in large hyperedges. The key component is a spatial clustering resolution parameter that varies between assigning all the vertices in a spatial region to individual clusters, resulting in the pairwise case, to assigning all the vertices in a spatial region to a single cluster, which results in the large hyperedge case. An important outcome of this model is that the spatial structure is invariant to the choice of hyperedges. Consequently, this model enables us to study clustering coefficients, graph diffusion, and epidemic spread and how their behavior changes as a function of the higher-order structure in the network with a fixed spatial substrate. We hope that our model will find future uses to distill or explain other behaviors in higher-order networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_12688 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A spatial hypergraph model to smoothly interpolate between pairwise graphs and hypergraphs to study higher-order structures Eldaghar, Omar Zhu, Yu Gleich, David F. Social and Information Networks Physics and Society We introduce a spatial graph and hypergraph model that smoothly interpolates between a graph with purely pairwise edges and a graph where all connections are in large hyperedges. The key component is a spatial clustering resolution parameter that varies between assigning all the vertices in a spatial region to individual clusters, resulting in the pairwise case, to assigning all the vertices in a spatial region to a single cluster, which results in the large hyperedge case. An important outcome of this model is that the spatial structure is invariant to the choice of hyperedges. Consequently, this model enables us to study clustering coefficients, graph diffusion, and epidemic spread and how their behavior changes as a function of the higher-order structure in the network with a fixed spatial substrate. We hope that our model will find future uses to distill or explain other behaviors in higher-order networks. |
| title | A spatial hypergraph model to smoothly interpolate between pairwise graphs and hypergraphs to study higher-order structures |
| topic | Social and Information Networks Physics and Society |
| url | https://arxiv.org/abs/2410.12688 |