Motifs in Communication Networks

Yuval Shavitt -- Motifs in Communication Networks

Motifs will prove to be an important tool in studying communication networks. However, most of my work in this area is for general networks.

A paper using the bi-fan motif in the process of generating Internet PoP-level maps:

Dima Feldman, Yuval Shavitt, and Noa Zilberman.
"A Structural Approach for PoP Geo-Location"
Computer Networks, 56(3):1029-1040, 23^rd February 2012. (pdf)

Dima Feldman and Yuval Shavitt.
Automatic Large Scale Generation of Internet PoP Level Maps.
IEEE GLOBECOM'08, November/December 2008, New Orleans, LA, USA. (pdf)
Mira Gonen and Yuval Shavitt.
Approximating the Number of Network Motifs.
Internet Mathematics, 6(3):349 - 372, 2009. (pdf)

Mira Gonen and Yuval Shavitt
Approximating the Number of Network Motifs.
WAW 2009, February 2009, Barcelona, Spain. (pdf)
Mira Gonen, Dana Ron, and Yuval Shavitt.
Counting Stars and Other Small Subgraphs in Sublinear Time.
SIAM J. on Discrete Math (SIDMA), 25(3):1365-1411, 2011. (pdf).

An early version appeared in ACM-SIAM Symposium on Discrete Algorithms (SODA'10), January 2010, Austin, TX, USA. (pdf)
Dror Marcus and Yuval Shavitt.
"RAGE - A Rapid Graphlet Enumerator for Large Networks."
Computer Networks, 56(2):810-819, 2^nd February 2012. (pdf)

Dror Marcus and Yuval Shavitt.
Efficient Counting of Network Motifs.
The 2nd Annual Workshop on Simplifying Complex Networks for Practitioners (SIMPLEX 2010), Genoa, Italy, June 2010. (pdf)

The RAGE (software) is available for download.