Learn R Programming

GMPro (version 0.1.0)

Graph Matching with Degree Profiles

Description

Functions for graph matching via nodes' degree profiles are provided in this package. The models we can handle include Erdos-Renyi random graphs and stochastic block models(SBM). More details are in the reference paper: Yaofang Hu, Wanjie Wang and Yi Yu (2020) .

Copy Link

Version

Install

install.packages('GMPro')

Monthly Downloads

157

Version

0.1.0

License

GPL-2

Maintainer

Yaofang Hu

Last Published

June 25th, 2020

Functions in GMPro (0.1.0)

DPdistance

calculate degree profile distances between 2 graphs.
SCORE

Spectral Clustering On Ratios-of-Eigenvectors.
DPmatching

calculate degree profile distances between two graphs and match nodes.
EEpost

Post-processing step for edge-exploited graph matching.
EEpre

Edge exploited degree profile graph matching with preprocessing.
EE_SBM

Edge exploited degree profile graph matching with community detection.
DP_SBM

Degree profile graph matching with community detection.
DPedge

The edge-exploited version of DPmatching.