This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| M. E. J. Newman | |
|---|---|
| Name | M. E. J. Newman |
| Birth date | 1965 |
| Nationality | British |
| Fields | Network science, statistical mechanics, complex systems |
| Alma mater | University of Oxford |
| Known for | Network theory, community detection, network epidemiology |
| Awards | Erdős–Rényi Prize, Dirac Medal |
M. E. J. Newman is a British physicist and leading scholar in network science, notable for foundational work in complex networks, graph theory, and statistical mechanics. His research has influenced studies at institutions such as University of Oxford, Santa Fe Institute, and Los Alamos National Laboratory, and has been applied across domains involving Internet, World Wide Web, epidemiology, social networks, and biological networks.
Newman studied physics at the University of Oxford and completed doctoral research under advisors connected to Statistical mechanics traditions and groups associated with Rudolf Peierls-influenced departments. During his graduate years he worked on problems related to percolation theory, Ising model, and probabilistic models used by researchers at Trinity College, Oxford and collaborators in the United States such as at the Los Alamos National Laboratory and the Santa Fe Institute. His early mentors and peers included scholars from Cambridge University, Imperial College London, and the University of California, Santa Barbara network theory community.
Newman has held faculty and research positions at the University of Michigan, the University of California, and Oxford University, and has collaborated with scientists at the Santa Fe Institute, Los Alamos National Laboratory, and the Max Planck Society. He served as a professor in departments that interact with Physics Department, University of Michigan-type groups, hosted workshops with the Royal Society, and participated in conferences organized by SIAM, American Physical Society, and European Physical Society. He has been a visiting scholar at institutions including Harvard University, Princeton University, Massachusetts Institute of Technology, and Stanford University.
Newman developed influential models and analytical frameworks in network theory such as the configuration model, modularity-based community detection, and measures of centrality that altered understanding of small-world networks, scale-free networks, and network resilience. He formalized methods connecting percolation theory and epidemic thresholds used by research groups working on SIR model, SIS model, and applied work at agencies like the Centers for Disease Control and Prevention and the World Health Organization. His work on community structure and modularity influenced algorithms used at Google, Facebook, and in studies by teams at Microsoft Research and IBM Research. Newman introduced statistical techniques linking maximum likelihood estimation to block models akin to those developed at Courant Institute and extended by researchers at Columbia University and Yale University.
Newman authored the textbook "Networks: An Introduction", which has been adopted by courses at Oxford University, Harvard University, Princeton University, and ETH Zurich. He published seminal papers in journals such as Physical Review Letters, Physical Review E, and Proceedings of the National Academy of Sciences, collaborating with coauthors from University of Michigan, Imperial College London, Santa Fe Institute, and Los Alamos National Laboratory. His review articles synthesizing findings from graph theory and statistical physics are frequently cited alongside works by Albert-László Barabási, Duncan Watts, and Réka Albert.
Newman's recognitions include the Erdős–Rényi Prize, the Dirac Medal (or comparable national medals), fellowship elections to societies such as the American Physical Society, the Royal Society, and membership in academies that include the Academia Europaea. He has received invited lectureships at venues like the International Congress of Mathematicians, Royal Institution, and named talks at conferences sponsored by SIAM and the European Physical Society.
He has supervised doctoral students and postdoctoral researchers who have pursued academic careers at institutions including MIT, Stanford University, University of California, Berkeley, Princeton University, and Cambridge University. Newman has organized summer schools and workshops drawing participants from Santa Fe Institute, Los Alamos National Laboratory, European Southern Observatory, and governmental research units like National Science Foundation-funded programs. He maintains outreach through public lectures at venues such as the Royal Institution and media interviews linking research to events covered by outlets like the New York Times, BBC, and Nature.
Newman has released datasets and code used for benchmarking community detection, centrality measures, and epidemic simulations, shared with repositories used by researchers at GitHub, Zenodo, and community databases like those curated by NetworkX developers and the Pajek project. His software and datasets are referenced by projects at Google Research, Microsoft Research, and academic groups across University College London and EPFL.
Category:Network scientists Category:British physicists