Some New Results on the Eigenvector Centrality

DOI10.1080/00222500701373251zbMATH Open1124.05063OpenAlexW1993663984MaRDI QIDQ5308982FDOQ5308982

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

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

zbMATH Keywords

graphssocial networksspectral radiuseigenvectordegreeCentrality measures

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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
• Centrality and power in social networks: A game theoretic approach.

Cited In (18)

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

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)