<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"
>
<channel rdf:about="http://www.citeulike.org/about">

	<title>CiteULike: mshafiei's Hajra</title>
	<description>CiteULike: mshafiei's Hajra</description>


	<link>http://www.citeulike.org/user/mshafiei/author/Hajra</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/2582927"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/1093801"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/mshafiei/article/2582927">
    <title>Modelling aging characteristics in citation networks</title>
    <link>http://www.citeulike.org/user/mshafiei/article/2582927</link>
    <description>&lt;i&gt;Physica A: Statistical Mechanics and its Applications, Vol. 368, No. 2. (15 August 2006), pp. 575-582.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Growing network models with preferential attachment dependent on both age and degree are proposed to simulate certain features of citation network noted in [Redner, arXiv: physics/0407137 (2004)]. In this directed network, a new node gets attached to an older node with the probability ~K(k)f(t) where the degree and age of the older node are k and t, respectively. Several functional forms of K(k) and f(t) have been considered. The desirable features of the citation network can be reproduced with K(k)~k-[beta] and f(t)~exp([alpha]t) with [beta]=2.0 and [alpha]=-0.2 and with simple modifications in the growth scheme.</description>
    <dc:title>Modelling aging characteristics in citation networks</dc:title>

    <dc:creator>Kamalika Hajra</dc:creator>
    <dc:creator>Parongama Sen</dc:creator>
    <dc:identifier>doi:10.1016/j.physa.2005.12.044</dc:identifier>
    <dc:source>Physica A: Statistical Mechanics and its Applications, Vol. 368, No. 2. (15 August 2006), pp. 575-582.</dc:source>
    <dc:date>2008-03-24T22:33:12-00:00</dc:date>
    <prism:publicationName>Physica A: Statistical Mechanics and its Applications</prism:publicationName>
    <prism:volume>368</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>575</prism:startingPage>
    <prism:endingPage>582</prism:endingPage>
    <prism:category>citation-graph</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/1093801">
    <title>Aging in citation networks</title>
    <link>http://www.citeulike.org/user/mshafiei/article/1093801</link>
    <description>&lt;i&gt;Physica A: Statistical Mechanics and its Applications, Vol. 346, No. 1-2. (1 February 2005), pp. 44-48.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;In many growing networks, the age of the nodes plays an important role in deciding the attachment probability of the incoming nodes. For example, in a citation network, very old papers are seldom cited while recent papers are usually cited with high frequency. We study actual citation networks to find out the distribution T(t) of t, the time interval between the published and the cited paper. For different sets of data we find a universal behaviour: T(t)~t-0.9 for t[less-than-or-equals, slant]tc and T(t)~t-2 for t&#62;tc where tc~O(10).</description>
    <dc:title>Aging in citation networks</dc:title>

    <dc:creator>Kamalika Hajra</dc:creator>
    <dc:creator>Parongama Sen</dc:creator>
    <dc:identifier>doi:10.1016/j.physa.2004.08.048</dc:identifier>
    <dc:source>Physica A: Statistical Mechanics and its Applications, Vol. 346, No. 1-2. (1 February 2005), pp. 44-48.</dc:source>
    <dc:date>2007-02-07T22:04:31-00:00</dc:date>
    <prism:publicationName>Physica A: Statistical Mechanics and its Applications</prism:publicationName>
    <prism:volume>346</prism:volume>
    <prism:number>1-2</prism:number>
    <prism:startingPage>44</prism:startingPage>
    <prism:endingPage>48</prism:endingPage>
    <prism:category>citation-graph</prism:category>
</item>



</rdf:RDF>

