Naval Postgraduate School
Dudley Knox Library
NPS Dudley Knox Library
View Item 
  •   Calhoun Home
  • Theses and Dissertations
  • 1. Thesis and Dissertation Collection, all items
  • View Item
  •   Calhoun Home
  • Theses and Dissertations
  • 1. Thesis and Dissertation Collection, all items
  • View Item
  • How to search in Calhoun
  • My Accounts
  • Ask a Librarian
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of CalhounCollectionsThis Collection

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

THE DISTANCE CENTRALITY: MEASURING STRUCTURAL DISRUPTION OF A NETWORK

Thumbnail
Download
Icon18Jun_Roginski_Jonathan.pdf (5.789Mb)
Download Record
Download to EndNote/RefMan (RIS)
Download to BibTex
Author
Roginski, Jonathan W.
Date
2018-06
Advisor
Borges, Carlos F.
Rasmussen, Craig W.
Gera, Ralucca
Alderson, David L. Jr.
Everton, Sean F.
Baumgartner, Gerry
Arney, David
Metadata
Show full item record
Abstract
This research provides an innovative approach to identifying the influence of vertices on the topology of a graph by introducing and exploring the neighbor matrix and distance centrality. The neighbor matrix depicts the “distance profile” of each vertex, identifying the number of vertices at each shortest path length from the given vertex. From the neighbor matrix, we can derive 11 oft-used graph invariants. Distance centrality uses the neighbor matrix to identify how much influence a given vertex has over graph structure by calculating the amount of neighbor matrix change resulting from vertex removal. We explore the distance centrality in the context of three synthetic graphs and three graphs representing actual social networks. Regression analysis enables the determination that the distance centrality contains different information than four current centrality measures (betweenness, closeness, degree, and eigenvector). The distance centrality proved to be more robust against small changes in graphs through analysis of graphs under edge swapping, deletion, and addition paradigms than betweenness and eigenvector centrality, though less so than degree and closeness centralities. We find that the neighbor matrix and the distance centrality reliably enable the identification of vertices that are significant in different and important contexts than current measures.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
URI
http://hdl.handle.net/10945/59576
Collections
  • 1. Thesis and Dissertation Collection, all items

Related items

Showing items related by title, author, creator and subject.

  • Thumbnail

    The Neighbor Matrix: Generalizing A Graph’s Degree Sequence 

    Roginski, Jonathan W.; Gera, Ralucca M.; Rye, Erik C. (ArXiv, 2016-08);
    The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized ...
  • Thumbnail

    The Neighbor Matrix: generalizing the degree sequence 

    Roginski, Jonathan W.; Gera, Ralucca M.; Rye, Eric C. (American Mathematical Society, 2015-10-19);
    The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized ...
  • Thumbnail

    The Neighbor Matrix: Generalizing A Graph’s Degree Sequence 

    Roginski, Jonathan W. (Monterey, CA. Naval Postgraduate School, 2017);
    “Who:” The Neighbor Matrix; What does it do? Describes graph topology; Where: Globally – across the entire graph; When: All graphs; Why: Compact structure containing at least 11 graph invariants and topological descriptors; ...
NPS Dudley Knox LibraryDUDLEY KNOX LIBRARY
Feedback

411 Dyer Rd. Bldg. 339
Monterey, CA 93943
circdesk@nps.edu
(831) 656-2947
DSN 756-2947

    Federal Depository Library      


Start Your Research

Research Guides
Academic Writing
Ask a Librarian
Copyright at NPS
Graduate Writing Center
How to Cite
Library Liaisons
Research Tools
Thesis Processing Office

Find & Download

Databases List
Articles, Books & More
NPS Theses
NPS Faculty Publications: Calhoun
Journal Titles
Course Reserves

Use the Library

My Accounts
Request Article or Book
Borrow, Renew, Return
Tech Help
Remote Access
Workshops & Tours

For Faculty & Researchers
For International Students
For Alumni

Print, Copy, Scan, Fax
Rooms & Study Spaces
Floor Map
Computers & Software
Adapters, Lockers & More

Collections

NPS Archive: Calhoun
Restricted Resources
Special Collections & Archives
Federal Depository
Homeland Security Digital Library

About

Hours
Library Staff
About Us
Special Exhibits
Policies
Our Affiliates
Visit Us

NPS-Licensed Resources—Terms & Conditions
Copyright Notice

Naval Postgraduate School

Naval Postgraduate School
1 University Circle, Monterey, CA 93943
Driving Directions | Campus Map

This is an official U.S. Navy Website |  Please read our Privacy Policy Notice  |  FOIA |  Section 508 |  No FEAR Act |  Whistleblower Protection |  Copyright and Accessibility |  Contact Webmaster

Export search results

The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

A logged-in user can export up to 15000 items. If you're not logged in, you can export no more than 500 items.

To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.