Richard Darling is an applied research mathematician with over two decades at the U.S. government (GS-14) after a 15-year academic career, specializing in scalable decision algorithms for large labeled graphs and tunable stochastic models for complex networks. He combines deep theoretical training (PhD Warwick, MSc Manchester, First Class Cambridge) with practical research in graph analytics, exploratory unsupervised learning, and probabilistic models that extend into cryptanalytic and number-theoretic algorithms. At NSA he produces internal publications, mentors interns, organizes seminars, and routinely translates advanced probabilistic methods into efficient simulation and optimization tools for large-scale data. His profile blends classical mathematical rigor with hands-on algorithm engineering for real-world, high-stakes problems, and he maintains a public record of scholarly work at probabilist.us.
9 years of coding experience
3 years of employment as a software developer
Master of Science (M.Sc.), Mathematical Statistics and Probability, Master of Science (M.Sc.), Mathematical Statistics and Probability at The University of Manchester
Bachelor's Degree, Mathematics, First Class Honours, Bachelor's Degree, Mathematics, First Class Honours at University of Cambridge
Doctor of Philosophy (Ph.D.), Mathematics, Doctor of Philosophy (Ph.D.), Mathematics at University of Warwick
High School, Science, Mathematics, Classics, High School, Science, Mathematics, Classics at Winchester College
Simulated waypoint data for multiple mobile devices are used to simulate infections in an epidemic
Contributions:18 pushes, 1 branch in 4 years
infectionsepidemicwaypointsimulate
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.