For two random graphs of different sizes, determine whether they have the same distribution. Functionally, given graphs A1 and A2, the method first embeds the graphs using the Adjacency Spectral Embedding, and then matches the support of the Adjacency Spectral Embeddings using optimal transport.
Package details |
|
---|---|
Author | Joshua Agterberg |
Maintainer | Joshua Agterberg <jagterberg@jhu.edu> |
License | MIT + file LICENSE |
Version | 0.1.0 |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.