*** Welcome to piglix ***

John Urschel

John Urschel
refer to caption
Urschel in 2015
No. 64 Baltimore Ravens
Position: Guard
Center
Personal information
Date of birth: (1991-06-24) June 24, 1991 (age 25)
Place of birth: Winnipeg, Manitoba
Height: 6 ft 3 in (1.91 m)
Weight: 300 lb (136 kg)
Career information
High school: Buffalo (NY) Canisius
College: Penn State
NFL Draft: 2014 / Round: 5 / Pick: 175
Career history
Roster status: Active
Career highlights and awards
Career NFL statistics as of 2015
Games played: 27
Games started: 10
Player stats at NFL.com
Player stats at PFR
Games played: 27
Games started: 10
Player stats at NFL.com

John Cameron Urschel (born June 24, 1991) is a Canadian-born American football guard and center for the Baltimore Ravens of the National Football League (NFL). He was drafted by the Ravens in the fifth round of the 2014 NFL Draft. He played college football at Penn State. Urschel has bachelor's and master's degrees in mathematics from Penn State and is pursuing a Ph.D. in mathematics from MIT. He has published peer-reviewed articles in mathematics. He is also an Advanced Stats Columnist for The Players' Tribune. Urschel is a rated chess player with a provisional USCF rating of 1601.

Urschel was born in Winnipeg, Canada. His parents were a surgeon and an attorney. He earned a bachelor's and master's in mathematics at Pennsylvania State University. While at Penn State, he was awarded the William V. Campbell Trophy, known as the "academic Heisman". He is also an accomplished chess player.

Urschel was selected by the Baltimore Ravens in the fifth round of the 2014 NFL draft with the 175th overall pick. He played in 11 games, starting three, for the Ravens in 2014. He appeared in 16 games, starting seven, for the team in 2015.

In 2015, Urschel co-authored a paper in the Journal of Computational Mathematics 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."


...
Wikipedia

...