- About
- Events
- Calendar
- Graduation Information
- Cornell Learning Machines Seminar
- Student Colloquium
- BOOM
- Fall 2024 Colloquium
- Conway-Walker Lecture Series
- Salton 2024 Lecture Series
- Seminars / Lectures
- Big Red Hacks
- Cornell University - High School Programming Contests 2024
- Game Design Initiative
- CSMore: The Rising Sophomore Summer Program in Computer Science
- Explore CS Research
- ACSU Research Night
- Cornell Junior Theorists' Workshop 2024
- People
- Courses
- Research
- Undergraduate
- M Eng
- MS
- PhD
- Admissions
- Current Students
- Computer Science Graduate Office Hours
- Advising Guide for Research Students
- Business Card Policy
- Cornell Tech
- Curricular Practical Training
- A & B Exam Scheduling Guidelines
- Fellowship Opportunities
- Field of Computer Science Ph.D. Student Handbook
- Graduate TA Handbook
- Field A Exam Summary Form
- Graduate School Forms
- Instructor / TA Application
- Ph.D. Requirements
- Ph.D. Student Financial Support
- Special Committee Selection
- Travel Funding Opportunities
- Travel Reimbursement Guide
- The Outside Minor Requirement
- Diversity and Inclusion
- Graduation Information
- CS Graduate Minor
- Outreach Opportunities
- Parental Accommodation Policy
- Special Masters
- Student Spotlights
- Contact PhD Office
Tools for higher-order network analysis
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, I will discuss several higher-order analyses based on higher-order connectivity patterns that I have developed to gain new insights into network data. Specifically, I will introduce a motif-based clustering methodology, a formalism for temporal motifs to study temporal networks, and a new stochastic process for tensor data. I will also show applications of higher-order analysis in several domains including ecology, biology, transportation, and human communication.
Bio:
Austin Benson is a PhD 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 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 (four times), Sandia National Laboratories, and HP Labs.