PUMA publications for /author/Hua-Wei%20Shen/info20http://puma.uni-kassel.de/author/Hua-Wei%20Shen/info20PUMA RSS feed for /author/Hua-Wei%20Shen/info202019-06-26T14:19:24+02:00Modeling the clustering in citation networkshttp://puma.uni-kassel.de/bibtex/2d668e639ed78f4c7ec53eeba64d8ae2a/stephandoerfelstephandoerfel2011-08-12T12:35:08+02:00clustering network info20 citation <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Fu-Xin Ren" itemprop="url" href="/author/Fu-Xin%20Ren"><span itemprop="name">F. Ren</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Xue-Qi Cheng" itemprop="url" href="/author/Xue-Qi%20Cheng"><span itemprop="name">X. Cheng</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Hua-Wei Shen" itemprop="url" href="/author/Hua-Wei%20Shen"><span itemprop="name">H. Shen</span></a></span>. </span>(<em><span>2011<meta content="2011" itemprop="datePublished"/></span></em>)<em>cite arxiv:1104.4209.</em>Fri Aug 12 12:35:08 CEST 2011cite arxiv:1104.4209Modeling the clustering in citation networks2011clustering network info20 citation It has been known for a long time that citation networks are always highly clustered, such as the existences of abundant triangles and high clustering coefficient. In a growth model, one typical way to produce clustering is using the trid formation mechanism. However, we find that this mechanism fails to generate enough triangles in a real-world citation network. By analyzing the network, it is found that one paper always cites papers that are already highly connected. We point out that the highly connected papers may refer to similar research topic and one subsequent paper tends to cite all of them. Based on this assumption, we propose a growth model for citation networks in which a new paper i firstly attaches to one relevant paper j and then with a probability links those papers in the same clique to which j belongs. We compare our model to two real-world citation networks - one on a special research area and the other on multidisciplinary sciences. Results show that for the two networks the in-degree distributions are matched and the clustering features, i.e., the number of triangles and the average clustering coefficient, are well reproduced. [1104.4209] Modeling the clustering in citation networks