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

@article{Wang2017ComparisonOD,
  title={Comparison of Different Generalizations of Clustering Coefficient and Local Efficiency for Weighted Undirected Graphs},
  author={Yu Wang and Eshwar Ghumare and Rik Vandenberghe and Patrick Dupont},
  journal={Neural Computation},
  year={2017},
  volume={29},
  pages={313-331}
}
Abstract Binary undirected graphs are well established, but when these graphs are constructed, often a threshold is applied to a parameter describing the connection between two nodes. Therefore, the use of weighted graphs is more appropriate. In this work, we focus on weighted undirected graphs. This implies that we have to incorporate edge weights in the graph measures, which require generalizations of common graph metrics. After reviewing existing generalizations of the clustering coefficient… 

Weighted directed clustering: interpretations and requirements for heterogeneous, inferred, and measured networks

This work proposes a fully-weighted continuous clustering coefficient that satisfies all the previously proposed criteria while also being continuous with respect to vanishing weights and demonstrates that the behavior and meaning of the Zhang–Horvath clustering and the new continuous definition provide complementary results and significantly outperform other definitions in multiple relevant conditions.

Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks

It is shown that, like graphs, stream graphs may be extended to cope with bipartite structures, with node and link weights, or with link directions, and that obtained concepts are consistent with graph and stream graph ones.

The Boundary Coefficient: a Vertex Measure for Visualizing and Finding Structure in Weighted Graphs

Combining the BC with the newly proposed concept of f -pines, this paper proposes a generally applicable method for revealing core structure in data sets with an underlying graphstructured topology, demonstrating its wide range of applicability, superior effectiveness, robustness against noise, and scalability.

Mining Topological Structure in Graphs through Forest Representations

We consider the problem of inferring simplified topological substructures—which we term backbones—in metric and non-metric graphs. Intuitively, these are subgraphs with ‘few’ nodes, multifurcations,

Clustering Coefficients for Correlation Networks

The key idea is to use three-way partial correlation or partial mutual information to measure the strength of the association between the two neighboring nodes of a focal node relative to the amount of pseudo-correlation expected from indirect paths between the nodes.

Development of a method for calculation of information protection from the clustering coefficient and information flow in social networks

  • V. Akhramovych
  • Computer Science
    Technology audit and production reserves
  • 2022
The article investigates the dynamic models of the information protection system in social networks taking into account the clustering coefficient, and also analyzes the stability of the protection system.

Method of Calculation of Information Protection from Clusterization Ratio in Social Networks

The article investigates the dynamic models of the information protection system in social networks taking into account the clustering coefficient, and also analyzes the stability of the protection

xER: An Explainable Model for Entity Resolution using an Efficient Solution for the Clique Partitioning Problem

This paper uses Clique Partition- ing Problem (CPP), which is an Integer Pro- gram (IP) to formulate ER as a graph partitioning problem and introduces an efficient solution procedure, the xER algorithm, to solve CPP as a combi- nation of finding maximal cliques in the graph and then performing generalized set packing using a novel formulation.

Clustering coefficients for correlation networks. Frontiers in Neuroinformatics

The proposed clustering coefficients tailored to correlation matrices are expected to help to understand clustering and lack thereof in correlational brain networks, such as those derived from functional time series and across-participant correlation in neuroanatomical properties.

Progressive Self-Supervised Clustering With Novel Category Discovery

A novel clustering approach referred to as the progressive self-supervised clustering method with novel category discovery (PSSCNCD), which consists of three separate procedures specifically and comprehensively demonstrates that this method outperforms other clustering approaches.

References

SHOWING 1-10 OF 25 REFERENCES

Continuous and robust clustering coefficients for weighted and directed networks

New clustering coefficients for weighted networks are introduced, which are continuous and robust against edge weight changes, and admit the continuity of generalized clustering coefficient property.

Intensity and coherence of motifs in weighted complex networks.

This paper applies motif scores and clustering coefficient to financial and metabolic networks and finds that inclusion of weights may considerably modify the conclusions obtained from the study of unweighted characteristics.

Generalizations of the clustering coefficient to weighted complex networks.

A comparative study of the several suggestions of the clustering coefficient, which is one of the central characteristics in the complex network theory, is presented.

Clustering in weighted networks

The architecture of complex weighted networks.

This work studies the scientific collaboration network and the world-wide air-transportation network, which are representative examples of social and large infrastructure systems, respectively, and defines appropriate metrics combining weighted and topological observables that enable it to characterize the complex statistical properties and heterogeneity of the actual strength of edges and vertices.

Comparing Brain Networks of Different Size and Connectivity Density Using Graph Theory

A number of methods used in social sciences that build on statistics of local network structures including exponential random graph models and motif counting are added, showing that none of the here-investigated methods allows for a reliable and fully unbiased comparison, but some perform better than others.

Reproducibility and Robustness of Graph Measures of the Associative-Semantic Network

The results showed that in case of binary networks, global graph measures exhibit a good reproducibility and robustness for networks which are not too sparse and these figures of merit depend on the graph measure and on the density of the network.

A General Framework for Weighted Gene Co-Expression Network Analysis

  • Bin ZhangS. Horvath
  • Computer Science
    Statistical applications in genetics and molecular biology
  • 2005
A general framework for `soft' thresholding that assigns a connection weight to each gene pair is described and several node connectivity measures are introduced and provided empirical evidence that they can be important for predicting the biological significance of a gene.

Economic small-world behavior in weighted networks

This paper proposes a generalization of the theory of small worlds based on two leading concepts, efficiency and cost, and valid also for weighted networks, and provides an adequate tool to quantitatively analyze the behaviour of complex networks in the real world.

Collective dynamics of ‘small-world’ networks

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.