Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMao, Fubingen_US
dc.contributor.authorMa, Lijiaen_US
dc.contributor.authorHe, Qiangen_US
dc.contributor.authorXiao, Gaoxien_US
dc.identifier.citationMao, F., Ma, L., He, Q. & Xiao, G. (2020). Match making in complex social networks. Applied Mathematics and Computation, 371, 124928-.
dc.description.abstractMatch 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.en_US
dc.description.sponsorshipMinistry of Education (MOE)en_US
dc.relation.ispartofApplied Mathematics and Computationen_US
dc.rights© 2019 Elsevier Inc. All rights reserved.en_US
dc.subjectEngineering::Electrical and electronic engineeringen_US
dc.titleMatch making in complex social networksen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.subject.keywordsComplex Networken_US
dc.subject.keywordsMatch Makingen_US
item.fulltextNo Fulltext-
Appears in Collections:EEE Journal Articles

Page view(s)

Updated on Jul 2, 2022

Google ScholarTM




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