Student Seminar Series
DATE: Tuesday, February 27th, 2018, 2:00pm
LOCATION: MSB 1147 (Colloquium Room).
SPEAKERS: Kirill Paramonov, Graduate Student, Mathematics, UC Davis
TITLE: Lift Estimator of Graphlet Count Statistic
ABSTRACT: Extracting data from social networks becomes more and more important because of the wide applicability of such algorithms. For the large graphs (like Facebook), where the access to the whole graph is not feasible, the best option is to have an on-line learning procedure while travelling from vertex to vertex, and gather information about the local structure of the graph.
An important local statistic of a network is graphlet count- the number of occurrences of a small motif (e.g. a wedge or a triangle) in the big network. In this talk I propose a new Lifting algorithm to construct an estimate for the graphlet count statistic, which has an advantage of having low correlation between samples and being universal for all types of graphlets.
I also propose several modifications for the algorithm, each one applicable to a specific goal, making the estimator versatile for different problems.
This seminar series is organized by PhD Students Andrew Blandino, Dmitriy Izyumin, and Benjamin Roycraft.