You are here
Data science and Complex networks seminar
Félév:
2016/17 I. félév
Helyszín:
Árpád tér 2. II. em. 220. sz.
Dátum:
2016-10-06
Időpont:
15:15-16:00
Előadó:
Turán György
Cím:
Betweenness centrality
Absztrakt:
The betweenness centrality of a vertex in a network measures the number of shortest paths containing the vertex. The local version considers only shortest paths of bounded length. We review related results, and then discuss the behavior of the local version for trees, including worst-case and scale-free random trees. Joint work with Ben Fish and Rahul Kushwaha.