Comparison of different generalizations of clustering coefficient and local efficiency for weighted undirected graphs
From MaRDI portal
Publication:5380647
DOI10.1162/NECO_A_00914zbMATH Open1414.05136OpenAlexW2550869724WikidataQ60433906 ScholiaQ60433906MaRDI QIDQ5380647FDOQ5380647
Authors: Yu Wang, Eshwar Ghumare, Rik Vandenberghe, Patrick Dupont 
Publication date: 6 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00914
Recommendations
- Statistical analysis of weighted networks
- A clustering coefficient for weighted networks, with application to gene expression data
- Efficient computation of the Weighted Clustering Coefficient
- Efficient Computation of the Weighted Clustering Coefficient
- Global clustering coefficient in scale-free weighted and unweighted networks
Cites Work
Cited In (8)
- Generalized coefficients of clustering in (un)directed and (un)weighted networks: an application to systemic risk quantification for cryptocoin markets
- A comparative cost assessment of coalescing epidemic control strategies in heterogeneous social-contact networks
- Title not available (Why is that?)
- Characterizing brain connectivity from human electrocorticography recordings with unobserved inputs during epileptic seizures
- Graph theoretic methods for assessing the effects of a background shear current on internal solitary waves
- Synchrony and complexity in state-related EEG networks: an application of spectral graph theory
- Statistical analysis of weighted networks
- Weighted, bipartite, or directed stream graphs for the modeling of temporal networks
Uses Software
This page was built for publication: Comparison of different generalizations of clustering coefficient and local efficiency for weighted undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380647)
