- -

On PageRank versatility for multiplex networks: properties and some useful bounds

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

On PageRank versatility for multiplex networks: properties and some useful bounds

Mostrar el registro completo del ítem

Pedroche Sánchez, F.; Criado, R.; Flores, J.; García, E.; Romance, M. (2020). On PageRank versatility for multiplex networks: properties and some useful bounds. Mathematical Methods in the Applied Sciences. 43(14):8158-8176. https://doi.org/10.1002/mma.6274

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/161985

Ficheros en el ítem

Thumbnail
Nombre: Pedroche;Criado;Flores ...
Tamaño: 368.4Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir/Preview
[Cerrado]
Nombre: mma.6274.pdf
Tamaño: 1.286Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor

Metadatos del ítem

Título: On PageRank versatility for multiplex networks: properties and some useful bounds
Autor: Pedroche Sánchez, Francisco Criado, Regino Flores, Julio García, Esther Romance, Miguel
Entidad UPV: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Fecha difusión:
Resumen:
[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 ...[+]
Palabras clave: Versatility , Laplacian matrices , PageRank , Centrality measures , Multiplex networks
Derechos de uso: Reserva de todos los derechos
Fuente:
Mathematical Methods in the Applied Sciences. (issn: 0170-4214 )
DOI: 10.1002/mma.6274
Editorial:
John Wiley & Sons
Versión del editor: https://doi.org/10.1002/mma.6274
Código del Proyecto:
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/MTM2017-84194-P/ES/SISTEMAS DE JORDAN, ALGEBRAS DE LIE Y REDES COMPLEJAS/
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PGC2018-101625-B-I00/ES/METODOS ALGEBRAICOS Y ANALITICOS EN ANALISIS DE REDES COMPLEJAS/
Agradecimientos:
This work has been partially supported by the projects MTM2017-84194-P (Ministerio de Ciencia y Tecnología, AEI/FEDER, UE) and PGC2018-101625B-100 (Ministerio de Ciencia y Tecnología, AEI/FEDER, UE).
Tipo: Artículo

References

BOCCALETTI, S., LATORA, V., MORENO, Y., CHAVEZ, M., & HWANG, D. (2006). Complex networks: Structure and dynamics. Physics Reports, 424(4-5), 175-308. doi:10.1016/j.physrep.2005.10.009

Criado, R., Flores, J., García del Amo, A., & Romance, M. (2011). Analytical relationships between metric and centrality measures of a network and its dual. Journal of Computational and Applied Mathematics, 235(7), 1775-1780. doi:10.1016/j.cam.2010.04.011

De Domenico, M., Solé-Ribalta, A., Omodei, E., Gómez, S., & Arenas, A. (2015). Ranking in interconnected multilayer networks reveals versatile nodes. Nature Communications, 6(1). doi:10.1038/ncomms7868 [+]
BOCCALETTI, S., LATORA, V., MORENO, Y., CHAVEZ, M., & HWANG, D. (2006). Complex networks: Structure and dynamics. Physics Reports, 424(4-5), 175-308. doi:10.1016/j.physrep.2005.10.009

Criado, R., Flores, J., García del Amo, A., & Romance, M. (2011). Analytical relationships between metric and centrality measures of a network and its dual. Journal of Computational and Applied Mathematics, 235(7), 1775-1780. doi:10.1016/j.cam.2010.04.011

De Domenico, M., Solé-Ribalta, A., Omodei, E., Gómez, S., & Arenas, A. (2015). Ranking in interconnected multilayer networks reveals versatile nodes. Nature Communications, 6(1). doi:10.1038/ncomms7868

Freeman, L. C. (1977). A Set of Measures of Centrality Based on Betweenness. Sociometry, 40(1), 35. doi:10.2307/3033543

Freeman, L. C. (1978). Centrality in social networks conceptual clarification. Social Networks, 1(3), 215-239. doi:10.1016/0378-8733(78)90021-7

Nicosia, V., Criado, R., Romance, M., Russo, G., & Latora, V. (2012). Controlling centrality in complex networks. Scientific Reports, 2(1). doi:10.1038/srep00218

Solá, L., Romance, M., Criado, R., Flores, J., García del Amo, A., & Boccaletti, S. (2013). Eigenvector centrality of nodes in multiplex networks. Chaos: An Interdisciplinary Journal of Nonlinear Science, 23(3), 033131. doi:10.1063/1.4818544

Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., … Zanin, M. (2014). The structure and dynamics of multilayer networks. Physics Reports, 544(1), 1-122. doi:10.1016/j.physrep.2014.07.001

Criado, R., García, E., Pedroche, F., & Romance, M. (2016). On graphs associated to sets of rankings. Journal of Computational and Applied Mathematics, 291, 497-508. doi:10.1016/j.cam.2015.03.009

Guimera, R., Mossa, S., Turtschi, A., & Amaral, L. A. N. (2005). The worldwide air transportation network: Anomalous centrality, community structure, and cities’ global roles. Proceedings of the National Academy of Sciences, 102(22), 7794-7799. doi:10.1073/pnas.0407994102

Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001). Lethality and centrality in protein networks. Nature, 411(6833), 41-42. doi:10.1038/35075138

PageL BrinS MotwaniR WinogradT.The PageRank citation ranking: Bringing order to the Web   Tech. Rep. 66;1998.  Stanford University.

Agryzkov, T., Tortosa, L., & Vicent, J. F. (2016). New highlights and a new centrality measure based on the Adapted PageRank Algorithm for urban networks. Applied Mathematics and Computation, 291, 14-29. doi:10.1016/j.amc.2016.06.036

Boldi, P., Santini, M., & Vigna, S. (2009). PageRank. ACM Transactions on Information Systems, 27(4), 1-23. doi:10.1145/1629096.1629097

Criado, R., Moral, S., Pérez, Á., & Romance, M. (2018). On the edges’ PageRank and line graphs. Chaos: An Interdisciplinary Journal of Nonlinear Science, 28(7), 075503. doi:10.1063/1.5020127

García, E., Pedroche, F., & Romance, M. (2013). On the localization of the personalized PageRank of complex networks. Linear Algebra and its Applications, 439(3), 640-652. doi:10.1016/j.laa.2012.10.051

Halu, A., Mondragón, R. J., Panzarasa, P., & Bianconi, G. (2013). Multiplex PageRank. PLoS ONE, 8(10), e78293. doi:10.1371/journal.pone.0078293

Pedroche Sánchez, F. (2010). Competitivity groups on social network sites. Mathematical and Computer Modelling, 52(7-8), 1052-1057. doi:10.1016/j.mcm.2010.02.031

Scholz, M., Pfeiffer, J., & Rothlauf, F. (2017). Using PageRank for non-personalized default rankings in dynamic markets. European Journal of Operational Research, 260(1), 388-401. doi:10.1016/j.ejor.2016.12.022

Shen, Z.-L., Huang, T.-Z., Carpentieri, B., Gu, X.-M., & Wen, C. (2017). An efficient elimination strategy for solving PageRank problems. Applied Mathematics and Computation, 298, 111-122. doi:10.1016/j.amc.2016.10.031

Tan, X. (2017). A new extrapolation method for PageRank computations. Journal of Computational and Applied Mathematics, 313, 383-392. doi:10.1016/j.cam.2016.08.034

Wen, C., Huang, T.-Z., & Shen, Z.-L. (2017). A note on the two-step matrix splitting iteration for computing PageRank. Journal of Computational and Applied Mathematics, 315, 87-97. doi:10.1016/j.cam.2016.10.020

Pedroche, F., Romance, M., & Criado, R. (2016). A biplex approach to PageRank centrality: From classic to multiplex networks. Chaos: An Interdisciplinary Journal of Nonlinear Science, 26(6), 065301. doi:10.1063/1.4952955

Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010). Community Structure in Time-Dependent, Multiscale, and Multiplex Networks. Science, 328(5980), 876-878. doi:10.1126/science.1184819

Szell, M., Lambiotte, R., & Thurner, S. (2010). Multirelational organization of large-scale social networks in an online world. Proceedings of the National Academy of Sciences, 107(31), 13636-13641. doi:10.1073/pnas.1004008107

Radicchi, F., & Arenas, A. (2013). Abrupt transition in the structural formation of interconnected networks. Nature Physics, 9(11), 717-720. doi:10.1038/nphys2761

Battiston, F., Nicosia, V., & Latora, V. (2017). The new challenges of multiplex networks: Measures and models. The European Physical Journal Special Topics, 226(3), 401-416. doi:10.1140/epjst/e2016-60274-8

Romance, M., Solá, L., Flores, J., García, E., García del Amo, A., & Criado, R. (2015). A Perron–Frobenius theory for block matrices associated to a multiplex network. Chaos, Solitons & Fractals, 72, 77-89. doi:10.1016/j.chaos.2014.12.020

Wang, D., & Zou, X. (2018). A new centrality measure of nodes in multilayer networks under the framework of tensor computation. Applied Mathematical Modelling, 54, 46-63. doi:10.1016/j.apm.2017.07.012

PadgettJF.Marriage and Elite Structure in Renaissance Florence 1282‐1500. Paper delivered to the Social Science History Association;1994.

Sciarra, C., Chiarotti, G., Laio, F., & Ridolfi, L. (2018). A change of perspective in network centrality. Scientific Reports, 8(1). doi:10.1038/s41598-018-33336-8

Horn, R. A., & Johnson, C. R. (1991). Topics in Matrix Analysis. doi:10.1017/cbo9780511840371

OMODEI, E., DE DOMENICO, M., & ARENAS, A. (2016). Evaluating the impact of interdisciplinary research: A multilayer network approach. Network Science, 5(2), 235-246. doi:10.1017/nws.2016.15

Horn, R. A., & Johnson, C. R. (1985). Matrix Analysis. doi:10.1017/cbo9780511810817

Merris, R. (1998). Laplacian graph eigenvectors. Linear Algebra and its Applications, 278(1-3), 221-236. doi:10.1016/s0024-3795(97)10080-5

[-]

recommendations

 

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro completo del ítem