NCAA级别I-A足球的随机沃克排名
Random Walker Ranking for NCAA Division I-A Football
摘要:
每年12月,美国各地的大学足球迷和专家们都会讨论哪两支球队应该在NCAA I-A级全国锦标赛中相遇。碗冠军系列赛(BCS)排名用于选择邀请参加这场比赛的球队,旨在为冠军提供一个明确的#1对#2比赛;然而,近年来,这个选择过程本身就备受争议。构成BCS排名一部分的计算机算法经常成为争议的避雷针,部分原因是它们没有向公众充分解释。我们提出了一种替代算法,简单地解释,但仍然有效地排名最好的球队。我们定义了一个排名中的偏见随机游走的游戏时间表所形成的图形,两个团队(顶点)连接的边缘,如果他们发挥对方。每个随机步行者通过选择一场比赛并以概率p“投票”选出获胜者来从一个队移动到另一个队,在“我的队击败你的队”的论点的激励下,描绘出一条永无止境的道路。我们研究了一组这样的步行者的统计特性,将排名与底层网络的社区结构联系起来,并展示了最近NCAA分部I-A赛季的结果。我们还讨论了算法的渐近行为,说明了一些分析听话的情况下,循环赛,并讨论可能的推广。
英文摘要:
Each December, college football fans and pundits across America debate which two teams should meet in the NCAA Division I-A National Championship game. The Bowl Championship Series (BCS) standings employed to select the teams invited to this game are intended to provide an unequivocal #1 v. #2 game for the championship; however, this selection process has itself been highly controversial in recent years. The computer algorithms that constitute one part of the BCS standings often act as lightning rods for the controversy, in part because they are inadequately explained to the public. We present an alternative algorithm that is simply explained yet remains effective at ranking the best teams. We define a ranking in terms of biased random walkers on the graph formed by the schedule of games played, with two teams (vertices) connected by an edge if they played each other. Each random walker moves from team to team by selecting a game and "voting" for its winner with probability p, tracing out a never-ending path motivated by the "my team beat your team" argument. We study the statistical properties of a collection of such walkers, relate the rankings to the community structure of the underlying network, and demonstrate the results for recent NCAA Division I-A seasons. We also discuss the algorithm's asymptotic behavior, illustrated with some analytically tractable cases for round-robin tournaments, and discuss possible generalizations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。