arXiv (All)
open access
Betweenness centrality in dense spatial networks
computational-geometrydisordered-systems-and-neural-networksnetworking-and-internet-architecturephysics-and-societystatistical-mechanics
The betweenness centrality (BC) is an important quantity for understanding the structure of complex large networks. However, its calculation is in general difficult and known in simple cases only. In particular, the BC has been exactly computed for graphs constructed over a set of $N$ points in the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Regularisation of mixture density networks#234228
- Comparing subsampling strategies for efficient pairwise analysis of large pathogen genomic and spatial datasets: An application to <i>Mycobacterium tuberculosis</i> transmission#1067599
- Spatial In-Profile Monitoring via Latent Tensor Gaussian Process with Mixed Effects#1053918
- On accessibility of the core in mutidimensional spatial majority voting situations#996827
- Compatibility and Market Structure for Network Goods#942295
Record · ID 1011930
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive