The following pages link to Regino Criado (Q258460):
Displaying 50 items.
- Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index) (Q258462) (← links)
- Efficient algorithms for estimating loss of information in a complex network: applications to intentional risk analysis (Q258469) (← links)
- Interest point detection in images using complex network analysis (Q415215) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- (Q629397) (redirect page) (← links)
- Analytical relationships between metric and centrality measures of a network and its dual (Q629400) (← links)
- On the spectrum of two-layer approach and multiplex PageRank (Q724498) (← links)
- A Perron-Frobenius theory for block matrices associated to a multiplex network (Q728350) (← links)
- Effective measurement of network vulnerability under random and intentional attacks (Q812075) (← links)
- Choosing a leader on a complex network (Q879402) (← links)
- Asymptotic estimates for efficiency, vulnerability and cost for random networks (Q879426) (← links)
- A transfinite extension of the covering dimension (Q1114961) (← links)
- Credit card fraud detection through parenclitic network analysis (Q1649519) (← links)
- Sharp estimates for the personalized multiplex PageRank (Q1676039) (← links)
- On the \(\alpha\)-nonbacktracking centrality for complex networks: existence and limit cases (Q1713144) (← links)
- On the stability of exponential fitting BDF algorithms (Q1765434) (← links)
- Structural properties of the line-graphs associated to directed networks (Q1941610) (← links)
- A compartmental model for cyber-epidemics (Q2112886) (← links)
- Enriched line graph: a new structure for searching language collocations (Q2128305) (← links)
- Non-backtracking PageRank: from the classic model to Hashimoto matrices (Q2213846) (← links)
- New results on computable efficiency and its stability for complex networks (Q2491749) (← links)
- A new method for comparing rankings through complex networks: Model and analysis of competitiveness of major European soccer leagues (Q2787889) (← links)
- Evolutionary games defined at the network mesoscale: The Public Goods game (Q2821524) (← links)
- Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them (Q2917207) (← links)
- (Q2988112) (← links)
- (Q3031611) (← links)
- (Q3185239) (← links)
- Eigenvector centrality of nodes in multiplex networks (Q3193354) (← links)
- A NODE-BASED MULTISCALE VULNERABILITY OF COMPLEX NETWORKS (Q3398195) (← links)
- VULNERABILITY AND FALL OF EFFICIENCY IN COMPLEX NETWORKS: A NEW APPROACH WITH COMPUTATIONAL ADVANTAGES (Q3398198) (← links)
- Intentional Risk Management through Complex Networks Analysis (Q3456883) (← links)
- (Q3469886) (← links)
- (Q3551832) (← links)
- HYPERSTRUCTURES, A NEW APPROACH TO COMPLEX SYSTEMS (Q3586820) (← links)
- (Q3597409) (← links)
- (Q3597410) (← links)
- Improvements in performance and security for complex networks (Q3603597) (← links)
- Green's function evaluation for three-dimensional exponentially graded elasticity (Q3623713) (← links)
- Multiscale vulnerability of complex networks (Q3636674) (← links)
- (Q3790314) (← links)
- (Q4235430) (← links)
- (Q4308668) (← links)
- (Q4366927) (← links)
- A biplex approach to PageRank centrality: From classic to multiplex networks (Q4591844) (← links)
- Line graphs for a multiplex network (Q4591849) (← links)
- On the edges’ PageRank and line graphs (Q4683676) (← links)
- (Q4849470) (← links)
- (Q4864468) (← links)
- (Q4877698) (← links)
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity (Q4979574) (← links)
