Title: Counting Triangles in Streaming Graphs
Speaker: Mark Tiefenbruck
Speaker Info: IDA, Center for Communications Research
Suppose you have a very large graph, so large that you can't store it in one place, but you would like to know certain properties of the graph. For example, you might want to estimate the number of triangles (3-cycles) in the graph. There are a variety of known algorithms for this problem, and we will discuss several of them. Then we will focus on one particular algorithm and present some new improvements.Date: Thursday, October 28, 2021
This presentation will also include discussion of what it's like to be a mathematician doing research at a company (IDA) as well as current job opportunities there and with the government.