{
 "uuid": "76ce6f70-be2a-463b-87bf-0b41db2f5933",
 "handle": "uniba/114808",
 "type": "Publication",
 "name": "The PageRank Vector of a Scale-Free Web Network Growing by Preferential Attachment",
 "url": "/entities/publication/76ce6f70-be2a-463b-87bf-0b41db2f5933/",
 "lastModified": "2026-04-23T13:08:57.976+00:00",
 "metadata": {
  "cris.virtual.mainversiondoi": [
   {
    "value": "10.1007/978-3-030-92507-9_3"
   }
  ],
  "cris.virtualsource.mainversiondoi": [
   {
    "value": "7fdf6fb4-0215-40fb-9370-577ac2833fd9"
   }
  ],
  "dc.contributor.author": [
   {
    "value": "Markovich, Natalia M.",
    "authority": "aa8ec244-47d0-4e18-bea9-118b9b0e5ab4"
   },
   {
    "value": "Krieger, Udo R.",
    "authority": "165e5b16-8ec6-41a1-a36d-e7ac551f0e68"
   }
  ],
  "dc.date.accessioned": [
   {
    "value": "2026-04-23T13:08:57Z"
   }
  ],
  "dc.date.available": [
   {
    "value": "2026-04-23T13:08:57Z"
   }
  ],
  "dc.date.issued": [
   {
    "value": "2026"
   }
  ],
  "dc.description.abstract": [
   {
    "value": "We consider a scale-free model of the Web network that is evolving by preferential attachment schemes and derive an explicit formula of its PageRank vector. Its element indicates the probability that a surfer resides at a related Web page i in a stationary regime of an associated random walk. Considering the growth of a directed Web graph, we apply linear preferential attachment schemes proposed by Samorodnitsky et al. (2016). To express the probability of a connection between two nodes of this Web graph, our derivation allows us to avoid the consideration of complicated paths with random lengths and to cover both self-loops and multiple edges between nodes. An algorithm of the PageRank vector calculation for graphs without loops is provided. The approach can be extended in a similar way to graphs with loops. In this way, our approach enhances existing analysis schemes. It provides a better insight on the PageRank of growing scale-free Web networks and supports the adaptation of the model to gathered network statistics."
   }
  ],
  "dc.identifier.uri": [
   {
    "value": "https://fis.uni-bamberg.de/handle/uniba/114808"
   }
  ],
  "dc.identifier.urn": [
   {
    "value": "urn:nbn:de:bvb:473-irb-114808x"
   }
  ],
  "dc.language.iso": [
   {
    "value": "eng",
    "language": "de_DE"
   }
  ],
  "dc.publisher": [
   {
    "value": "Otto-Friedrich-Universität"
   }
  ],
  "dc.publisher.place": [
   {
    "value": "Bamberg"
   }
  ],
  "dc.relation.authororgunit": [
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#"
   },
   {
    "value": "Professur für Informatik, insbesondere Kommunikationsdienste, Telekommunikationssysteme und Rechnernetze",
    "authority": "a4dc35b5-ec41-485b-aafd-4ae073115f47"
   }
  ],
  "dc.relation.ispartofotherseries": [
   {
    "value": "Lecture Notes in Computer Science",
    "language": "de_DE"
   }
  ],
  "dc.subject": [
   {
    "value": "PageRank vector"
   },
   {
    "value": "Scale-free network"
   },
   {
    "value": "Linear preferential attachment"
   }
  ],
  "dc.title": [
   {
    "value": "The PageRank Vector of a Scale-Free Web Network Growing by Preferential Attachment",
    "language": "de_DE"
   }
  ],
  "dc.type": [
   {
    "value": "conferenceobject",
    "language": "de_DE"
   }
  ],
  "dspace.entity.type": [
   {
    "value": "Publication"
   }
  ],
  "ubg.accessRights.copyright": [
   {
    "value": "true"
   }
  ],
  "ubg.accessRights.licence": [
   {
    "value": "copyright_deu"
   }
  ],
  "ubg.date.published": [
   {
    "value": "2021"
   }
  ],
  "ubg.fulltexticon": [
   {
    "value": "true"
   }
  ],
  "ubg.generated.csl": [
   {
    "value": "<div class=\"csl-bib-body\">\n  <div class=\"csl-entry\">Markovich, Natalia M.; Krieger, Udo R. (2026): The PageRank Vector of a Scale-Free Web Network Growing by Preferential Attachment, in: Bamberg: Otto-Friedrich-Universität, S. 24–31.</div>\n</div>"
   }
  ],
  "ubg.intern.org": [
   {
    "value": "Professur für Informatik, insbesondere Kommunikationsdienste, Telekommunikationssysteme und Rechnernetze",
    "authority": "a4dc35b5-ec41-485b-aafd-4ae073115f47"
   }
  ],
  "ubg.intern.source": [
   {
    "value": "Vladimir M. Vishnevskiy, Konstantin E. Samouylow, und Dmitry V. Kozyrev (Hrsg.), Distributed Computer and Communication Networks: Control, Computation, Communications : 24th International Conference, DCCN 2021, Moscow, Russia, September 20–24, 2021, Revised Selected Papers, Cham: Springer, 2021, S. 24–31, ISBN: 978-3-030-92506-2"
   }
  ],
  "ubg.intern.vonfeld": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.intern.vonfeldeditor": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.internatorientation": [
   {
    "value": "Ja",
    "language": "de_DE"
   }
  ],
  "ubg.pages.range": [
   {
    "value": "24-31"
   }
  ],
  "ubg.submission.type": [
   {
    "value": "full-text",
    "language": "de_DE"
   }
  ],
  "ubg.thesis.grantor": [
   {
    "value": "Uni"
   }
  ],
  "ubg.version.type": [
   {
    "value": "acceptedVersion"
   }
  ],
  "ubg.version.versionof": [
   {
    "value": "uniba/52563",
    "authority": "7fdf6fb4-0215-40fb-9370-577ac2833fd9"
   }
  ]
 },
 "relations": {},
 "files": [
  {
   "uuid": "bc0df922-cd4d-4076-8ef9-32cdb6c0c72b",
   "bundle": "ORIGINAL",
   "name": "fisba114808.pdf",
   "size": 1202922,
   "md5": "1cecf2fbeef8005d35eacdda76d71bcf",
   "mimetype": "application/pdf",
   "url": "/files/bc0df922-cd4d-4076-8ef9-32cdb6c0c72b/fisba114808.pdf",
   "description": null
  }
 ]
}