Complexity analysis in the sport of boxing

Author:

Tennant Adam G1,Ahmad Nasir2,Derrible Sybil2

Affiliation:

1. Department of Engineering, University of Southern Indiana, 8600 University Boulevard, Evansville, IN 47712, USA

2. Department of Civil & Materials Engineering, ERF (Engineering Research Facility) University of Illinois at Chicago, 842 W. Taylor Street, Chicago, IL 60607, USA

Abstract

Abstract A general model of the complexity of the sport of boxing has yet to be produced exploring the match play that goes on between combatants. The sport has a long history that dates back to the eighth century before common era (BCE) to the time of ancient Greece. Also known as the ‘sweet science’, most research work has legitimately focused on the combat sport’s long-term health affects concerning brain trauma. This present study seeks to explore the complexity of the sport by utilizing a data set of welterweights (63.5–67 kg). This data set was used to build a contact network with the boxers as nodes and the actual fights as the links. Additionally a PageRank algorithm was used to rank the boxers from the contact network. Devon Alexander was calculated as the top welterweight from data set. This was compared with the rankings of the sport’s notoriously corrupt sanctioning bodies, journalistic rankings, and a more standard non-network based ranking system. The network visualization displayed features typical of many others seen in the literature. A closer look was taken on several of the boxers by the visualization technique known as the rank clock. This allowed for the boxer’s rank history to be tracked and allowed for insight on their career trajectory. Timothy Bradley and Vyacheslav Senchenko had rank clocks that displayed them to be the most consistent boxers in the 2004–2014 decade. These research findings supply further confirmation of value of the network based approach in athletic match play.

Publisher

Oxford University Press (OUP)

Subject

Applied Mathematics,Computational Mathematics,Control and Optimization,Management Science and Operations Research,Computer Networks and Communications

Reference38 articles.

1. The architecture of complexity.;Simon;General systems,1965

2. Networks

3. The simplicity of planar networks.;Viana;Sci. Rep.,2013

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3