Google matrix analysis of directed networks

L Ermann, KM Frahm, DL Shepelyansky - Reviews of modern physics, 2015 - APS
In the past decade modern societies have developed enormous communication and social
networks. Their classification and information retrieval processing has become a formidable …

[PDF][PDF] Graph theory and complex networks

M Van Steen - An introduction, 2010 - pages.di.unipi.it
When I was appointed Director of Education for the Computer Science department at VU
University, I became partly responsible for revitalizing our CS curriculum. At that point in …

Analyzing and predicting viral tweets

M Jenders, G Kasneci, F Naumann - Proceedings of the 22nd …, 2013 - dl.acm.org
Twitter and other microblogging services have become indispensable sources of information
in today's web. Understanding the main factors that make certain pieces of information …

Distribution of centrality measures on undirected random networks via the cavity method

S Bartolucci, F Caccioli, F Caravelli, P Vivo - Proceedings of the National …, 2024 - pnas.org
The Katz centrality of a node in a complex network is a measure of the node's importance as
far as the flow of information across the network is concerned. For ensembles of locally tree …

Dans l'esprit du PageRank: une enquête sur l'algorithme de Google

D Cardon - Réseaux, 2013 - cairn.info
L'algorithme du moteur de recherche de Google, le PageRank, est une machine morale. Il
enferme un système de valeurs, donnant la prééminence à ceux qui ont été jugé méritants …

Two-dimensional ranking of Wikipedia articles

AO Zhirov, OV Zhirov, DL Shepelyansky - The European Physical Journal …, 2010 - Springer
The Library of Babel, described by Jorge Luis Borges, stores an enormous amount of
information. The Library exists ab aeterno. Wikipedia, a free online encyclopaedia, becomes …

Testing the nullspace property using semidefinite programming

A d'Aspremont, L El Ghaoui - Mathematical programming, 2011 - Springer
Recent results in compressed sensing show that, under certain conditions, the sparsest
solution to an underdetermined set of linear equations can be recovered by solving a linear …

PageRank in scale-free random graphs

N Chen, N Litvak, M Olvera-Cravioto - Algorithms and Models for the Web …, 2014 - Springer
We analyze the distribution of PageRank on a directed configuration model and show that
as the size of the graph grows to infinity, the PageRank of a randomly chosen node can be …