• DocumentCode
    2774349
  • Title

    The Evolution of Ego-Centric Triads: A Microscopic Approach toward Predicting Macroscopic Network Properties

  • Author

    Doroud, Mina ; Bhattacharyya, Prantik ; Wu, S. Felix ; Felmlee, Diane

  • Author_Institution
    Dept. of Comput. Sci., Univ. of California, Davis, CA, USA
  • fYear
    2011
  • fDate
    9-11 Oct. 2011
  • Firstpage
    172
  • Lastpage
    179
  • Abstract
    Scalability issues make it time-consuming to estimate even simple characteristics of large scale, online networks, and the constantly evolving qualities of these networks make it challenging to capture a representative picture of a particular network\´s properties. Here we focus on the evolution of all triads (ties between three nodes) in a graph, as a method of studying changeover time in large scale, online social networks. For three month snapshots, we examine, and predict, transitions among all sixteen triad types (i.e., triad census) in a sample of three years of Facebook wall-post interactions. We introduce a new sampling approach for examining triads in online graphs, based on ego-centric networks of random seeds. We examine tendencies in the data toward properties related to balance theory, including structural balance, cluster ability, ranked clusters, transitivity, hierarchical clusters, and the presence of "forbidden" triads. In a time series analysis, we successfully predict the evolution over time in the wall post network dataset, with relatively low levels of error. The findings demonstrate the utility of our ego-centric, two-step, random seed sampling approach for studying large scale networks and predicting macroscopic graph properties, as well as the advantages of examining transitions in the complete triad census for an online network.
  • Keywords
    graph theory; pattern clustering; social networking (online); time series; Facebook wall-post interactions; cluster ability; ego-centric triad evolution; forbidden triads; hierarchical clusters; macroscopic graph properties; macroscopic network properties prediction; microscopic approach; online graphs; online social networks; random seed sampling approach; ranked clusters; scalability issues; structural balance theory; time series analysis; transitivity; Facebook; Labeling; Measurement; Microscopy; Monitoring; Stability analysis; triads;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Privacy, Security, Risk and Trust (PASSAT) and 2011 IEEE Third Inernational Conference on Social Computing (SocialCom), 2011 IEEE Third International Conference on
  • Conference_Location
    Boston, MA
  • Print_ISBN
    978-1-4577-1931-8
  • Type

    conf

  • DOI
    10.1109/PASSAT/SocialCom.2011.101
  • Filename
    6113110