Advanced search
1 file | 823.85 KB

Regular Equivalence for Social Networks

Pieter Audenaert (UGent) , Didier Colle (UGent) and Mario Pickavet (UGent)
Author
Organization
Abstract
Networks and graphs are highly relevant in modeling real-life communities and their interactions. In order to gain insight in their structure, different roles are attributed to vertices, effectively clustering them in equivalence classes. A new formal definition of regular equivalence is presented in this paper, and the relation with other equivalence types is investigated and mathematically proven. An efficient algorithm is designed, able to detect all regularly equivalent roles in large-scale complex networks. We apply it to both Barabasi-Albert random networks, as well as real-life social networks, which leads to interesting insights.
Keywords
social networks, complex network analysis, regular equivalence, algorithms

Downloads

  • 7359.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 823.85 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Audenaert, Pieter, Didier Colle, and Mario Pickavet. 2019. “Regular Equivalence for Social Networks.” Applied Sciences-basel 9 (1).
APA
Audenaert, P., Colle, D., & Pickavet, M. (2019). Regular Equivalence for Social Networks. APPLIED SCIENCES-BASEL, 9(1).
Vancouver
1.
Audenaert P, Colle D, Pickavet M. Regular Equivalence for Social Networks. APPLIED SCIENCES-BASEL. Basel: Mdpi; 2019;9(1).
MLA
Audenaert, Pieter, Didier Colle, and Mario Pickavet. “Regular Equivalence for Social Networks.” APPLIED SCIENCES-BASEL 9.1 (2019): n. pag. Print.
@article{8599613,
  abstract     = {Networks and graphs are highly relevant in modeling real-life communities and their interactions. In order to gain insight in their structure, different roles are attributed to vertices, effectively clustering them in equivalence classes. A new formal definition of regular equivalence is presented in this paper, and the relation with other equivalence types is investigated and mathematically proven. An efficient algorithm is designed, able to detect all regularly equivalent roles in large-scale complex networks. We apply it to both Barabasi-Albert random networks, as well as real-life social networks, which leads to interesting insights.},
  articleno    = {117},
  author       = {Audenaert, Pieter and Colle, Didier and Pickavet, Mario},
  issn         = {2076-3417},
  journal      = {APPLIED SCIENCES-BASEL},
  language     = {eng},
  number       = {1},
  pages        = {17},
  publisher    = {Mdpi},
  title        = {Regular Equivalence for Social Networks},
  url          = {http://dx.doi.org/10.3390/app9010117},
  volume       = {9},
  year         = {2019},
}

Altmetric
View in Altmetric
Web of Science
Times cited: