| Title: | How path counting and electrical resistance can help us find hidden links in social networks. |
| Speaker: | Amanda Francis Associate Editor Mathematical Reviews American Mathematics Society Ann Arbor, Michigan |
| Abstract: | Given a network of known relationships between people in a social network, can we predict new or hidden relationships? There are several known methods for link prediction. For example, the Katz method counts the number of paths between people, and assigns likelihood scores based on these counts. Alternately, we can use the mathematics of electrical resistor networks, assigning scores based on resistance distance between pairs of nodes. In this talk I will describe some of the mathematics behind these link prediction algorithms. I will share some new results about computing effective resistance on certain families of graphs, and I will discuss open problems, including comparing link scoring methods on simple networks. |
| Location: | Palenske 227 |
| Date: | 2/7/2019 |
| Time: | 3:30 PM |
@abstract{MCS:Colloquium:AmandaFrancis:2019:2:7,
author = "{Amanda Francis}",
title = "{How path counting and electrical resistance can help us find hidden links in social networks.}",
address = "{Albion College Mathematics and Computer Science Colloquium}",
month = "{7 February}",
year = "{2019}"
}