Theory of preference modelling for communities in scale-free networks

被引:0
|
作者
József Dombi
Sakshi Dhama
机构
[1] University of Szeged,Department of Algorithms and Artificial Intelligence, Institute of Informatics
[2] Hungarian Academy of Sciences,undefined
[3] Budapest,undefined
来源
关键词
Overlapping-communities; Continuous-value-logic; Preference-implication; Power-law; Networks;
D O I
暂无
中图分类号
学科分类号
摘要
Detecting a community structure on networks is a problem of interest in science and many other domains. Communities are special structures which may consist nodes with some common features. The identification of overlapping communities can clarify not so apparent features about relationships among the nodes of a network. A node in a community can have a membership in a community with a different degree. Here, we introduce a fuzzy based approach for overlapping community detection. A special type of fuzzy operator is used to define the membership strength for the nodes of community. Fuzzy systems and logic is a branch of mathematics which introduces many-valued logic to compute the truth value. The computed truth can have a value between 0 and 1. The preference modelling approach introduces some parameters for designing communities of particular strength. The strength of a community tells us to what degree each member of community is part of a community. As for relevance and applicability of the community detection method on different types of data and in various situations, this approach generates a possibility for the user to be able to control the overlap regions created while detecting the communities. We extend the existing methods which use local function optimization for community detection. The LFM method uses a local fitness function for a community to identify the community structures. We present a community fitness function in pliant logic form and provide mathematical proofs of its properties, then we apply the preference implication of continuous-valued logic. The preference implication is based on two important parameters ν\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\nu$$\end{document} and α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}. The parameter ν\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\nu$$\end{document} of the preference-implication allows us to control the design of the communities according to our requirement of the strength of the community. The parameter α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document} defines the sharpness of preference implication. A smaller value of the threshold for community membership creates bigger communities and more overlapping regions. A higher value of community membership threshold creates stronger communities with nodes having more participation in the community. The threshold is controlled by δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta$$\end{document} which defines the degree of relationship of a node to a community. To balance the creation of overlap regions, stronger communities and reducing outliers we choose a third parameter δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta$$\end{document} in such a way that it controls the community strength by varying the membership threshold as community evolves over time. We test the theoretical model by conducting experiments on artificial and real scale-free networks. We test the behaviour of all the parameters on different data-sets and report the outliers found. In our experiments, we found a good relationship between ν\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\nu$$\end{document} and overlapping nodes in communities.
引用
收藏
相关论文
共 50 条
  • [1] Theory of preference modelling for communities in scale-free networks
    Dombi, Jozsef
    Dhama, Sakshi
    [J]. APPLIED NETWORK SCIENCE, 2021, 6 (01)
  • [2] The structure of communities in scale-free networks
    Jiang, Jiaojiao
    Wen, Sheng
    Yu, Shui
    Xiang, Yang
    Zhou, Wanlei
    Hassan, Houcine
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2017, 29 (14):
  • [3] EFFICIENCY DYNAMICS ON SCALE-FREE NETWORKS WITH COMMUNITIES
    Qi, Xin
    Shao, Zhi-Gang
    Qi, Ji
    Yang, Lei
    [J]. MODERN PHYSICS LETTERS B, 2010, 24 (14): : 1549 - 1557
  • [4] Exactly scale-free scale-free networks
    Zhang, Linjun
    Small, Michael
    Judd, Kevin
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2015, 433 : 182 - 197
  • [5] Discretized kinetic theory on scale-free networks
    Bertotti, Maria Letizia
    Modanese, Giovanni
    [J]. EUROPEAN PHYSICAL JOURNAL-SPECIAL TOPICS, 2016, 225 (10): : 1879 - 1891
  • [6] Markov chains theory for scale-free networks
    Chen, QH
    Shi, DH
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2006, 360 (01) : 121 - 133
  • [7] Discretized kinetic theory on scale-free networks
    Maria Letizia Bertotti
    Giovanni Modanese
    [J]. The European Physical Journal Special Topics, 2016, 225 : 1879 - 1891
  • [8] Subnets of scale-free networks are not scale-free: Sampling properties of networks
    Stumpf, MPH
    Wiuf, C
    May, RM
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2005, 102 (12) : 4221 - 4224
  • [9] Scale-free networks
    Barabási, AL
    Bonabeau, E
    [J]. SCIENTIFIC AMERICAN, 2003, 288 (05) : 60 - 69
  • [10] Performance analysis of scale-free communities in ad hoc networks
    Filiposka, Sonja V.
    Trajanov, Dimitar R.
    Grnarov, Aksenti L.
    [J]. 2009 1ST INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATION, VEHICULAR TECHNOLOGY, INFORMATION THEORY AND AEROSPACE & ELECTRONIC SYSTEMS TECHNOLOGY, VOLS 1 AND 2, 2009, : 352 - +