BYU

Abstract by Tyler Jones

Personal Infomation


Presenter's Name

Tyler Jones

Degree Level

Undergraduate

Abstract Infomation


Department

Mathematics

Faculty Advisor

Mark Kempton

Title

Random walks, page rank, and non-backtracking random walks

Abstract

Random walks through a network are often used in algorithms to estimate node importance, the most well known of these examples is the page rank metric. Page rank gives a score to each graph vertex based on how many incoming links it has. We explore how page rank values change when we constrain our random walks to be non-backtracking, and what implications this has on their ranking and other spectral properties of the network.