Masaki Aida

Masaki Aida

Auto-generated profile, based on publicly available information

Masaki Aida

Tokyo Metropolitan University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2018 in IEICE Transactions on Communications
Verified
Journal Article
Closed access
PDF file
CTChisa Takano
Chisa Takano
MAMasaki Aida
Masaki Aida
In recent years, with the rapid development of the Internet and cloud computing, an enormous amount of information is exchanged on various social networking services. In order to handle and maintain such a mountain of information properly by limited resources in the network, it is very important to comprehend the dynamics for propagation of information or activity on the social network. One of many indices used by social network analysis which investigates the network structure is “node centrality”. A common characteristic of conventional node centralities is that it depends on the topological structure of network and the value of node centrality does not change unless the topology changes. The network dynamics is generated by interaction between users whose strength is asymmetric in general. Network structure reflecting the asymmetric interaction between users is modeled by a directed graph, and it is described by an asymmetric matrix in matrix-based network model. In this paper, we showed an oscillation model for describing dynamics on networks generated from a certain kind of asymmetric interaction between nodes by using a symmetric matrix. Moreover, we propose a new extended index of well-known two node centralities based on the oscillation model. In addition, we show that the proposed index can describe various aspect of node centrality that considers not only the topological structure of the network, but also asymmetry of links, the distribution of source node of activity, and temporal evolution of activity propagation by properly assigning the weight of each link. The proposed model is regarded as the fundamental framework for different node centralities.

1 April 2019 in IEICE Transactions on Communications
Verified
Journal Article
Open access
SFSatoshi Furutani
Satoshi Furutani
CTChisa Takano
Chisa Takano
MAMasaki Aida
Masaki Aida

28 July 2023 in IEEE Access
Verified
Journal Article
Open access
SFSatoshi Furutani
Satoshi Furutani
TSToshiki Shibahara
Toshiki Shibahara
MAMitsuaki Akiyama
Mitsuaki Akiyama
MAMasaki Aida
Masaki Aida
Homophily is a well-known phenomenon in social networks, which is the tendency for individuals with similar characteristics to connect with each other. However, it is still unclear how homophily affects information diffusion. In this paper, we analyze the effect of homophily on information diffusion dynamics through theoretical analysis and numerical simulations. To this end, we consider the information diffusion process on a modular network consisting of two types of nodes with different diffusion properties: agitators and skeptists. In this setting, homophily is represented as the localization of agitators towards a specific community within a network. The analysis reveals that homophily has a significant effect on information diffusion dynamics. Although community structure (i.e., the connectivity between communities) has little or no effect on prevalence rate and diffusion speed without homophily, it affects them with homophily. Especially in networks with strongly separated communities, homophily facilitates local diffusion and inhibits global diffusion.

18 January 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Open access
SFSatoshi Furutani
Satoshi Furutani
TSToshiki Shibahara
Toshiki Shibahara
MAMitsuaki Akiyama
Mitsuaki Akiyama
MAMasaki Aida
Masaki Aida
Online social networks (OSNs) are threatened by Sybil attacks, which create fake accounts (also called Sybils) on OSNs and use them for various malicious activities. Therefore, Sybil detection is a fundamental task for OSN security. Most existing Sybil detection methods are based on the graph structure of OSNs, and various methods have been proposed recently. However, although almost all methods have been compared experimentally in terms of detection performance and noise robustness, theoretical understanding of them is still lacking. In this study, we show that existing graph-based Sybil detection methods can be interpreted in a unified framework of low-pass filtering. This framework enables us to theoretically compare and analyze each method from two perspectives: filter kernel properties and the spectrum of shift matrices. Our analysis reveals that the detection performance of each method depends on the effectiveness of the low-pass filtering. Furthermore, on the basis of the analysis, we propose a novel Sybil detection method called SybilHeat. Numerical experiments on synthetic graphs and real social networks demonstrate that SybilHeat performs consistently well on graphs with various structural properties. This study lays a theoretical foundation for graph-based Sybil detection and leads to a better understanding of Sybil detection methods.

31 July 2017
Verified
Conference Paper
Open access
PDF file
MAMasaki Aida
Masaki Aida
CTChisa Takano
Chisa Takano
MMMasayuki Murata
Masayuki Murata
This paper proposes an oscillation model for describing the flaming phenomena in on-line social networks, and discusses countermeasures to flaming based on the proposed oscillation model. The most significant feature of the proposed model is that the cause of flaming can be explained by the structure of the network. Based on the proposed model, we can suppress the generation of flaming by controlling link weights of a part of the network. This passive solution to flaming is important for the stable operation of social media networks.

19 October 2021 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Open access
PDF file
TIToshi Ikeya
Toshi Ikeya
MAMasaki Aida
Masaki Aida
Summary: The oscillation model, based on the wave equation on networks, can describe user dynamics in online social networks. The fundamental equation of user dynamics can be introduced into the oscillation model to explicitly describe the causal relation of user dynamics yielded by certain specific network structures. Moreover, by considering the sparseness of the link structure of online social networks, a novel fundamental equation of different forms has been devised. In this article, we derive a closed‐form solution of the new fundamental equation. Also, we show that the closed‐form solution of the new fundamental equation can generate the general solution of the original wave equation and investigate the characteristics of the derived general solution.