# Directed closure measures for networks with reciprocity

@article{Comandur2017DirectedCM,
title={Directed closure measures for networks with reciprocity},
author={Seshadhri Comandur and Ali Pinar and Nurcan Durak and Tamara G. Kolda},
journal={J. Complex Networks},
year={2017},
volume={5},
pages={32-47}
}
• Published 25 February 2013
• Computer Science
• J. Complex Networks
The study of triangles in graphs is a standard tool in network analysis, leading to measures such as the \emph{transitivity}, i.e., the fraction of paths of length $2$ that participate in triangles. Real-world networks are often directed, and it can be difficult to "measure" this network structure meaningfully. We propose a collection of \emph{directed closure values} for measuring triangles in directed graphs in a way that is analogous to transitivity in an undirected graph. Our study of these…

## Figures and Tables from this paper

### Measuring directed triadic closure with closure coefficients

• Computer Science
Network Science
• 2020
This work proposes a family of eight 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.

### Directed triadic closure and edge deletion mechanism induce asymmetry in directed edge properties

• Computer Science
• 2015
A simple and realistic model that can explain the emergence of the dissimilarities between the incoming and outgoing network degrees and clustering coefficients by combining directed triadic closure, random edge addition and directed edge removal is proposed and empirically validated.

### Assembling a network out of ambiguous patches

• Computer Science
2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
• 2016
It is shown that a modest amount of clustering is sufficient to assemble even very large graphs, and an achievability result is provided for noisy patches, which are obtained by edge-sampling the original egonets.

### Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks

This work proposes quark decomposition framework to locate dense subgraphs that are rich with a given motif, and focuses on networks with directed edges and categorical attributes on nodes/edges.

### Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks

This work proposes quark decomposition framework to locate dense subgraphs that are rich with a given motif, and focuses on networks with directed edges and categorical attributes on nodes/edges.

### A dynamic perspective: local interactions driving the spread of social networks

• Business
Enterp. Inf. Syst.
• 2019
This study takes a micro standpoint to quantitatively verify the extent to which local interactions affect the expansion of dynamic social networks and concludes that the attenuation of local interactions to a large extent leads to the cut-off point of the growth of the dynamic social network.

### Probabilistic Triadic Model: Relation of Triadic Closure and Social Influences

• Computer Science
MUE 2017
• 2017
The proposed Probabilistic triadic Model depends upon the probability of social influences which was missing in the existing theories and has introduced a new parameter called index of inclination for the probabilities of triadic closure formation.

### Index-based Structural Clustering on Directed Graphs

• Computer Science
2022 IEEE 38th International Conference on Data Engineering (ICDE)
• 2022
This paper proposes a new structural clustering model based on SCAN to cluster directed graphs, and proposes an index-based approach to support the efficient clustering of a given graph.

### Detecting highly cyclic structure with complex eigenpairs

• Computer Science
ArXiv
• 2016
This work demonstrates that embeddings derived from complex-valued eigenvectors associated with stochastic propagator eigenvalues near roots of unity are well-suited for extracting highly-cyclic regions of directed graphs (digraphs).

### Alignment and Assembly - Inferring Networks from Noisy Observations

This thesis addresses fundamental and practical questions of inferring a true full network from multiple observations, each one of which is subject to noise and to label ambiguity, and formulates two variations of this problem: network alignment and network assembly.

## References

SHOWING 1-10 OF 73 REFERENCES

### Reciprocity of weighted networks

• Computer Science
Scientific reports
• 2013
This work introduces a general approach to the reciprocity of weighted networks, and defines quantities and null models that consistently capture empirical reciprocity patterns at different structural levels and shows that, counter-intuitively, previous reciprocity measures are uninformative.

### Degree relations of triangles in real-world networks and graph models

• Mathematics
CIKM
• 2012
The study of degree-labeled triangles is initiated, - specifically, degree homogeneity versus heterogeneity in triangles, which yields new insight into the structure of real-world graphs.

### A scalable directed graph model with reciprocal edges

• Computer Science
ArXiv
• 2012
This study proposes a directed graph model that (i) combines the correct proportions of both reciprocal and one-way edges, (ii) matches the in-, out-, and reciprocal-degree distributions of the fitted graph, and (iii) requires only O(m) work for a graph with m edges, making it scalable to very large graphs.

### Clustering in complex directed networks.

• G. Fagiolo
• Computer Science, Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2007
The CC is extended to the case of (binary and weighted) directed networks and its expected value for random graphs is computed and is distinguished between CCs that count all directed triangles in the graph (independently of the direction of their edges) andCCs that only consider particular types of directed triangles (e.g., cycles).

### Comparing Social Networks: Size, Density, and Local Structure

Results show that, in aggregate, similarities among triad censuses of these empirica l networks are largely explained by nodal and dyadic properties of the network and distributions of mutual, asymmetric, and null dyads.

### A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal

• Computer Science
2013 IEEE 2nd Network Science Workshop (NSW)
• 2013
A null model for directed graphs inspired by the Chung-Lu model that matches the in-, out-, and reciprocal-degree distributions of the real graphs is proposed.

### Influence of reciprocal edges on degree distribution and degree correlations.

• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2009
It is shown that there is a fundamental difference between properties observed on the static network compared to the properties of networks, which are obtained by simple evolution mechanism driven by reciprocity.

### Triadic Measures on Graphs: The Power of Wedge Sampling

• Computer Science
SDM
• 2013
This work proposes a new method based on wedge sampling that allows for the fast and accurate approximation of all current variants of clustering coefficients and enables rapid uniform sampling of the triangles of a graph.

### Community structure and scale-free collections of Erdös-Rényi graphs

• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2012
The Block Two-Level Erdős-Rényi (BTER) model is proposed, and it is demonstrated that it accurately captures the observable properties of many real-world social networks.