Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por palabra clave "PageRank"

Mostrando ítems 1-18 de 18

A biplex approach to PageRank centrality: from classic to multiplex networks

Pedroche Sánchez, Francisco; Romance, Miguel; Criado Herrero, Regino (American Institute of Physics, 2016-06-02)

In this paper, we present a new view of the PageRank algorithm inspired by multiplex networks. This new approach allows to introduce a new centrality measure for classic complex networks and a new proposal to extend the ...
A flow equation for dynamic graph control: applications to social network analysis

Falciani, H.; Sánchez Pérez, Enrique Alfonso (L.N. Gumilyov Eurasian National University, 2023)

[EN] Consider a model of information propagation through a network based on time -dependent directed graphs. Let us consider a pulse that starts at any node , an index-a real function acting on the nodes of the network-that ...
A model to classify users of social networks based on PageRank

Pedroche Sánchez, Francisco (World Scientific Publishing, 2012-07)

In this paper, we present a model to classify users of Social Networks. In particular, we focus on Social Network Sites. The model is based on the PageRank algorithm. We use the personalization vector to bias the PageRank ...
Acceleration of PageRank with customized precision based on mantissa segmentation

Gruetzmacher, Thomas; Cojean, Terry; Flegar, Goran; Anzt, Hartwig; Quintana-Orti, Enrique S. (Association for Computing Machinery, 2020-03)

[EN] We describe the application of a communication-reduction technique for the PageRank algorithm that dynamically adapts the precision of the data access to the numerical requirements of the algorithm as the iteration ...
Combining the Two-Layers PageRank Approach with the APA Centrality in Networks with Data

Agryzkov, Taras; Pedroche Sánchez, Francisco; Tortosa, Leandro; Vicent, José F. (MDPI AG, 2018-12)

[EN] Identifying the influential nodes in complex networks is a fundamental and practical topic at the moment. In this paper, a new centrality measure for complex networks is proposed based on two contrasting models that ...
Diseño de un programa en Python para el análisis de parámetros SEO que afectan al posicionamiento web en Google

Martínez Birlanga, Ariel (Universitat Politècnica de València, 2022-09-20)

[ES] En la actualidad, el posicionamiento web se ha convertido en una de las grandes prioridades para cualquier empresa que quiera tener presencia web. Para lograr dicha tarea se ha intentado estudiar los algoritmos PageRank ...
Google matrix analysis of worldwide football mercato

Loye, Justin; Coquidé, Célestin; Rollin, Guillaume; Lages, José (Editorial Universitat Politècnica de València, 2018-09-07)

[EN] The worldwide football transfer market is analyzed as a directed complex network: the football clubs are the network nodes and the directed edges are weighted by the total amount of money transferred from a club to ...
Leadership groups on Social Network Sites based on Personalized PageRank

Pedroche Sánchez, Francisco; Moreno, Francisco; González, Andrés; Valencia, Andrés (Elsevier, 2013-04)

n this paper we present a new framework to identify leaders in a Social Network Site using the Personalized PageRank vector. The methodology is based on the concept of Leadership group recently introduced by one of the ...
Matrix growth models based on centrality measures: a first analysis

Pedroche Sánchez, Francisco; Criado, Regino; García, Esther; Romance, Miguel (Interlude, 2011-10-24)

[EN] A general growth model of random networks based on centrality measures is introduced. This formalism extends the well-known models of preferential attachment. We propose to set the preferential attachment using a ...
Modelling Social Network Sites with PageRank and Social Competences

Pedroche Sánchez, Francisco (Interlude, 2011-04-01)

[EN] In this communication a recent method to classify the users of an SNS into Competitivity groups is recalled. This method is based on the PageRank algorithm. Competitivity groups are sets of nodes that compete among ...
On PageRank versatility for multiplex networks: properties and some useful bounds

Pedroche Sánchez, Francisco; Criado, Regino; Flores, Julio; García, Esther; Romance, Miguel (John Wiley & Sons, 2020-09-30)

[EN] In this paper, some results concerning the PageRank versatility measure for multiplex networks are given. This measure extends to the multiplex setting the well-known classic PageRank. Particularly, we focus on some ...
On the localization of the personalized PageRank of complex networks

García, E; Pedroche Sánchez, Francisco; Romance, M (Elsevier, 2012-12)

In this paper new results on personalized PageRank are shown. We consider directed graphs that may contain dangling nodes. The main result presented gives an analytical characterization of all the possible values of the ...
On the spectrum of two-layer approach and Multiplex PageRank

Pedroche Sánchez, Francisco; García, Esther; Romance, Miguel; Criado Herrero, Regino (Elsevier, 2018-12-15)

[EN] In this paper, we present some results about the spectrum of the matrix associated with the computation of the Multiplex PageRank defined by the authors in a previous paper. These results can be considered as a natural ...
Parametric controllability of the personalized PageRank: Classic model vs biplex approach

Flores, Julio; García, Esther; Pedroche Sánchez, Francisco; Romance, Miguel (American Institute of Physics, 2020-02)

[EN] Measures of centrality in networks defined by means of matrix algebra, like PageRank-type centralities, have been used for over 70 years. Recently, new extensions of PageRank have been formulated and may include a ...
Recopilación de tweets y medición de la relevancia basada en la topología

Duato Catalán, Daniel (Universitat Politècnica de València, 2015-10-05)

[ES] En este proyecto se ha creado una base de datos MongoDB y una aplicacion en Python ´ que utiliza la API de Twitter para obtener tuits e informacion de las cuentas de usuarios. Se ´ ha obtenido una coleccion de tuits ...
Sharp estimates for the personalized Multiplex PageRank

Pedroche Sánchez, Francisco; García, Esther; Romance, Miguel; Criado Herrero, Regino (Elsevier, 2018-03-01)

[EN] PageRank can be understood as the stationary distribution of a Markov chain that occurs in a two-layer network with the same set of nodes in both layers: the physical layer and the teleportation layer. In this paper ...
Some rankings based on PageRank applied to the Valencia Metro

Pedroche Sánchez, Francisco; Romance, Miguel; Criado, Regino (Interlude, 2016)

[EN] In this paper we apply a recent model of Multiplex PageRank to the multiplex network formed with the 9 lines of the metro of Valencia (Spain). We compute the PageRank vector following di erent approaches and we ...
Toward a modular precision ecosystem for high performance computing

Anzt, Hartwig; Flegar, Goran; Gruetzmacher, Thomas; Quintana-Orti, Enrique S. (SAGE Publications, 2019-11)

[EN] With the memory bandwidth of current computer architectures being significantly slower than the (floating point) arithmetic performance, many scientific computations only leverage a fraction of the computational power ...