Efficient orbit-aware triad and quad census in directed and undirected graphs
Abstract The prevalence of select substructures is an indicator of network effects in applications such as social network analysis and systems biology. Moreover, subgraph statistics are pervasive in stochastic network models, and they need to be assessed repeatedly in MCMC sampling and estimation al...
Main Authors: | Mark Ortmann, Ulrik Brandes |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2017-06-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41109-017-0027-2 |
Similar Items
-
Mosar: Efficiently Characterizing Both Frequent and Rare Motifs in Large Graphs
by: Wenhua Guo, et al.
Published: (2022-07-01) -
Computation of Graphlet Orbits for Nodes and Edges in Sparse Graphs
by: Tomaž Hočevar, et al.
Published: (2016-07-01) -
Optimising orbit counting of arbitrary order by equation selection
by: Ine Melckenbeeck, et al.
Published: (2019-01-01) -
Subgraph Adaptive Structure-Aware Graph Contrastive Learning
by: Zhikui Chen, et al.
Published: (2022-08-01) -
RNA-As-Graphs Motif Atlas—Dual Graph Library of RNA Modules and Viral Frameshifting-Element Applications
by: Qiyao Zhu, et al.
Published: (2022-08-01)