讲座内容：

Centrality is a foundational concept in network analysis that captures the centralizing tendency of a graph. In this talk, we introduce several measures of hypergraph centrality and, from the perspective of extremal set theory, define an index based on the sum of sizes of intersection. Using this index, we compare the intersection strength of families with fixed size, and obtain a quantitative version of the Erdős–Ko–Rado theorem.