Identifying the greatest team and captain - A complex network approach to cricket matches

We consider all Test matches played between 1877 and 2010 and One Day International (ODI) matches played between 1971 and 2010. We form directed and weighted networks of teams and also of their captains. The success of a team (or captain) is determined by the 'quality' of wins and not on the number of wins alone. We apply the diffusion based PageRank algorithm on the networks to access the importance of wins and rank the teams and captains respectively. Our analysis identifies {\it Australia} as the best team in both forms of cricket $-$ Test and ODI. {\it Steve Waugh} is identified as the best captain in Test cricket and {\it Ricky Ponting} is the best captain in the ODI format. We also compare our ranking scheme with the existing ranking schemes which include the Reliance ICC Ranking. Our method does not depend on `external' criteria in ranking of teams (captains). The purpose of this paper is to introduce a revised ranking of cricket teams and to quantify the success of the captains

Structure of Heterogeneous Networks

Heterogeneous networks play a key role in the evolution of communities and the decisions individuals make. These networks link different types of entities, for example, people and the events they attend. Network analysis algorithms usually project such networks unto simple graphs composed of entities of a single type. In the process, they conflate relations between entities of different types and loose important structural information. We develop a mathematical framework that can be used to compactly represent and analyze heterogeneous networks that combine multiple entity and link types. We generalize Bonacich centrality, which measures connectivity between nodes by the number of paths between them, to heterogeneous networks and use this measure to study network structure. Specifically, we extend the popular modularity-maximization method for community detection to use this centrality metric. We also rank nodes based on their connectivity to other nodes. One advantage of this centrality metric is that it has a tunable parameter we can use to set the length scale of interactions. By studying how rankings change with this parameter allows us to identify important nodes in the network. We apply the proposed method to analyze the structure of several heterogeneous networks. We show that exploiting additional sources of evidence corresponding to links between, as well as among, different entity types yields new insights into network structure

Reducing the Effects of Unequal Number of Games on Rankings

Ranking is an important mathematical process in a variety of contexts such as information retrieval, sports and business. Sports ranking methods can be applied both in and beyond the context of athletics. In both settings, once the concept of a game has been defined, teams (or individuals) accumulate wins, losses, and ties, which are then factored into the ranking computation. Many settings involve an unequal number of games between competitors. This paper demonstrates how to adapt two sports rankings methods, the Colley and Massey ranking methods, to settings where an unequal number of games are played between the teams. In such settings, the standard derivations of the methods can produce nonsensical rankings. This paper introduces the idea of including a super-user into the rankings and considers the effect of this fictitious player on the ratings. We apply such techniques to rank batters and pitchers in Major League baseball, professional tennis players, and participants in a free online social game. The ideas introduced in this paper can further the scope that such methods are applied and the depth of insight they offer

An Application of the PageRank Algorithm to NCAA Football Team Rankings

We investigate the use of Google’s PageRank algorithm to rank sports teams. The PageRank algorithm is used in web searches to return a list of the websites that are of most interest to the user. The structure of the NCAA FBS football schedule is used to construct a network with a similar structure to the world wide web. Parallels are drawn between pages that are linked in the world wide web with the results of a contest between two sports teams. The teams under consideration here are the members of the 2021 Football Bowl Subdivision. We achieve a total ordering of the 2021 FBS teams by applying the PageRank algorithm to the results of the regular and bowl seasons. A statistical method of correlation is used to compare the final AP rankings with PageRank models based on Margin of Victory and Total Points Scored

PageRank: Standing on the shoulders of giants

PageRank is a Web page ranking technique that has been a fundamental ingredient in the development and success of the Google search engine. The method is still one of the many signals that Google uses to determine which pages are most important. The main idea behind PageRank is to determine the importance of a Web page in terms of the importance assigned to the pages hyperlinking to it. In fact, this thesis is not new, and has been previously successfully exploited in different contexts. We review the PageRank method and link it to some renowned previous techniques that we have found in the fields of Web information retrieval, bibliometrics, sociometry, and econometrics