*********************************
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
*********************************
Anna Stroup
Sr. Administrative Assistant
Summary Sentence: CSE Recruitment Lecture by Austin Bensons, Ph.D. Candidate at Stanford University
Full Summary: No summary paragraph submitted.
Austin BensonAbstract:
Networks are a fundamental model of complex systems in biology, neuroscience, engineering, and social science. Networks are typically described by lower-order connectivity patterns that are captured at the level of individual nodes and edges. However, higher-order connectivity patterns captured by small subgraphs, or network motifs, describe the fundamental structures that control and mediate the behavior of many complex systems.
In this talk, Bensons will discuss several higher-order analyses based on higher-order connectivity patterns that he developed to gain new insights into network data. Specifically, he will introduce a motif-based clustering methodology, a formalism for temporal motifs to study temporal networks, and a new stochastic process for tensor data. Also, Bensons will show applications of higher-order analysis in several domains, including ecology, biology, transportation, and human communication.
Bio:
Austin Benson is a Ph.D. candidate at Stanford University in the Institute for Computational and Mathematical Engineering, where he is advised by Professor Jure Leskovec of the Computer Science Department.
His research focuses on data-driven methods for understanding complex systems and behavior, which spans network science, matrix computations, and modeling human behavior on the Web. Before attending Stanford, he completed undergraduate degrees in Computer Science and Applied Mathematics at the University of California, Berkeley. Outside of the university, he has spent summers interning at Google, Sandia National Laboratories, and HP Labs.
