Smallworldness in hypergraphs
Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. The evidence sparkled a wealth of studies trying to reveal possible mechanisms through which the pair...
Main Authors: | Tanu Raghav, Stefano Boccaletti, Sarika Jalan |
---|---|
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2023-01-01
|
Series: | Journal of Physics: Complexity |
Subjects: | |
Online Access: | https://doi.org/10.1088/2632-072X/acf430 |
Similar Items
-
Graphs and hypergraphs /
by: 433429 Berge, Claude
Published: (1976) -
On the planarity of the k-zero-divisor hypergraphs
by: T. Tamizh Chelvam, et al.
Published: (2015-11-01) -
New strong colouring of hypergraphs
by: Sandro Rajola, et al.
Published: (2011-06-01) -
Monochromatic Edges in Complete Multipartite Hypergraphs
by: Teeradej Kittipassorn, et al.
Published: (2022-07-01) -
Problems on chromatic polynomials of hypergraphs
by: Ruixue Zhang, et al.
Published: (2020-10-01)