Accession Number:

AD1023352

Title:

Efficient Algorithmic Frameworks via Structural Graph Theory

Descriptive Note:

Technical Report,01 Aug 2012,30 Sep 2016

Corporate Author:

Massachusetts Institute of Technology Cambridge United States

Report Date:

2016-10-28

Pagination or Media Count:

21.0

Abstract:

In this project, we developed many new efficient algorithms for analysis of networks. We have published over 100 papers during the course of this project, and we launched a new website BigDND httpprojects.csail.mit.edudnd for distributing large network data and tools for analyzing them. Within network science, our research develops algorithms to enable efficient and guaranteed-quality analysis of abroad range of types of networks, from social networks to computer networks and transportation networks. Real-world social networks of interest include online services Facebook, Google , Twitter, coauthorshipcollaboration among people arXiv, DBLP, patents, phone calls AT and T, NSA, in-person interactions FBI, Pentagon, geographic hierarchical neighborhoods living or working together, on the same block, in the same district or city, and shared interests Netflix, Amazon, Match.com.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE