Learning and Scaling Directed Networks via Graph Embedding
- 30 December 2017
- book chapter
- Published by Springer Nature
- p. 634-650
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Motifs in triadic random graphs based on Steiner triple systemsPhysical Review E, 2013
- Finding Statistically Significant Communities in NetworksPLOS ONE, 2011
- Using graph theory to analyze biological networksBioData Mining, 2011
- Hyperbolic geometry of complex networksPhysical Review E, 2010
- Multifractal network generatorProceedings of the National Academy of Sciences, 2010
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communitiesPhysical Review E, 2009
- R-MAT: A Recursive Model for Graph Mining2004
- Scale-Free Networks Are UltrasmallPhysical Review Letters, 2003
- Pseudofractal scale-free webPhysical Review E, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002