An unsupervised framework for comparing graph embeddings

DOI10.1093/COMNET/CNZ043zbMath1481.05112arXiv1906.04562OpenAlexW2951770249WikidataQ126981503 ScholiaQ126981503MaRDI QIDQ5022509

Paweł Prałat, Francois Theberge, Bogumił Kamiński

Publication date: 19 January 2022

Published in: Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.04562

zbMATH Keywords

graph embeddingsgeometric Chung-Lu model

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

A Scalable Unsupervised Framework for Comparing Graph Embeddings ⋮ Unsupervised framework for evaluating structural node embeddings of graphs

This page was built for publication: An unsupervised framework for comparing graph embeddings