Competitivity groups on social network sites

DOI10.1016/j.mcm.2010.02.031zbMath1205.91146OpenAlexW2092118027WikidataQ125826371 ScholiaQ125826371MaRDI QIDQ622978

Francisco Pedroche Sánchez

Publication date: 13 February 2011

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2010.02.031

zbMATH Keywords

communication networkpageranklink analysisgoogle matrixranking algorithmsocial networking

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Internet topics (68M11)

Related Items (8)

A new extrapolation method for PageRank computations ⋮ Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank ⋮ On the localization of the personalized PageRank of complex networks ⋮ Non-backtracking PageRank: from the classic model to Hashimoto matrices ⋮ On graphs associated to sets of rankings ⋮ A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues ⋮ A MODEL TO CLASSIFY USERS OF SOCIAL NETWORKS BASED ON PAGERANK ⋮ The coupled iteration algorithms for computing PageRank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choosing a leader on a complex network
• How the science of complex networks can help developing strategies against terrorism
• Statistical mechanics of complex networks
• Authoritative sources in a hyperlinked environment
• Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation

This page was built for publication: Competitivity groups on social network sites