This event will be held virtually.
Speaker: Seyed Vahid Sanei Sanei Mehri, ECpE Graduate Student
Advisors: Srikanta Tirthapura and Goce Trajcevski
Title: Butterfly Counting in Streaming Bipartite Networks
Abstract: In this seminar, I aim to present our work for butterfly counting in streaming bipartite networks. In this work, we consider space-efficient single-pass estimation of the number of butterflies, a fundamental bipartite graph motif, from a massive bipartite graph stream where each edge represents a connection between entities in two different partitions. Estimates returned by the algorithms come with provable guarantees on the approximation error, and experiments show good tradeoffs between the space used and the accuracy of the approximation. While there is a significant body of work on counting subgraphs such as triangles in a unipartite graph stream, our work seems to be one of the few to tackle the case of bipartite graph streams.
Bio: I am a research assistant at Iowa State University, pursuing a Ph.D. degree in Electrical and Computer Engineering. My research work is centered on the discovery of motifs of large-scale networks in parallel and streaming settings. More specifically, I am conducting research on mining/counting dense subgraphs and motifs such as cliques, quasi-cliques, k-trusses, triangles, and butterflies in large networks.
Webex Link: https://iastate.webex.com/iastate/j.php?MTID=mdb761c306fce6957fe7431bb9fbccdb0
Event Recording: https://iastate.webex.com/iastate/ldr.php?RCID=9e410a4ec14f468fa2371fbc9ab17b7e