<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Wang, Li-Na</dc:creator>
  <dc:creator>Guo, Jin-Li</dc:creator>
  <dc:creator>Yang, Han-Xin</dc:creator>
  <dc:creator>Zhou, Tao</dc:creator>
  <dc:date>2008-12-24</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">A railway transportation system can be represented by a bipartite network consisting of trains and stations, where a train is connected to all stations where it stops. In this paper, motivated by the resource-allocation process taking place on networks, we design a method to project a Chinese train-station bipartite network into a weighted station network. A new metric is proposed to quantify the dependence between pairs of stations, which is shown to follow a shifted power-law distribution. In addition, we compare the resource-allocation method and the well-known multiple-edge method, and the results indicate that our proposed method is more reasonable.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://folia.unifr.ch/global/documents/301327</dc:identifier>
  <dc:identifier>https://folia.unifr.ch/documents/301327/files/zhou_lpa.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1016/j.physa.2008.12.028</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:source>Physica A: Statistical Mechanics and its Applications. - 2009, vol. 388, no. 8, p. 1713-1720</dc:source>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Bipartite networks</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Resource-allocation method</dc:subject>
  <dc:subject xmlns:ns3="xml" ns3:lang="en">Multiple-edge method</dc:subject>
  <dc:subject xmlns:ns4="xml" ns4:lang="en">Chinese railway network</dc:subject>
  <dc:subject xmlns:ns5="xml" ns5:lang="en">Dependence</dc:subject>
  <dc:subject>info:eu-repo/classification/udc/53</dc:subject>
  <dc:title xmlns:ns6="xml" ns6:lang="en">Local preferential attachment model for hierarchical networks</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_6501</dc:type>
</oai_dc:dc>
