Results 141 to 150 of about 10,068 (229)

Large-scale Network Analysis on Distributed Architectures [PDF]

Questa dissertazione esamina le sfide e i limiti che gli algoritmi di analisi di grafi incontrano in architetture distribuite costituite da personal computer. In particolare, analizza il comportamento dell'algoritmo del PageRank così come implementato in
Paolino, Carmine
core  

Sensitivity of quantum PageRank

CoRR, 2019
In this paper, we discuss the sensitivity of quantum PageRank. By using the finite dimensional perturbation theory, we estimate the change of the quantum PageRank under a small analytical perturbation on the Google matrix. In addition, we will show the way to estimate the lower bound of the convergence radius as well as the error bound of the finite ...
openaire   +2 more sources

Beyond Google2019;s PageRank: Complex Number-based Calculations for Node Ranking

, 2019
This study is focused on a proposed alternative algorithm for Google's PageRank, named Hermitian centrality score, which employs complex numbers for scoring a node of the network to overcome the issues of PageRank2019;s link analysis. This study presents
Keita Sugihara
core  

Research of Subgraph Estimation Page Rank Algorithm for Web Page Rank

Journal of Harbin University of Science and Technology, 2017
The traditional PageRank algorithm can not efficiently perform large data Webpage scheduling problem. This paper proposes an accelerated algorithm named topK-Rank，which is based on PageRank on the MapReduce platform.
LI Lan-yin, ZHOU Qiu-Li, KONG Yin , DONG Yi-ming   +3 more
doaj   +1 more source

Thematic PageRank: A Hybrid Approach for Evaluating Node Importance and Discipline Similarity in Interdisciplinary Networks

Applied Sciences
As scientific research becomes increasingly interdisciplinary, it is essential to quantify both the structural importance of disciplines and the topical proximity among them in cross-disciplinary networks.
Jing Xiong, Jihaoyu Yang
doaj   +1 more source

The Sinkhorn-Knopp algorithm : convergence and applications [PDF]

, 2008
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic.
Knight, P.A.
core  

Random walks on networks: Google’s PageRank algorithm

reservedLe catene di Markov sono processi aleatori in cui la probabilità condizionata di passare da uno stato all'altro non dipende dalla sequenza degli stati percorsi.
CAVEDON, NICOLE
core  

Which Bank is the "Central" Bank? An Application of Markov Theory to the Canadian Large Value Transfer System [PDF]

We use a method similar to Google's PageRank procedure to rank banks in the Canadian Large Value Transfer System (LVTS). Along the way we obtain estimates of the payment processing speeds for the individual banks.
Rod Garratt, James T. E. Chapman, Morten Bech   +2 more
core  

Patient-Transition Networks, Multiservice Trajectories, and Specialty Activity in a University Dental Clinic: A Retrospective Ecological Study. [PDF]

Healthcare (Basel)
Gómez-Costa D, Lastra-Prados P, Olmos Valverde M, Camarero Aizpurua L.   +3 more
europepmc   +1 more source

KSGR: An Influential Node Identification Algorithm for Directed Networks Integrating Reverse Reachability and Structural Enhancement Mechanisms. [PDF]

Entropy (Basel)
Zhao ZY, Hu BL.
europepmc   +1 more source