Computation of Graphlet Orbits for Nodes and Edges in Sparse Graphs

Tomaž Hočevar and Janez Demšar

Journal of Statistical Software, 2016, vol. 071, issue i10

Abstract: Graphlet analysis is a useful tool for describing local network topology around individual nodes or edges. A node or an edge can be described by a vector containing the counts of different kinds of graphlets (small induced subgraphs) in which it appears, or the "roles" (orbits) it has within these graphlets. We implemented an R package with functions for fast computation of such counts on sparse graphs. Instead of enumerating all induced graphlets, our algorithm is based on the derived relations between the counts, which decreases the time complexity by an order of magnitude in comparison with past approaches.

Date: 2016-07-28
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.jstatsoft.org/index.php/jss/article/view/v071i10/v71i10.pdf
https://www.jstatsoft.org/index.php/jss/article/do ... 10/orca_1.1-1.tar.gz
https://www.jstatsoft.org/index.php/jss/article/do ... ile/v071i10/v71i10.R
https://www.jstatsoft.org/index.php/jss/article/do ... v71i10-benchmark.zip
https://www.jstatsoft.org/index.php/jss/article/do ... hools-wiki-edges.txt
https://www.jstatsoft.org/index.php/jss/article/do ... hools-wiki-nodes.txt

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jss:jstsof:v:071:i10

DOI: 10.18637/jss.v071.i10

Access Statistics for this article

Journal of Statistical Software is currently edited by Bettina Grün, Edzer Pebesma and Achim Zeileis

More articles in Journal of Statistical Software from Foundation for Open Access Statistics
Bibliographic data for series maintained by Christopher F. Baum ().