Abstract by Mikelle Rogers
Resistance Distance in Certain Families of Infinite Graphs
Resistance distance is an important graph metric that has been used for graph sparsification, link prediction, graph cutting and commute time calculations. My research focuses on determining the resistance distance, also known as the effective resistance, of families of infinite graphs. I am currently developing tools in python that will allow researchers to more easily identify patterns in resistance distance, with an initial focus of linear two trees. I expect that my research will help identify Fibonacci sequence like patterns in the resistance distance between nodes of a graph.