Random Walker Ranking for NCAA Division I-A Football

@article{Callaghan2007RandomWR,
  title={Random Walker Ranking for NCAA Division I-A Football},
  author={Thomas Callaghan and P. Mucha and M. Porter},
  journal={The American Mathematical Monthly},
  year={2007},
  volume={114},
  pages={761 - 777}
}
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… Expand
Optimising a Tournament for Use with Ranking Algorithms
The top division in American college football known as the Football Bowl Subdivision uses a series of polls and computerised ranking systems to determine the match-ups for the postseason bowlExpand
Reweighting the Bowl Championship Series
The majority of statistical work on college football's Bowl Championship Series (BCS) has involved proposing or categorizing computer ratings of teams. Computer algorithms, a coaches' poll, and aExpand
An Effective Nonlinear Rewards-Based Ranking System
This article describes a new strategy for objectively quantifying the performance exhibited by each and every team as derived from that year’s games. When applied to the last sixteen seasons ofExpand
A Logistic Regression/Markov Chain Model for NCAA Basketball
TLDR
Over the past 6 years, the combined logistic regression/Markov chain model has been significantly more successful than the other common methods such as tournament seedings, the AP and ESPN/USA Today polls, the RPI, and the Sagarin and Massey ratings. Expand
The predictive power of ranking systems in association football
TLDR
An overview and comparison of predictive capabilities of several methods for ranking association football teams and the best performing algorithm is a version of the famous Elo rating system that originates from chess player ratings, but several other methods provide better predictive performance than the official ranking method. Expand
Mutually-antagonistic interactions in baseball networks
TLDR
It is found that a player’s position in the network does not correlate with his placement in the random walker ranking, but network position does have a substantial effect on the robustness of ranking placement to changes in head-to-head matchups. Expand
Inequalities, Preferences and Rankings in US Sports Coach Hiring Networks
TLDR
This paper collects more than 12,000 head coach hiring records in two different popular sports from the NCAA and builds the coach hiring network in the NCAA men's basketball and football using network-based methods, finding that there is great inequality in coach production. Expand
Sports Rankings REU Final Report 2012 : An Analysis of Pairwise-Comparison Based Sports Ranking Methods and a Novel Agent-Based Markovian Basketball Simulation
There are numerous methods to rank sports teams. Each of these methods incorporate different components to determine a ranking system. For example, the Rating Percentage Index (RPI) method considersExpand
Crowd-Ranking: a Markov-based method for ranking alternatives
TLDR
The new ranking method, Crowd-Ranking, uses collective wisdom and decision-making in conjunction with Markov chains to create competitive matches between alternatives and ultimately provide a ranking of the alternatives. Expand
Multidimensional scaling analysis of soccer dynamics
TLDR
The dissimilarities between teams are measured using the match results at each round and that information feeds a multidimensional scaling (MDS) algorithm for visualizing teams’ performance. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 51 REFERENCES
A network-based ranking system for US college football
American college football faces a conflict created by the desire to stage national championship games between the best teams of a season when there is no conventional play-off system for decidingExpand
College Football Rankings: Do the Computers Know Best?
TLDR
An evaluation of the performance of the 10 ranking schemes the BCS committee used during the 1999 and 2000 seasons to select bowl teams found that almost all are equally accurate, but theSeattle Times scheme clearly underperforms the others. Expand
Minimizing Game Score Violations in College Football Rankings
  • B. Coleman
  • Engineering, Computer Science
  • Interfaces
  • 2005
TLDR
Using a model for minimizing violations that exploits problem characteristics found in college football, it was found that all previous ranking systems generated violations that were at least 38 percent higher than the minimum. Expand
A Logistic Regression/Markov Chain Model for NCAA Basketball
TLDR
Over the past 6 years, the combined logistic regression/Markov chain model has been significantly more successful than the other common methods such as tournament seedings, the AP and ESPN/USA Today polls, the RPI, and the Sagarin and Massey ratings. Expand
The Bowl Championship Series: A Mathematical Review
TLDR
It is argued that the true problem with the BCS Standings lies not in the computer algorithms, but rather in misguided addition. Expand
Survey of the major world sports rating systems
Using a common framework, this paper presents a survey of the major world sports rating systems (WSRSs) in skiing (sponsored by the International Skiing Federation (FIS)), men's tennis (AssociationExpand
On Minimum Violations Ranking in Paired Comparisons
TLDR
A minimum violations ranking (MVR) method is presented, which searches specifically for rankings that have the minimum possible number of violations which may or may not be zero. Expand
The Perron-Frobenius Theorem and the Ranking of Football Teams
  • J. Keener
  • Computer Science, Mathematics
  • SIAM Rev.
  • 1993
The author describes four different methods to rank teams in uneven paired competition and shows how each of these methods depends in some fundamental way on the Perron–Frobenius theorem.
An extension of Zermelo's model for ranking by paired comparisons
In 1929, Zermelo proposed a probabilistic model for ranking by paired comparisons and showed that this model produces a unique ranking of the objects under consideration when the outcome matrix isExpand
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Physics, Computer Science
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability. Expand
...
1
2
3
4
5
...