
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
A growing set of online applications are generating data that can be viewed as very large collections of small, dense social graphs — these range from sets of social groups, events, or collabora tion projects to the vast collection of graph neighborhoods in large social networks. A natural question is how to usefully define a domainindependent ‘coordinate system’ for such a collection of graphs, so that the set of possible structures can be compactly rep resented and understood within a common space. In this work, we draw on the theory of graph homomorphisms to formulate and an alyze such a representation, based on computing the frequencies of small induced subgraphs within each graph.
Be the first to like this
Login to see the comments