Clustering of tag-induced subgraphs in complex networks

Pter Pollner, Gergely Palla, Tams Vicsek

Research output: Contribution to journalArticle

1 Citation (Scopus)


We study the behavior of the clustering coefficient in tagged networks. The rich variety of tags associated with the nodes in the networks we considered provide additional relevant information about the entities represented by the nodes. Such specific features can be important for practical applications like searching in the networks. Here we examine how the clustering coefficient changes when narrowing the network to a subgraph associated with a given tag, and how it correlates with various other properties of the subgraph. A further question addressed in our paper is how the clustering coefficient of the individual nodes is affected by the tags on the node. We argue that this kind of analysis can be useful when one is aimed at a detailed description of the structure of large complex systems.

Original languageEnglish
Pages (from-to)5887-5894
Number of pages8
JournalPhysica A: Statistical Mechanics and its Applications
Issue number24
Publication statusPublished - Dec 15 2010



  • Clustering
  • Networks
  • Tags

ASJC Scopus subject areas

  • Statistics and Probability
  • Condensed Matter Physics

Cite this