Quantifying randomness in complex graph sets using pairwise graph distances
- 20 July 2026
- journal article
- research article
- Published by Springer Nature in Computing
- Vol. 108 (8) , 122
Abstract
No abstract availableKeywords
Funding Information
- Universiteit Gent (BOF.24Y.2019.0010.01 and bof/baf/4y/2024/01/806 and BOF/STA/202009/039)
This publication has 48 references indexed in Scilit:
- Synthetic data generation methods in healthcare: A review on open-source tools and methodsComputational and Structural Biotechnology Journal, 2024
- Identifying network structure similarity using spectral graph theoryApplied Network Science, 2018
- Correlation between graphs with an application to brain network analysisComputational Statistics & Data Analysis, 2017
- Network Motifs Detection Using Random Networks with Prescribed Subgraph Frequencies2017
- An improved MCMC algorithm for generating random graphs from constrained distributionsNetwork Science, 2016
- Uncovering the fingerprint of online social networks using a network motif based approachComputer Communications, 2016
- A survey of graph edit distancePattern Analysis and Applications, 2009
- A study of graph spectra for comparing graphs and treesPattern Recognition, 2008
- Collective dynamics of ‘small-world’ networksNature, 1998
- On human social intelligenceJournal of Social and Biological Systems, 1988