Centrality analysis for modified lattices

DOI10.1137/17M1114247zbMATH Open1373.05186MaRDI QIDQ4588933FDOQ4588933

Authors: Martin Paton, Kerem Akartunalı, Desmond J. Higham 

Publication date: 6 November 2017

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

• On the limiting behavior of parameter-dependent network centrality measures
• Centrality measures in networks
• The deformed graph Laplacian and its applications to network centrality analysis
• Measuring centrality by a generalization of degree
• Balanced centrality of networks

zbMATH Keywords

networkringspectrumPageRankcirculantshortcutKatz parameter

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new status index derived from sociometric analysis
• Collective dynamics of `small-world' networks
• Networks. An introduction.
• The spectra of large Toeplitz band matrices with a randomly perturbed entry
• Renormalization group analysis of the small-world network model
• Small worlds
• Google's PageRank and beyond. The science of search engine rankings
• PageRank beyond the web
• On the limiting behavior of parameter-dependent network centrality measures
• A Matrix Perturbation View of the Small World Phenomenon
• Matrix analysis of a Markov chain small-world model
• On large Toeplitz band matrices with an uncertain block
• Spectral approximation of banded Laurent matrices with localized random perturbations
• Greedy pathlengths and small world graphs
• Localized Eigenvectors from Widely Spaced Matrix Modifications
• Fast matrix computations for pairwise and columnwise commute times and Katz scores
• Matrix inverse trigonometric and inverse hyperbolic functions: theory and algorithms
• Sensitivity and stability of ranking vectors
• Mathematical underpinnings of analytics. Theory and applications for data science in customer-facing industries

Cited In (4)

• Efficient methods for the distance-based critical node detection problem in complex networks
• On the limiting behavior of parameter-dependent network centrality measures
• Subgraph centrality and walk-regularity
• Nonlocal pagerank

This page was built for publication: Centrality analysis for modified lattices

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