On the edges’ PageRank and line graphs
DOI10.1063/1.5020127zbMATH Open1396.05109OpenAlexW2827043657WikidataQ90708471 ScholiaQ90708471MaRDI QIDQ4683676FDOQ4683676
Authors: Regino Criado, Santiago Moral, Ángel Pérez, Miguel Romance 
Publication date: 21 September 2018
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.5020127
Recommendations
- A note on the PageRank of undirected graphs
- Traditional and Lazy PageRanks for a line of nodes connected with complete graphs
- A sharp PageRank algorithm with applications to edge ranking and graph sparsification
- PageRank in Undirected Random Graphs
- PageRank, Connecting a Line of Nodes with a Complete Graph
- PageRank for networks, graphs, and Markov chains
- PageRank in Scale-Free Random Graphs
- PageRank, a look at small changes in a line of nodes and the complete graph
- PageRank on inhomogeneous random digraphs
- On an edge ranking problem of trees and graphs
Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Statistical mechanics of complex networks
- Complex networks: structure and dynamics
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- Exploring complex networks
- Networks. An introduction.
- Sharp estimates for the personalized multiplex PageRank
- On the localization of the personalized PageRank of complex networks
- Transferability of collective transportation line networks from a topological and passenger demand perspective
- Efficient algorithms for estimating loss of information in a complex network: applications to intentional risk analysis
- Title not available (Why is that?)
- Methods of calculating the PageRank vector
- Google's PageRank and beyond. The science of search engine rankings
- Title not available (Why is that?)
- Centrality in networks of urban streets
- Old and new generalizations of line graphs
- Evolutionary games defined at the network mesoscale: the public goods game
- On the linegraph of a directed-graph
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Navigability of interconnected networks under random failures
- Clustering in random line graphs
- Analytical relationships between metric and centrality measures of a network and its dual
- Urban traffic simulated from the dual representation: flow, crisis and congestion
- A mathematical model for network with structures in the mesoscale
- Approximating PageRank from In-Degree
- Random walk centrality in interconnected multilayer networks
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- Hyperstructures, a new approach to complex systems
- Line graphs for a multiplex network
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- Structural properties of the line-graphs associated to directed networks
- Intentional risk management through complex networks analysis
- VULNERABILITY AND FALL OF EFFICIENCY IN COMPLEX NETWORKS: A NEW APPROACH WITH COMPUTATIONAL ADVANTAGES
Cited In (5)
- PageRank regular digraphs with prime out-degrees
- Enriched line graph: a new structure for searching language collocations
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- Edge importance in a network via line graphs and the matrix exponential
- PageRank, Connecting a Line of Nodes with a Complete Graph
This page was built for publication: On the edges’ PageRank and line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4683676)
