Comparison of Different Generalizations of Clustering Coefficient and Local Efficiency for Weighted Undirected Graphs

DOI10.1162/NECO_a_00914zbMath1414.05136OpenAlexW2550869724WikidataQ60433906 ScholiaQ60433906MaRDI QIDQ5380647

Rik Vandenberghe, Patrick Dupont, Eshwar Ghumare, Yu Wang

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

zbMATH Keywords

Binary undirected graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Related Items (3)

Characterizing Brain Connectivity From Human Electrocorticography Recordings With Unobserved Inputs During Epileptic Seizures ⋮ Synchrony and complexity in state-related EEG networks: an application of spectral graph theory ⋮ Unnamed Item

Uses Software

• Brain Connectivity Toolbox

Cites Work

• Collective dynamics of ‘small-world’ networks
• A General Framework for Weighted Gene Co-Expression Network Analysis

This page was built for publication: Comparison of Different Generalizations of Clustering Coefficient and Local Efficiency for Weighted Undirected Graphs