Eigenvector centrality

In graph theory, eigenvector centrality (also called eigencentrality) is a measure of the influence of a node in a network. It assigns relative…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

In September 2016, a fire in one of Puerto Rico's ten major power stations left over 1.5 million people without power and blacked…

2015

We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ in which the upper triangular entries are independent…

2013

Monitoring the activities of vehicles in modern cities and urban areas has become imperative for solving the traffic related…

2013

In this paper, we present a fast and scalable method for computing eigenvector centrality using graphics processing units (GPUs…

2012

This paper shows how the theory of recurrence related polynomials is connected to the construction of covariance displacement…

2012

The integral boundary layer system (IBL) with spatially periodic coecients arises as a long wave approximation for the flow of a…

2011

Centrality measure is an important concept in networks. It indicates the relative importance of nodes in a network. Various…

2009

Large-scale eigenvalue and singular value computations are usually based on extracting information from a compression of the…

2007

Telenor R&ISnaroyveien 30N-1331 Fornebu (Norway)name.surname@telenor.comSummary. In this chapter we introduce a model for…

2007

Classical writers such as John Stuart Mill and Karl Marx speculated that the standard of living could not rise indefinitely…