Measuring Centrality and Power Recursively in the World City Network: A Reply to Neal

نویسندگان

  • John P. Boyd
  • Matthew C. Mahutga
  • David A. Smith
چکیده

In a recent article, Zachary Neal (2011) distinguishes between centrality and power in world city networks and proposes two measures of recursive power and centrality. His effort to clarify oversimplistic interpretations of relational measures of power and position in world city networks is appreciated. However, Neal’s effort to innovate methodologically is based on theoretical reasoning that is dubious when applied to world city networks. And his attempt to develop new measures is flawed since he conflates ‘eigenvector centrality’ with ‘beta centrality’ and then argues that ‘eigenvector-based approaches’ to recursive power and centrality are ill-suited to world city networks. The main problem is that his measures of ‘recursive’ centrality and power are not recursive at all and thus are of very limited utility. It is concluded that established eigenvector centrality measures used in past research (which Neal critiques) provide more useful gauges of power and centrality in world city networks than his new indexes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Computationally Efficient Approximation of Beta Centrality

Much attention has been focused on developing methods of assessing centrality and power in networks, with particular interest focused on recursive measures that view the status of a node as a function of the status of other nodes. Although such measures have been widely adopted in both academic research and commercial applications, they are computationally intensive and subject to misspecificat...

متن کامل

An Integrated Approach for Measuring Performance of Network structure: Case study on power plants

Data envelopment analysis (DEA) and balanced scorecard (BSC) are two well-known approaches for measuring performance of decision making units (DMUs). BSC is especially applied with quality measures, whereas, when the quantity measures are used to evaluate, DEA is more appropriate. In the real-world, DMUs usually have complex structures such as network structures. One of the well-known network s...

متن کامل

The Influence of Location on Nodes’ Centrality in Location-Based Social Networks

Nowadays, due to the widespread use of social networks, they can be used as a convenient, low-cost, and affordable tool for disseminating all kinds of information and data among the massive users of these networks. Issues such as marketing for new products, informing the public in critical situations, and disseminating medical and technological innovations are topics that have been considered b...

متن کامل

A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

متن کامل

A New Optimization Algorithm for Optimal Wind Turbine Location Problem in Constantine City Electric Distribution Network Based Active Power Loss Reduction

The wind turbine has grown out to be one of the most common Renewable Energy Sources (RES) around the world in recent years. This study was intended to position the Wind Turbine (WT) on a wind farm to achieve the highest performance possible in Electric Distribution Network (EDN). In this paper a new optimization algorithm namely Salp Swarm Algorithm (SSA) is applied to solve the problem of opt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013