Special CSE Seminar: By Blair D. Sullivan

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Thursday October 25, 2012
      12:05 pm - 1:05 pm
  • Location: Klaus 1116 E
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Enabling scalable real-world network analysis via structural graph theory

Full Summary: No summary paragraph submitted.

Special CSE Seminar

Speaker: Blair Sullivan, Oak Ridge National Laboratory (ORNL)

Title:Enabling scalable real-world network analysis via structural graph theory

 Abstract:

 Network science is a rapidly growing interdisciplinary field with methods and applications drawn from across the natural, social, and information sciences. Perhaps surprisingly, very few approaches use techniques from the rich literature of structural graph theory. In this talk, we discuss some first steps towards integrating what have been predominantly theoretical results into tools for scalable network analysis.

Tree-like structures arise extensively in network science - for example, hierarchical structures in biology, hyperbolic routing in the internet, and core-periphery behavior in social networks. As such, this talk explores ways to use tree decompositions (key combinatorial objects from graph minor theory) in tandem with k-cores and Gromov hyperbolicity to provide structural characterization of and improve inference on complex networks. We also discuss new algorithms using tree decompositions to enable scalable solution of certain graph optimization problems in a high performance computing environment. 

Bio:

Blair D. Sullivan is a Research Staff Member in the Complex Systems Group at Oak Ridge National Laboratory (ORNL). Her current research interests include graph algorithms, parallel computing, applied structural graph theory, and graph embeddings for quantum computing.

Before joining ORNL, Blair was a visiting researcher at the Renyi Institute in Budapest, Hungary. She received her Ph.D. in Mathematics at Princeton University as a Department of Homeland Security Graduate Fellow, and bachelor's degrees in Applied Mathematics and Computer Science at Georgia Tech. Blair has been the Principal Investigator on grants from the DOE's Office of Advanced Scientific Computing Research, ORNL's LDRD program, and leads a team researching social network analysis for the DARPA GRAPHS program. She serves on the

Graph500 Steering Committee and the organizing committee for the SIAM Workshop on Combinatorial Scientific Computing (CSC13).

 

 

 

 

 

 

 

Additional Information

In Campus Calendar
Yes
Groups

College of Computing, School of Computer Science, School of Interactive Computing, School of Computational Science and Engineering

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Lometa Mitchell
  • Workflow Status: Published
  • Created On: Oct 22, 2012 - 3:55am
  • Last Updated: Oct 7, 2016 - 10:00pm