Efficient Algorithms for Constructing Multiplex Networks Embedding

Pavel Zolnikov, Maxim Zubov, Nikita Nikitinsky and Ilya Makarov

MPRA Paper from University Library of Munich, Germany

Abstract: Network embedding has become a very promising techniquein analysis of complex networks. It is a method to project nodes of anetwork into a low-dimensional vector space while retaining the structureof the network based on vector similarity. There are many methods ofnetwork embedding developed for traditional single layer networks. Onthe other hand, multilayer networks can provide more information aboutrelationships between nodes. In this paper, we present our random walkbased multilayer network embedding and compare it with single layerand multilayer network embeddings. For this purpose, we used severalclassic datasets usually used in network embedding experiments and alsocollected our own dataset of papers and authors indexed in Scopus.

Keywords: Network embedding; Multi-layer network; Machine learning on graphs (search for similar items in EconPapers)
JEL-codes: C45 I20 (search for similar items in EconPapers)
Date: 2019-09-23, Revised 2019-09-23
New Economics Papers: this item is included in nep-big, nep-cmp, nep-net and nep-ore
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/97310/1/paper5.pdf original version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:97310

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().