gdd: Graphlet-based degree distributions (GDDs)

In alan-turing-institute/network-comparison: An implementation of the NetEMD alignment-free network distance measure

Graphlet-based degree distributions (GDDs)

Description

Short-cut function to create graphlet-based degree distributions from igraph graph object using the ORCA fast graphlet orbit counting package.

Usage

gdd(
  graph,
  feature_type = "orbit",
  max_graphlet_size = 4,
  ego_neighbourhood_size = 0
)

Arguments

graph	A connected, undirected, simple graph as an igraph object
feature_type	Type of graphlet-based feature to count: "graphlet" counts the number of graphlets each node participates in; "orbit" calculates the number of graphlet orbits each node participates in.
max_graphlet_size	Determines the maximum size of graphlets to count. Only graphlets containing up to max_graphlet_size nodes will be counted. Currently only size 4 and 5 are supported.
ego_neighbourhood_size	The number of steps from the source node used to select the neighboring nodes to be included in the source node ego-network.

Value

List of graphlet-based degree distributions, with each distribution represented as a dhist discrete histogram object.

alan-turing-institute/network-comparison documentation built on June 7, 2022, 10:41 p.m.