Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/154616
Title: Match making in complex social networks
Authors: Mao, Fubing
Ma, Lijia
He, Qiang
Xiao, Gaoxi
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2020
Source: Mao, F., Ma, L., He, Q. & Xiao, G. (2020). Match making in complex social networks. Applied Mathematics and Computation, 371, 124928-. https://dx.doi.org/10.1016/j.amc.2019.124928
Project: MOE2016-T2-1-119
Journal: Applied Mathematics and Computation
Abstract: Match making is of significant importance in some social systems. People may need to seek for romantic partners, teammates, collaborators, etc. In this paper, we propose a minimalist framework of match making in complex networks. Specially we adopt a simple model where each individual would greedily seek for making a match with the strongest partner within his/her social connection range. We explore a few matching schemes including greedy mode, roulette wheel selection mode and completely random mode on different networks. We also investigate when social systems become more densely connected, how the match making process would be affected. Our observations show that, in a more densely connected social network, individuals’ efforts for seeking for matches with the strongest partners would be more likely to end up with matching with someone similar to themselves. Meanwhile, the cost of such an approach may be quickly increased. The implications of such observations in real-life systems and open problems are briefly discussed.
URI: https://hdl.handle.net/10356/154616
ISSN: 0096-3003
DOI: 10.1016/j.amc.2019.124928
Rights: © 2019 Elsevier Inc. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Page view(s)

22
Updated on Jul 2, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.