2006.65: Ranking the Importance of Boards of Directors
2006.65: M. J. Conyon and M. R. Muldoon (2008) Ranking the Importance of Boards of Directors.
This is the latest version of this eprint.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
We measure the importance (centrality) of boards of directors using the PageRank algorithm from computational graph theory. PageRank is at the heart of the immensely successful Google web search engine and, we argue, can be naturally extended to social network settings. In this view, a board can be represented as part of an affiliation network or, in graph theoretic-terms, an undirected bipartite graph. But PageRank operates on directed graphs, so we develop a procedure to pass from an undirected bipartite graph to appropriately weighted, directed projections. Finally, we present the rankings of publicly traded US and UK firms using this method.
|Item Type:||MIMS Preprint|
|Uncontrolled Keywords:||Corporate directorships, small worlds, random graphs|
|Subjects:||PACS 2003 > 89 Other areas of applied and interdisciplinary physics|
|Deposited By:||Dr Mark Muldoon|
|Deposited On:||16 January 2008|
Available Versions of this Item
- Ranking the Importance of Boards of Directors (deposited 16 January 2008) [Currently Displayed]