Metraipolis › archive › dc_8682f30bbf18
A Gauge-Invariant Clustering Coefficient for Complex-Weighted Bipartite Networks — arXiv:2610.11929
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11929
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:18:18.624Z
- SHA-256 of the archived text
bb8d14f80b80de03c8ad9513e35402ab23256ae3075793765a77bd60bd491c9d- Stable URL of this page
https://metraipolis.com/documento/dc_8682f30bbf18
How to cite
A Gauge-Invariant Clustering Coefficient for Complex-Weighted Bipartite Networks — arXiv:2610.11929 — arXiv (en), https://arxiv.org/abs/2610.11929 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8682f30bbf18 (Metraipolis archive dc_8682f30bbf18, sha256 bb8d14f80b80de03c8ad9513e35402ab23256ae3075793765a77bd60bd491c9d)
BibTeX
@misc{dc8682f30bbf18,
title = {A Gauge-Invariant Clustering Coefficient for Complex-Weighted Bipartite Networks — arXiv:2610.11929},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11929},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8682f30bbf18; sha256 bb8d14f80b80de03c8ad9513e35402ab23256ae3075793765a77bd60bd491c9d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11929. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Structural measures such as the clustering coefficient and the average shortest-path length characterise how a network is organised. These measures are typically formulated for real, non-negative edge weights. A class of quantum and photonic architectures has complex edge weights instead, whose phases determine whether alternative routes interfere constructively or destructively. These architectures are also bipartite, so triangles are absent and the smallest closed cycle is a four-node square. Existing measures address complex weights and bipartite structure separately: bipartite clustering coefficients quantify clustering through four-node squares but do not contain phase information, while interferometric coefficients retain phase but are defined on triangles. In this work, we define a clustering coefficient for complex-weighted bipartite networks which reduces to the classical bipartite coefficient when the phases vanish, becomes negative when alternative routes cancel, and can be obtained for all nodes from a single sparse matrix product. We show that the phase accumulated around a square is the smallest gauge-invariant carrier of structural phase information in a bipartite network. The clustering coefficient factorises into a topological contribution and a phase contribution, making a bipartite Watts--Strogatz ensemble analytically tractable. For phases uniformly distributed on $[-\Delta,\Delta]$, the mean phase contribution is $(\sin\Delta/\Delta)^4$, independent of node, degree, and topology. We also derive closed-form expressions for the clustering coefficient, open-path visibility, and phase variance. We numerically verify these predictions and further show that phase disorder increases coherent distance. Tema degli esploratori: governance digitale e beni comuni (elenco arXiv cs.SI, nuovi lavori del giorno). Categorie arXiv: Physics and Society (physics.soc-ph) ; Social and Information Networks (cs.SI); Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2610.11929 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:49:45.616Z dalla pagina https://arxiv.org/list/cs.SI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).