Topological implications of negative curvature for biological and social networks
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Network measures that reflect the most salient properties of complex large-scale networks are in high demand in the network research community. In this paper we adapt a combinatorial measure of negative curvature (also called hyperbolicity) to parametrized finite networks, and show that a variety of biological and social networks are hyperbolic. This hyperbolicity property has strong implications on the higher-order connectivity and other topological properties of these networks. Specifically, we derive and prove bounds on the distance among shortest or approximately shortest paths in hyperbolic networks. We describe two implications of these bounds to crosstalk in biological networks, and to the existence of central, influential neighborhoods in both biological and social networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Transcriptional Regulatory Networks in Saccharomyces cerevisiae
Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. T., Thompson, C. M., Simon, I., et al. (2002) · Science · doi:10.1126/science.1075090 · Cited by 2,956
Gromov, M. (1987) · Mathematical Sciences Research Institute Publications · doi:10.1007/978-1-4613-9586-7_3 · Cited by 1,817
Dynamic reconfiguration of human brain networks during learning
Bassett, D. S., Wymbs, N. F., Porter, M. A., Mucha, P. J., Carlson, J. M., & Grafton, S. T. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1018985108 · Cited by 1,705 · cited 1×
“…PA 16802 Bhaskar DasGupta† and Nasim Mobasheri‡ Department of Computer Science, University of Illinois at Chicago, Chicago, IL 60607 (Dated: March 6, 2014) Network measures that reflect the most salient properties ofcomplex large-scale networks are in high demand in the network research community.”
BackgroundThe segment polarity network is a robust developmental module
von Dassow, G., Meir, E., Munro, E. M., & Odell, G. M. (2000) · Nature · doi:10.1038/35018085 · Cited by 1,144
Detecting rich-club ordering in complex networks
Colizza, V., Flammini, A., Serrano, M. A., & Vespignani, A. (2006) · Nature Physics · doi:10.1038/nphys209 · Cited by 1,001
Sustaining the Internet with hyperbolic mapping
Boguñá, M., Papadopoulos, F., & Krioukov, D. (2010) · Nature Communications · doi:10.1038/ncomms1063 · Cited by 463 · cited 1×
“The specific notion of negative curvature that we use is an adoption of the hyperbolicity measure for a infinite metric space with bounded local geometry as originally proposed by Gromov [7] using a so-called “4-point condition”.”
MethodA Logical Model Provides Insights into T Cell Receptor Signaling
Saez-Rodriguez, J., Simeoni, L., Lindquist, J. A., Hemenway, R., Bommhardt, U., Arndt, B., Haus, U.-U., Weismantel, R., Gilles, E. D., Klamt, S., et al. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030163 · Cited by 352
Large-scale curvature of networks
Narayan, O., & Saniee, I. (2011) · Physical Review E · doi:10.1103/physreve.84.066108 · Cited by 145 · cited 2×
“An approach for testing hyperbolicity for finite graphs was introduced and used via “scaled” Gromov hyperbolicity in [9, 11] for hyperbolicity defined via thin triangles and in [4 2] for for hyperbolicity defined via the four-point condition a s used in this paper.”
BackgroundMethod
Cited by
Bianconi, G. (2021) · doi:10.1017/9781108770996 · Cited by 223
Network geometry with flavor: From complexity to quantum geometry
Bianconi, G., & Rahmede, C. (2016) · Physical Review E · doi:10.1103/physreve.93.032315 · Cited by 150
Interdisciplinary and physics challenges of network theory
Bianconi, G. (2015) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/111/56001 · Cited by 126
Complex quantum network geometries: Evolution and phase transitions
Bianconi, G., Rahmede, C., & Wu, Z. (2015) · Physical Review E · doi:10.1103/physreve.92.022815 · Cited by 63
Metadata
- Authors
- Albert, R., DasGupta, B., & Mobasheri, N.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2014-03-24
- Volume
- 89
- Issue
- 3
- Pages
- 032811-032811
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1973894217
- Cited by
- 66
- References
- 8
- FWCI
- 4.39
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.