No. 64 | |||||
---|---|---|---|---|---|
Position: | Guard | ||||
Personal information | |||||
Born: | Winnipeg, Manitoba, Canada | June 24, 1991||||
Height: | 6 ft 3 in (1.91 m) | ||||
Weight: | 300 lb (136 kg) | ||||
Career information | |||||
High school: | Canisius (Buffalo, New York) | ||||
College: | Penn State | ||||
NFL draft: | 2014 / Round: 5 / Pick: 175 | ||||
Career history | |||||
Career highlights and awards | |||||
| |||||
Career NFL statistics | |||||
| |||||
Player stats at NFL.com · PFR |
John Cameron Urschel (born June 24, 1991) is a Canadian-American mathematician and former professional American football guard [1] [2] He played college football at Penn State and was drafted by the Baltimore Ravens in the fifth round of the 2014 NFL Draft. Urschel played his entire NFL career with Baltimore before announcing his retirement on July 27, 2017, at 26 years old.
Urschel has bachelor's and master's degrees (both from Penn State) and a PhD (from the Massachusetts Institute of Technology), all in mathematics. [3] [4] Urschel is also an advanced stats columnist for The Players' Tribune . He is currently serving a three-year term on the College Football Playoff selection committee which began in the spring of 2020, [5] and is an assistant professor at the Department of Mathematics of the Massachusetts Institute of Technology. [6]
Urschel was born in Winnipeg, Manitoba, Canada. His parents, John Urschel and Venita Parker, were a surgeon and attorney, respectively. [7] He grew up in Buffalo, New York where he graduated from Canisius High School in 2009. [5]
He earned bachelor's (2012) and master's (2013) degrees in mathematics at Pennsylvania State University, and a doctorate (2021) at the Massachusetts Institute of Technology. While at Penn State, he was awarded the William V. Campbell Trophy, known as the "academic Heisman".
John Urschel was a player for the Baltimore Ravens. His career lasted from 2014 to 2017.
Height | Weight | Arm length | Hand span | 40-yard dash | 10-yard split | 20-yard split | 20-yard shuttle | Three-cone drill | Vertical jump | Broad jump | Bench press | Wonderlic |
---|---|---|---|---|---|---|---|---|---|---|---|---|
6 ft 3 in (1.91 m) | 313 lb (142 kg) | 33 in (0.84 m) | 10+3⁄8 in (0.26 m) | 5.31 s | 1.84 s | 3.08 s | 4.47 s | 7.55 s | 29.0 in (0.74 m) | 8 ft 6 in (2.59 m) | 30 reps | 43 [8] |
All values from NFL Combine [9] [10] |
Urschel was selected by the Baltimore Ravens in the fifth round of the 2014 NFL draft with the 1st overall pick. [11] He played in 11 games, starting three, for the Ravens in 2014. He appeared in 16 games, starting seven, for the team in 2015. [12]
On July 27, 2017, Urschel announced his retirement from the NFL after three seasons. [13] [14] The Baltimore Sun reported that the JAMA study on the prevalence of chronic traumatic encephalopathy (CTE) in deceased players was a factor in Urschel's decision. [15] Officially he stated, "This [CTE] was actually a serious, serious concern of mine. Yes, I am retiring; I did retire. But at the same time, I love the NFL. I love football. I wouldn't trade my experiences for the world. I do believe that football is a great game. I didn't want to be fodder for anti-football establishments." [16]
His retirement as an active player was not the end of his participation in the sport. He was appointed to the College Football Playoff selection committee on January 22, 2020, serving a three-year term which began in the spring of that year. [5]
While doing his master's at Penn State, Urschel was involved in teaching vector calculus, trigonometry and analytic geometry, and introduction to econometrics. [17] In 2014, Urschel was named Arthur Ashe, Jr. Sports Scholar by Diverse: Issues In Higher Education. [18] In 2015, Urschel co-authored a paper in the Journal of Computational Mathematics [19] titled "A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians". It includes "a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue." [20]
Urschel began a Ph.D. in mathematics at Massachusetts Institute of Technology in 2016, [21] focusing on spectral graph theory, numerical linear algebra, and machine learning. [22] MIT does not allow Ph.D. students to study part-time; while the Ravens knew that he was taking classes, Urschel admitted after retiring from the team that he did not disclose that he was a full-time graduate student, having taken correspondence classes in between games and practices. [23] On January 4, 2017, Urschel was named to Forbes' "30 Under 30" list of outstanding young scientists and owns the following blurb: "Urschel has published six peer-reviewed mathematics papers to date and has three more ready for review. He's won academic awards for his math prowess. All this while playing guard for the Baltimore Ravens." [24] [25] [26]
Since 2017, Urschel has had an Erdős number of 4. His PhD thesis on Graphs, Principal Minors, and Eigenvalue Problems was completed in 2021 under Michel Goemans at MIT. He was a member of the Institute for Advanced Study in Princeton, New Jersey. [27] In the Fall of 2023, Urschel joined the faculty of MIT as an assistant professor in the MIT Math department. [28] [29] He is also a Junior Fellow at the Harvard Society of Fellows (currently on leave). [30]
Urschel competed in the 2015 Pittsburgh Open, finishing in 12th place (tied for 9th) with 3.0 points (+2-1=2) in the Under 1700 rating section. [33] [34] Urschel competes in competitive online chess on Chess.com, and he has commentated for Chess.com's BlitzChamps event, a rapid tournament for NFL players.
Urschel is married to writer Louisa Thomas, whom he met when she was profiling him for Grantland . In 2017, their daughter, Joanna, was born. [35] Urschel's autobiography, Mind and Matter: A Life in Math and Football, was co-written by Thomas and published in 2019. [36] [37]
Linear algebra is the branch of mathematics concerning linear equations such as:
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.
In mathematics, spectral graph theory is the study of the properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated with the graph, such as its adjacency matrix or Laplacian matrix.
In mathematics, a locally compact topological group G has property (T) if the trivial representation is an isolated point in its unitary dual equipped with the Fell topology. Informally, this means that if G acts unitarily on a Hilbert space and has "almost invariant vectors", then it has a nonzero invariant vector. The formal definition, introduced by David Kazhdan (1967), gives this a precise, quantitative meaning.
In numerical analysis, a multigrid method is an algorithm for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in problems exhibiting multiple scales of behavior. For example, many basic relaxation methods exhibit different rates of convergence for short- and long-wavelength components, suggesting these different scales be treated differently, as in a Fourier analysis approach to multigrid. MG methods can be used as solvers as well as preconditioners.
In linear algebra, it is often important to know which vectors have their directions unchanged by a given linear transformation. An eigenvector or characteristic vector is such a vector. Thus an eigenvector of a linear transformation is scaled by a constant factor when the linear transformation is applied to it: . The corresponding eigenvalue, characteristic value, or characteristic root is the multiplying factor .
William Gilbert Strang is an American mathematician known for his contributions to finite element theory, the calculus of variations, wavelet analysis and linear algebra. He has made many contributions to mathematics education, including publishing mathematics textbooks. Strang was the MathWorks Professor of Mathematics at the Massachusetts Institute of Technology. He taught Linear Algebra, Computational Science, and Engineering, Learning from Data, and his lectures are freely available through MIT OpenCourseWare.
The algebraic connectivity of a graph G is the second-smallest eigenvalue of the Laplacian matrix of G. This eigenvalue is greater than 0 if and only if G is a connected graph. This is a corollary to the fact that the number of times 0 appears as an eigenvalue in the Laplacian is the number of connected components in the graph. The magnitude of this value reflects how well connected the overall graph is. It has been used in analyzing the robustness and synchronizability of networks.
Miroslav Fiedler was a Czech mathematician known for his contributions to linear algebra, graph theory and algebraic graph theory.
In mathematics, a representation is a very general relationship that expresses similarities between mathematical objects or structures. Roughly speaking, a collection Y of mathematical objects may be said to represent another collection X of objects, provided that the properties and relationships existing among the representing objects yi conform, in some consistent way, to those existing among the corresponding represented objects xi. More specifically, given a set Π of properties and relations, a Π-representation of some structure X is a structure Y that is the image of X under a homomorphism that preserves Π. The label representation is sometimes also applied to the homomorphism itself.
In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges of the original graph that cross between the groups will produce edges in the partitioned graph. If the number of resulting edges is small compared to the original graph, then the partitioned graph may be better suited for analysis and problem-solving than the original. Finding a partition that simplifies graph analysis is a hard problem, but one that has applications to scientific computing, VLSI circuit design, and task scheduling in multiprocessor computers, among others. Recently, the graph partition problem has gained importance due to its application for clustering and detection of cliques in social, pathological and biological networks. For a survey on recent trends in computational methods and applications see Buluc et al. (2013). Two common examples of graph partitioning are minimum cut and maximum cut problems.
In multivariate statistics, spectral clustering techniques make use of the spectrum (eigenvalues) of the similarity matrix of the data to perform dimensionality reduction before clustering in fewer dimensions. The similarity matrix is provided as an input and consists of a quantitative assessment of the relative similarity of each pair of points in the dataset.
Algebra is the branch of mathematics that studies algebraic systems and the manipulation of equations within those systems. It is a generalization of arithmetic that introduces variables and algebraic operations other than the standard arithmetic operations like addition and multiplication.
Daniel Alan Spielman has been a professor of applied mathematics and computer science at Yale University since 2006. As of 2018, he is the Sterling Professor of Computer Science at Yale. He is also the Co-Director of the Yale Institute for Network Science, since its founding, and chair of the newly established Department of Statistics and Data Science.
Jinchao Xu is an American-Chinese mathematician. He is currently the Verne M. Willaman Professor in the Department of Mathematics at the Pennsylvania State University, University Park. He is known for his work on multigrid methods, domain decomposition methods, finite element methods, and more recently deep neural networks.
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is a matrix-free method for finding the largest eigenvalues and the corresponding eigenvectors of a symmetric generalized eigenvalue problem
Shmuel Friedland is an Israeli-American mathematician.
GraphBLAS is an API specification that defines standard building blocks for graph algorithms in the language of linear algebra. GraphBLAS is built upon the notion that a sparse matrix can be used to represent graphs as either an adjacency matrix or an incidence matrix. The GraphBLAS specification describes how graph operations can be efficiently implemented via linear algebraic methods over different semirings.
{{cite web}}
: CS1 maint: archived copy as title (link)