Match making in complex social networks

DOI10.1016/J.AMC.2019.124928MaRDI QIDQ2287682zbMATH OpenOpenAlexWikidataFDO

Authors Fubing Mao, Lijia Ma, Qiang He, Gaoxi Xiao

Publication date 21 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124928

zbMATH Keywords

complex networksocial systemmatch makingromantic partnerstrongest partner

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Matching models (91B68)

Recommendations

• Matching influence maximization in social networks
• Friendship and stable matching
• Wellness, social networking, and algorithms
• A simple matching model with social networks
• Anarchy, stability, and utopia: creating better matchings

Cites work

• Continuous-time quantum walks on Erdős-Rényi networks
• How the indirect reciprocity with co-evolving norm and strategy for \(2\times 2\) prisoner's dilemma game works for emerging cooperation
• Matching of like rank and the size of the core in the marriage problem
• Scale-free networks: a decade and beyond
• System crash as dynamics of complex networks
• TIFIM: a two-stage iterative framework for influence maximization in social networks

Cited in

(3)

• ONE-TO-MANY NODE MATCHING BETWEEN COMPLEX NETWORKS
• Wellness, social networking, and algorithms
• Social organizations and matching theory

Describes a project that uses

Uses Software

• AlphaGo
• TIFIM

This page was built for publication: Match making in complex social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287682)