Title of Oral/Poster Presentation

Centrality Measures of Graphs utilizing Continuous Walks in Hilbert Space

Presenter Information

Jarod P. BenowitzFollow

Class

Article

Department

Physics

Faculty Mentor

David Peak

Presentation Type

Poster Presentation

Abstract

Centrality is most commonly thought of as a measure in which we assign a ranking of the vertices from most important to least important. The importance of a vertex is relative to the underlying process being carried out on the network. This is why there is a diverse amount of centrality measures addressing many such processes. We propose a measure that assigns a ranking in which interference is a property of the underlying process being carried out on the network.

Start Date

4-9-2015 3:00 PM

This document is currently not available here.

Share

COinS
 
Apr 9th, 3:00 PM

Centrality Measures of Graphs utilizing Continuous Walks in Hilbert Space

Centrality is most commonly thought of as a measure in which we assign a ranking of the vertices from most important to least important. The importance of a vertex is relative to the underlying process being carried out on the network. This is why there is a diverse amount of centrality measures addressing many such processes. We propose a measure that assigns a ranking in which interference is a property of the underlying process being carried out on the network.