Mean clustering coefficients: the role of isolated nodes and leafs on clustering measures for small-world networks

@article{Kaiser2008MeanCC,
  title={Mean clustering coefficients: the role of isolated nodes and leafs on clustering measures for small-world networks},
  author={Marcus Kaiser},
  journal={New Journal of Physics},
  year={2008},
  volume={10},
  pages={083042}
}
  • Marcus Kaiser
  • Published 18 February 2008
  • Computer Science
  • New Journal of Physics
Many networks exhibit the small-world property of the neighborhood connectivity being higher than in comparable random networks. However, the standard measure of local neighborhood clustering is typically not defined if a node has one or no neighbors. In such cases, local clustering has traditionally been set to zero and this value influenced the global clustering coefficient. Such a procedure leads to underestimation of the neighborhood clustering in sparse networks. We propose to include θ as… 

Figures and Tables from this paper

The Local Closure Coefficient: A New Perspective On Network Clustering

The local closure coefficient is defined as the fraction of length-2 paths emanating from the head node that induce a triangle, which leads to remarkably different properties from traditional clustering coefficients.

The Local Closure Coefficient : A New Perspective On Network Clustering

The local closure coefficient is defined as the fraction of length-2 paths emanating from the head node that induce a triangle, which leads to remarkably different properties from traditional clustering coefficients.

Higher-order clustering in networks

Higher-order clustering coefficients are introduced that measure the closure probability of higher-order network cliques and provide a more comprehensive view of how the edges of complex networks cluster.

The Structure and First-Passage Properties of Generalized Weighted Koch Networks

The range of several indicators that can characterize the topological properties of generalized weighted Koch networks are determined by examining the two models under extreme conditions, p=0 and p=1, including average degree, degree distribution, clustering coefficient, diameter, and average weighted shortest path.

Tools for higher-order network analysis

Three tools for network analysis that use higher-order connectivity patterns to gain new insights into network datasets are developed: a framework to cluster nodes into modules based on joint participation in network motifs; a generalization of the clustering coefficient measurement to investigate higher- order closure patterns; and a definition of network motifS for temporal networks and fast algorithms for counting them.

EdMot: An Edge Enhancement Approach for Motif-aware Community Detection

An Edge enhancement approach for Motif-aware community detection (EdMot) is proposed, whereby the motif-based higher-order structure is leveraged and the hypergraph fragmentation issue is well addressed.

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.

Measuring Directed Triadic Closure with Closure Coefficients

This work proposes a family of directed closure coefficients that measure the frequency of triadic closure in directed graphs from the perspective of the node initiating closure and illustrates an underlying connection between the closure coefficients and moments of the joint in and out-degree distributions of the network.

Network Evolution: Theory and Mechanisms

In this chapter, it is intended to give a review on some of the important network models that are introduced in recent years to imitate the real-world network properties.
...

References

SHOWING 1-10 OF 32 REFERENCES

Subnets of scale-free networks are not scale-free: sampling properties of networks.

  • M. StumpfC. WiufR. May
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 2005
The sampling properties of a network's degree distribution under the most parsimonious sampling scheme is discussed and it is shown that this condition is indeed satisfied for some important classes of networks, notably classical random graphs and exponential random graphs.

Random graphs with arbitrary degree distributions and their applications.

It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

Edge vulnerability in neural and metabolic networks

This article tested several measures for identifying vulnerable edges and compared their prediction performance in biological and artificial networks, and identified intercluster connections in biological but not in random and scale-free benchmark networks.

Characterization of complex networks: A survey of measurements

This article presents a survey of measurements capable of expressing the most relevant topological features of complex networks and includes general considerations about complex network characterization, a brief review of the principal models, and the presentation of the main existing measurements.

How Scale-Free Are Biological Networks

10 published datasets of various biological interactions are studied and goodness-of-fit tests are performed to determine whether the given data is drawn from the power-law distribution.

Sensitivity of complex networks measurements

In this paper, measurement sensibility is quantified in terms of the relative entropy of the respective distributions, which allows one to choose the appropriate measurements in order to obtain accurate results for networks where sampling bias cannot be avoided.

Sampling biases in IP topology measurements

It is shown that when graphs are sampled using traceroute-like methods, the resulting degree distribution can differ sharply from that of the underlying graph, and why this effect arises is explored.

Classes of small-world networks.

Evidence of the occurrence of three classes of small-world networks, characterized by a vertex connectivity distribution that decays as a power law law, and the nature of such constraints may be the controlling factor for the emergence of different classes of networks are presented.

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.

Small-world networks and functional connectivity in Alzheimer's disease.

Graph theoretical analysis was applied to matrices of functional connectivity of beta band-filtered electroencephalography (EEG) channels and it was demonstrated that AD is characterized by a loss of small-world network characteristics.