Efficient orbit-aware triad and quad census in directed and undirected graphs

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:74cc49c91f8f25e9a8c997bb1af8b5c1

ORTMANN, Mark, Ulrik BRANDES, 2017. Efficient orbit-aware triad and quad census in directed and undirected graphs. In: Applied Network Science. 2, 13. eISSN 2364-8228. Available under: doi: 10.1007/s41109-017-0027-2

@article{Ortmann2017-12Effic-39740, title={Efficient orbit-aware triad and quad census in directed and undirected graphs}, year={2017}, doi={10.1007/s41109-017-0027-2}, volume={2}, journal={Applied Network Science}, author={Ortmann, Mark and Brandes, Ulrik}, note={Article Number: 13} }

2017-08-02T13:04:39Z 2017-12 Ortmann, Mark Brandes, Ulrik 2017-08-02T13:04:39Z Brandes, Ulrik 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 algorithms. We present a new approach to count all induced and non-induced four-node subgraphs (the quad census) on a per-node and per-edge basis, complete with a separation into their non-automorphic roles in these subgraphs. It is the first approach to do so in a unified manner, and is based on only a clique-listing subroutine. Computational experiments indicate that, despite its simplicity, the approach outperforms previous, less general approaches.<br /><br />By way of the more presentable triad census, we additionally show how to extend the quad census to directed graphs. As a byproduct we obtain the asymptotically fastest triad census algorithm to date. Efficient orbit-aware triad and quad census in directed and undirected graphs Ortmann, Mark eng

Dateiabrufe seit 02.08.2017 (Informationen über die Zugriffsstatistik)

Ortmann_0-419552.pdf 47

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto