Cargando…
Connectivity of Random Geometric Hypergraphs
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie within a certain radius. From a modelling perspective, we explain how the model captures higher-order co...
Autores principales: | de Kergorlay, Henry-Louis, Higham, Desmond J. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10670679/ https://www.ncbi.nlm.nih.gov/pubmed/37998246 http://dx.doi.org/10.3390/e25111555 |
Ejemplares similares
-
Epidemics on hypergraphs: spectral thresholds for extinction
por: Higham, Desmond J., et al.
Publicado: (2021) -
Generative hypergraph models and spectral embedding
por: Gong, Xue, et al.
Publicado: (2023) -
Geometric theory for hypergraph matching
por: Keevash, Peter, et al.
Publicado: (2015) -
Hypergraph-based connectivity measures for signaling pathway topologies
por: Franzese, Nicholas, et al.
Publicado: (2019) -
Non-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs
por: Guo, Jin-Li, et al.
Publicado: (2016)