Spectral rank monotonicity on undirected networks

DOI10.1007/978-3-030-93409-5_20MaRDI QIDQ2086592zbMATH OpenOpenAlexFDO

Authors Paolo Boldi, Flavio Furia, Sebastiano Vigna

Publication date 25 October 2022

Full work available at URL https://arxiv.org/abs/2202.01044

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68Wxx)

Recommendations

• A note on the PageRank of undirected graphs
• Deformed Laplacians and spectral ranking in directed networks
• On PageRank versatility for multiplex networks: properties and some useful bounds
• PageRank in Undirected Random Graphs
• On the edges’ PageRank and line graphs

Cites work

• A new status index derived from sociometric analysis
• Axioms for Centrality
• Fast PageRank Computation via a Sparse Linear System
• Fibrations of graphs
• Graph fibrations, graph isomorphism, and PageRank
• scientific article; zbMATH DE number 3900787 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 1820648 (Why is no real title available?)
• scientific article; zbMATH DE number 3341035 (Why is no real title available?)
• Link Evolution: Analysis and Algorithms
• The centrality index of a graph

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Spectral rank monotonicity on undirected networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086592)