Mathematical Sciences Research Institute

Home » Network Discovery in Large and/or Adversarial Real World Networks


Network Discovery in Large and/or Adversarial Real World Networks May 09, 2012 (11:00 AM PDT - 12:00 PM PDT)
Parent Program: --
Location: MSRI: Simons Auditorium
Speaker(s) Alex Waagen
Description No Description
No Video Uploaded

A fundamental problem in the study of real-world networks is how to discover topological properties of a network given limited time and resources. For networks which are not too large, a random walker with stationary transition probabilities is usually sufficient. Yet, these methods will not scale up to large graphs, and especially not to modular and directed graphs. I will discuss methods of network discovery in large networks and also in model networks that share features with adversarial networks such as crime or terrorist networks. I will also discuss the use of multiple walkers as a possible analytical tool for studying walks on directed networks.

No Notes/Supplements Uploaded No Video Files Uploaded