On the localization of the personalized PageRank of complex networks (Q2435365): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Miguel Romance / rank
Normal rank
 
Property / author
 
Property / author: Miguel Romance / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2137918542 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.4855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick Detection of Top-k Personalized PageRank Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing a leader on a complex network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitivity groups on social network sites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leadership groups on social network sites based on personalized PageRank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk with restart: fast solutions and applications / rank
 
Normal rank

Latest revision as of 08:32, 7 July 2024

scientific article
Language Label Description Also known as
English
On the localization of the personalized PageRank of complex networks
scientific article

    Statements

    On the localization of the personalized PageRank of complex networks (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2014
    0 references
    In this paper, the authors locate analytically all the possible values of the personalized PageRank for each node of a directed network that might contain dangling nodes. The result is then applied to derive some necessary and sufficient conditions for the competitivity between nodes as well as leadership. Some small-scaled examples are also presented to illustrate the proposed results.
    0 references
    0 references
    Google matrix
    0 references
    PageRank
    0 references
    link analysis
    0 references

    Identifiers