In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...
Ioannis Konstas, Vassilios Stathopoulos, Joemon M....
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...