Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The evolution of ego-centric triads: A microscopic approach toward predicting macroscopic network properties
Responsible organisation
2011 (English)Conference paper, (Refereed) Published
Abstract [en]

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 networks properties. Here we focus on the evolution of all triads (ties between three nodes) in a graph, as a method of studying change over 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, clusterability, 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.

Place, publisher, year, edition, pages
Boston: IEEE , 2011.
Keyword [en]
Data sets, Facebook, Graph properties, Hierarchical clusters, Large-scale network, Low level, Network properties, On-line network, Online social networks, Random seeds, Scalability issue, Structural balance
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-7289DOI: 10.1109/PASSAT/SocialCom.2011.101Local ID: oai:bth.se:forskinfoFE5E46915AF18104C12579FB004BC9C1ISBN: 978-076954578-3 (print)OAI: oai:DiVA.org:bth-7289DiVA: diva2:834884
Conference
IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom
Available from: 2012-09-18 Created: 2012-05-11 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Wu, Felix
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 15 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf