arXiv (All)
open access
A Gauge-Invariant Clustering Coefficient for Complex-Weighted Bipartite Networks
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 phas
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
- Pulsation of quantum walk on finite graph#1217143
- RZS Series: The Relational Zero State Hypothesis: Spectral Graph Dynamics and the Emergence of Spacetime Geometry#728708
- Multilayer-Dynamic Network Clustering with Application to World Trade Data#1142738
- Quantum inflation and source-transfer hierarchies are complete for tree networks#1160785
- Merged amplitude encoding for Chebyshev quantum Kolmogorov-Arnold networks#1248361
Record · ID 1249209
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