Clustering in complex directed networks.

  title={Clustering in complex directed networks.},
  author={Giorgio Fagiolo},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={76 2 Pt 2},
  • G. Fagiolo
  • Published 18 December 2006
  • Computer Science, Mathematics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Many empirical networks display an inherent tendency to cluster, i.e., to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs, has been recently generalized to weighted, undirected networks. Here we extend the CC to the case of (binary and weighted) directed networks and we compute its expected value for random graphs. We distinguish between CCs that count all directed triangles in… 

Figures and Tables from this paper

Directed Random Geometric Graphs

The DRGG model is introduced, which is an extension of the random geometric graph model, and it is proved that it is scale-free with respect to the indegree distribution, has binomial outdegree distribution, and has a high clustering coefficient, has few edges and is likely small-world.

Diclique Clustering in a Directed Random Graph

It is shown that the digraph admits nontrivial clustering properties of the aforementioned type, as well as power-law indegree and outdegree distributions, and a two-mode statistical network model consisting of actors and auxiliary attributes is introduced.

Directed clustering in weighted networks: a new perspective

A clustering coefficient for complete weighted networks

For this situation, the concept of clustering is redefined, and computational techniques are presented for computing an associated clustering coefficient for complete weighted undirected or directed networks.

Optimal scales in weighted networks

This work introduces an information-theoretic approach leading to the least biased generalization of binary properties to weighted networks, and at the same time fixing the optimal scale of link intensities.

Directed closure measures for networks with reciprocity

This work proposes a collection of directed closure values for measuring triangles in directed graphs in a way that is analogous to transitivity in an undirected graph, and immediately sees that reciprocal edges have a high propensity to participate in triangles.

The importance of directed triangles with reciprocity: patterns and algorithms

This work proposes a collection of directed closure values that are analogues of the classic transitivity measure (the fraction of wedges that participate in triangles) and presents the first sampling based algorithm for fast estimation of directed triangles.

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 Network Estimation by the Use of Topological Graph Metrics

This work establishes a new link between graph theory, network science and optimisation by developing optimisation methods that incorporate prior knowledge of a network's topology.

Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter

It is shown that the interest clustering coefficient is larger than classic directed clustering coefficients introduced in the literature, which shows the relevancy of the metric to capture the informational aspects of directed graphs.



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.

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.

The Structure and Function of Complex Networks

Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

Ensemble approach to the analysis of weighted networks.

We present an approach to the analysis of weighted networks, by providing a straightforward generalization of any network measure defined on unweighted networks, such as the average degree of the

Empirical Analysis of an Evolving Social Network

This work analyzed a dynamic social network comprising 43,553 students, faculty, and staff at a large university, in which interactions between individuals are inferred from time-stamped e-mail headers recorded over one academic year and are matched with affiliations and attributes.

Topology of the world trade web.

  • M. SerranoM. Boguñá
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
This network displays the typical properties of complex networks, namely, scale-free degree distribution, the small-world property, a high clustering coefficient, and, in addition, degree-degree correlation between different vertices.

Analysis of a large-scale weighted network of one-to-one human communication

A positive correlation between the overlap and weight of a link is reported, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis.

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.