default search action
Francisco Pedroche
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j11]Taras Agryzkov, Manuel Curado, Francisco Pedroche, Leandro Tortosa, José-Francisco Vicent:
Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach. Symmetry 11(2): 284 (2019) - [j10]Francisco Pedroche, Leandro Tortosa, José-Francisco Vicent:
An Eigenvector Centrality for Multiplex Networks with Data. Symmetry 11(6): 763 (2019) - 2018
- [j9]Taras Agryzkov, Francisco Pedroche, Leandro Tortosa, José-Francisco Vicent:
Combining the Two-Layers PageRank Approach with the APA Centrality in Networks with Data. ISPRS Int. J. Geo Inf. 7(12): 480 (2018) - [j8]Francisco Pedroche, Esther García, Miguel Romance, Regino Criado:
Sharp estimates for the personalized Multiplex PageRank. J. Comput. Appl. Math. 330: 1030-1040 (2018) - [j7]Francisco Pedroche, Esther García, Miguel Romance, Regino Criado:
On the spectrum of two-layer approach and Multiplex PageRank. J. Comput. Appl. Math. 344: 161-172 (2018) - 2016
- [j6]Regino Criado, Esther García, Francisco Pedroche, Miguel Romance:
On graphs associated to sets of rankings. J. Comput. Appl. Math. 291: 497-508 (2016) - 2015
- [j5]Francisco Pedroche, Regino Criado, Esther García, Miguel Romance, Victoria E. Sánchez:
Comparing series of rankings with ties by using complex networks: An analysis of the Spanish stock market (IBEX-35 index). Networks Heterog. Media 10(1): 101-125 (2015) - 2013
- [j4]Francisco Pedroche, Francisco Javier Moreno Arboleda, Andrés González, Andrés Valencia:
Leadership groups on Social Network Sites based on Personalized PageRank. Math. Comput. Model. 57(7-8): 1891-1896 (2013) - [i5]Regino Criado, Esther García, Francisco Pedroche, Miguel Romance:
A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues. CoRR abs/1307.3412 (2013) - [i4]Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa, Alberto Palomares:
On the convergence of weighted-average consensus. CoRR abs/1307.7562 (2013) - [i3]Regino Criado, Esther García, Francisco Pedroche, Miguel Romance:
Comparing rankings by means of competitivity graphs: structural properties and computation. CoRR abs/1310.6921 (2013) - 2012
- [j3]Francisco Pedroche:
A Model to Classify Users of Social Networks Based on PageRank. Int. J. Bifurc. Chaos 22(7) (2012) - [i2]Esther García, Francisco Pedroche, Miguel Romance:
On the Localization of the Personalized PageRank of Complex Networks. CoRR abs/1206.4855 (2012) - [i1]Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa, Alberto Palomares:
L-RCM: a method to detect connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm. CoRR abs/1206.5726 (2012) - 2011
- [j2]Ljiljana Cvetkovic, Vladimir Kostic, Rafael Bru, Francisco Pedroche:
A simple generalization of Geršgorin's theorem. Adv. Comput. Math. 35(2-4): 271-280 (2011)
2000 – 2009
- 2005
- [j1]Rafael Bru, Francisco Pedroche, Daniel B. Szyld:
Additive Schwarz Iterations for Markov Chains. SIAM J. Matrix Anal. Appl. 27(2): 445-458 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint