4.6 Article

Structural Identity Representation Learning for Blockchain-Enabled Metaverse Based on Complex Network Analysis

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCSS.2022.3233059

关键词

Blockchain; complex networks; graph neural networks (GNNs); graph representation; metaverse

向作者/读者索取更多资源

This article focuses on modeling and understanding the blockchain transaction network of the metaverse systems from a structural identity perspective. The complex network analysis of three metaverse-related systems is conducted, and a novel representation learning method called SVRP is proposed. Node classification and link prediction tasks are performed using graph neural networks (GNNs). Empirical results demonstrate that the proposed SVRP outperforms other existing methods in multiple tasks.
The metaverse and its underlying blockchain technology have attracted extensive attention in the past few years. How to mine, process, and analyze the tremendous data generated by the metaverse systems has posed a number of challenges. Aiming to address them, we mainly focus on modeling and understanding the blockchain transaction network from a structural identity perspective, which represents the entire network structure and reveals the relations among multiple entities. In this article, we analyze three metaverse-related systems: non-fungible token (NFT), Ethereum (ETH), and Bitcoin (BTC) from the structural-identity perspective. First, we conduct the complex network analysis of the metaverse network and obtain several new insights (i.e., power-law degree distribution, disconnection, disassortativity, preferential attachment, and non-rich-club effect). Secondly, based on such findings, we propose a novel representation learning method named structure-to-vector with random pace (SVRP) for learning both the latent representation and structural identity of the network. Thirdly, we conduct node classification and link prediction tasks with the integration of graph neural networks (GNNs). Empirical results on three real-world datasets demonstrate that our proposed SVRP outperforms other existing methods in multiple tasks. In particular, our SVRP achieves the highest node classification accuracy (Acc) (99.3%) and $F1$ -score (96.7%) while only requiring original non-attributed graphs.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据