Some New Results on the Eigenvector Centrality

DOI10.1080/00222500701373251MaRDI QIDQ5308982zbMATH OpenOpenAlexFDO

Authors Rosanna Grassi, Silvana Stefani, Anna Torriero

Publication date 9 October 2007

Published in The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00222500701373251

zbMATH Keywords

graphssocial networksspectral radiuseigenvectordegreeCentrality measures

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Social networks; opinion dynamics (91D30)

Recommendations

• On the adjacency matrix of graphs: principal eigenvector versus degree vector
• Relating centralities in graphs and the principal eigenvector of its distance matrix
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• Eigenvector centrality of nodes in multiplex networks
• Eigenvector centralization as a measure of structural bias in information aggregation

Cites work

• scientific article; zbMATH DE number 1168330 (Why is no real title available?)
• Centrality and power in social networks: A game theoretic approach.
• Matrix iterative analysis
• On maximal entries in the principal eigenvector of graphs
• On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix

Cited in

(20)

• Centrality in organizational networks
• Betweenness Centrality: Extremal Values and Structural Properties
• A framework for second-order eigenvector centralities and clustering coefficients
• Eigenvector components of symmetric, graph-related matrices
• On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
• On the adjacency matrix of graphs: principal eigenvector versus degree vector
• Aggregating nonnegative eigenvectors of the adjacency matrix as a measure of centrality for a directed graph
• Relating centralities in graphs and the principal eigenvector of its distance matrix
• Nestedness in networks: A theoretical model and some applications
• Centrality measure in graphs
• Convex combinations of centrality measures
• Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
• Using principal eigenvectors of adjacency matrices with added diagonal weights to compose centrality measures and identify bowtie structures for a digraph
• A note on a generalization of eigenvector centrality for bipartite graphs and applications
• Extremal properties of graphs and eigencentrality in trees with a given degree sequence
• \(H\)-sequences and 2-step coreness in graphs
• The Measures of Rank or Status: A Reformulation and Reinterpretation
• Three hypergraph eigenvector centralities
• Vector centrality in hypergraphs
• Eigenvector centralization as a measure of structural bias in information aggregation

This page was built for publication: Some New Results on the Eigenvector Centrality

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