<?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">
<pubDate>Sun, 27 Jul 2008 06:00:09 BST</pubDate>


	<title>CiteULike: Tag citation-graph</title>
	<description>CiteULike: Tag citation-graph</description>


	<link>http://www.citeulike.org/tag/citation-graph</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:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/698679"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mshafiei/article/280979"/>

	</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:publicationYear>2006</prism:publicationYear>
    <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:publicationYear>2005</prism:publicationYear>
    <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>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/698679">
    <title>Mixed-membership models of scientific publications.</title>
    <link>http://www.citeulike.org/user/mshafiei/article/698679</link>
    <description>&lt;i&gt;Proc Natl Acad Sci U S A, Vol. 101 Suppl 1 (6 April 2004), pp. 5220-5227.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;PNAS is one of world's most cited multidisciplinary scientific journals. The PNAS official classification structure of subjects is reflected in topic labels submitted by the authors of articles, largely related to traditionally established disciplines. These include broad field classifications into physical sciences, biological sciences, social sciences, and further subtopic classifications within the fields. Focusing on biological sciences, we explore an internal soft-classification structure of articles based only on semantic decompositions of abstracts and bibliographies and compare it with the formal discipline classifications. Our model assumes that there is a fixed number of internal categories, each characterized by multinomial distributions over words (in abstracts) and references (in bibliographies). Soft classification for each article is based on proportions of the article's content coming from each category. We discuss the appropriateness of the model for the PNAS database as well as other features of the data relevant to soft classification.</description>
    <dc:title>Mixed-membership models of scientific publications.</dc:title>

    <dc:creator>E Erosheva</dc:creator>
    <dc:creator>S Fienberg</dc:creator>
    <dc:creator>J Lafferty</dc:creator>
    <dc:identifier>doi:10.1073/pnas.0307760101</dc:identifier>
    <dc:source>Proc Natl Acad Sci U S A, Vol. 101 Suppl 1 (6 April 2004), pp. 5220-5227.</dc:source>
    <dc:date>2006-06-16T19:49:08-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Proc Natl Acad Sci U S A</prism:publicationName>
    <prism:issn>0027-8424</prism:issn>
    <prism:volume>101 Suppl 1</prism:volume>
    <prism:startingPage>5220</prism:startingPage>
    <prism:endingPage>5227</prism:endingPage>
    <prism:category>citation-graph</prism:category>
    <prism:category>relational</prism:category>
    <prism:category>topic-modeling</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mshafiei/article/280979">
    <title>The use of the generalized Waring process in modelling informetric data</title>
    <link>http://www.citeulike.org/user/mshafiei/article/280979</link>
    <description>&lt;i&gt;Scientometrics, Vol. 64, No. 3. (August 2005), pp. 247-270.&lt;/i&gt;</description>
    <dc:title>The use of the generalized Waring process in modelling informetric data</dc:title>

    <dc:creator>Quentin Burrell</dc:creator>
    <dc:identifier>doi:10.1007/s11192-005-0250-y</dc:identifier>
    <dc:source>Scientometrics, Vol. 64, No. 3. (August 2005), pp. 247-270.</dc:source>
    <dc:date>2005-08-13T12:51:00-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>Scientometrics</prism:publicationName>
    <prism:issn>0138-9130</prism:issn>
    <prism:volume>64</prism:volume>
    <prism:number>3</prism:number>
    <prism:startingPage>247</prism:startingPage>
    <prism:endingPage>270</prism:endingPage>
    <prism:publisher>Kluwer Academic Publishers</prism:publisher>
    <prism:category>citation-graph</prism:category>
    <prism:category>citaton</prism:category>
</item>



</rdf:RDF>

