Search Results for author:
Found 5 papers, 3 papers with code
Self-similarity of Communities of the ABCD Model
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes.
Unsupervised Framework for Evaluating and Explaining Structural Node Embeddings of Graphs
For classical node embeddings there exists a framework which helps data scientists to identify (in an unsupervised way) a few embeddings that are worth further investigation.
Modularity of the ABCD Random Graph Model with Community Structure
Indeed, the modularity function is often used to measure the presence of community structure in networks.
An Unsupervised Framework for Comparing Graph Embeddings
Graph embedding is a transformation of vertices of a graph into set of vectors.
Clustering via Hypergraph Modularity
Despite the fact that many important problems (including clustering) can be described using hypergraphs, theoretical foundations as well as practical algorithms using hypergraphs are not well developed yet.
Combinatorics
