The Triangle Motif in Networks: On Normal Graphs and Beyond

PhD Qualifying Examination


Title: "The Triangle Motif in Networks: On Normal Graphs and Beyond"

by

Mr. Alexander Tiannan ZHOU


Abstract:

Graphs are a powerful and popular tool to model entities and the 
relationships they share. On these graphs, triangles (three nodes all 
fully connected to each other) are arguably the most important motif 
structure of all due to their simplicity and wide range of use cases such 
as community detection, spam identification, network health analysis and 
more. In that past, triangle counting and enumeration problems on normal 
graphs have received a lot of research with a multitude of both exact and 
approximation algorithms having been proposed. However, in the modern day, 
different types of graphs with more complex structures have grown in 
popularity in order to capture additional real-world information or to 
enforce limitations in memory or processing power. In this survey, we 
examine the triangle counting and enumeration problem on not only normal 
graphs but also graph streams, temporal networks, uncertain graphs and 
even triangle substitutes in the bipartite setting. In addition, this work 
also mentions potential future directions of research as well as a summary 
of PhD progress and an outline for the future.


Date:			Thursday, 17 June 2021

Time:                  	10:00am - 12:00noon

Zoom meeting:
https://hkust.zoom.us/j/91325827083?pwd=bzNrRk91eUIrRWM2VVJpdk9aQnQxdz09

Committee Members:	Prof. Lei Chen (Supervisor)
 			Dr. Qiong Luo (Chairperson)
 			Dr. Yangqiu Song
 			Prof. Ke Yi


**** ALL are Welcome ****