Social network probability mechanics

  • Authors:
  • Ian A. Mcculloh;Joshua Lospinoso;Kathleen Carley

  • Affiliations:
  • Department of Mathematical Sciences, United States Military Academy, NY;Department of Mathematical Sciences, United States Military Academy, NY;Institute for Software Research, Carnegie Mellon University, Pittsburgh, PA

  • Venue:
  • MATH'07 Proceedings of the 12th WSEAS International Conference on Applied Mathematics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new model for a random graph is proposed that can be constructed from empirical data and has some desirable properties compared to scale-free graphs [1, 2, 3] for certain applications. The newly proposed random graph maintains the same "small-world" properties [3, 4, 5] of the scale-free graph, while allowing mathematical modeling of the relationships that make up the random graph. E-mail communication data was collected on a group of 24 mid-career Army officers in a one-year graduate program [6] to validate necessary assumptions for this new class of random graphs. Statistical distributions on graph level measures are then approximated using Monte Carlo simulation and used to detect change in a graph over time.