On the edges’ PageRank and line graphs
From MaRDI portal
(Redirected from On the edges’ PageRank and line graphs)
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
Cites work
- A mathematical model for network with structures in the mesoscale
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Analytical relationships between metric and centrality measures of a network and its dual
- Approximating PageRank from In-Degree
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- Centrality in networks of urban streets
- Clustering in random line graphs
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Complex networks: structure and dynamics
- Efficient algorithms for estimating loss of information in a complex network: applications to intentional risk analysis
- Evolutionary games defined at the network mesoscale: the public goods game
- Exploring complex networks
- Google's PageRank and beyond. The science of search engine rankings
- scientific article; zbMATH DE number 3675952 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1865707 (Why is no real title available?)
- Hyperstructures, a new approach to complex systems
- Intentional risk management through complex networks analysis
- Line graphs for a multiplex network
- Methods of calculating the PageRank vector
- Navigability of interconnected networks under random failures
- Networks. An introduction.
- Old and new generalizations of line graphs
- On the Line Graph of a Symmetric Balanced Incomplete Block Design
- On the linegraph of a directed-graph
- On the localization of the personalized PageRank of complex networks
- Random walk centrality in interconnected multilayer networks
- Sharp estimates for the personalized multiplex PageRank
- Statistical mechanics of complex networks
- Structural properties of the line-graphs associated to directed networks
- The Structure and Function of Complex Networks
- Transferability of collective transportation line networks from a topological and passenger demand perspective
- Urban traffic simulated from the dual representation: flow, crisis and congestion
- VULNERABILITY AND FALL OF EFFICIENCY IN COMPLEX NETWORKS: A NEW APPROACH WITH COMPUTATIONAL ADVANTAGES
Cited in
(8)- Spectral rank monotonicity on undirected networks
- 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 regular digraphs with prime out-degrees
- PageRank, Connecting a Line of Nodes with a Complete Graph
- Fixed points of personalized PageRank centrality: from irreducible to reducible networks
- A new insight into linguistic pattern analysis based on multilayer hypergraphs for the automatic extraction of text summaries
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)
