George Cantwell
Assistant Professor
Department of Engineering
University of Cambridge
gtc31@cam.ac.uk

I study networks, statistics, algorithms, physics, and behavior. I received a PhD in Physics from the University of Michigan and then completed a postdoctoral fellowship at the Santa Fe Institute. You can also find me on Google scholar.

If you are interested in doing a PhD at Cambridge and you would like to work with me, please feel free to contact me before applying.

Papers
  1. Valence and interactions in judicial voting
    Edward D. Lee and George T. Cantwell
    Phil. Trans. R. Soc. A, 382:20230140 (2024) [code]
  2. Heterogeneous message passing for heterogeneous networks
    George T. Cantwell, Alec Kirkley, and Filippo Radicchi
    Phys. Rev. E 108, 034310 (2023) [code] [arXiv]
  3. Approximate sampling and estimation of partition functions using neural networks
    George T. Cantwell
    arXiv preprint (2022) [code]
  4. Belief propagation for permutations, rankings, and partial orders
    George T. Cantwell and Cristopher Moore
    Phys. Rev. E 105, L052303 (2022) [code] [arXiv]
  5. The friendship paradox in real and model networks
    George T. Cantwell, Alec Kirkley, and M. E. J. Newman
    Journal of Complex Networks 9(2), cnab011 (2021) [arXiv]
  6. Belief propagation for networks with loops
    Alec Kirkley*, George T. Cantwell*, and M. E. J. Newman
    Science Advances 7(17), eabf1211 (2021) [arXiv]
  7. Bayesian inference of network structure from unreliable data
    Jean-Gabriel Young, George T. Cantwell, and M. E. J. Newman
    Journal of Complex Networks 8(6), cnaa046 (2021) [code] [arXiv]
  8. Inference, Model Selection, and the Combinatorics of Growing Trees
    George T. Cantwell, Guillaume St-Onge, and Jean-Gabriel Young
    Phys. Rev. Lett. 126, 038301 (2021) [code] [arXiv]
  9. Thresholding normally distributed data creates complex networks
    George T. Cantwell*, Yanchen Liu, Benjamin F. Maier*, Alice C. Schwarze, Carlos A. Serván, Jordan Snyder, and Guillaume St-Onge
    Phys. Rev. E 101, 062302 (2020) [code] [arXiv]
  10. Improved mutual information measure for clustering, classification, and community detection
    M. E. J. Newman, George T. Cantwell, and Jean-Gabriel Young
    Phys. Rev. E 101, 042304 (2020) [code] [arXiv]
  11. Message passing on networks with loops
    George T. Cantwell and M. E. J. Newman
    Proc. Natl. Acad. Sci. U.S.A. 116, 23398-23403 (2019) [code] [arXiv]
  12. Mixing patterns and individual differences in networks
    George T. Cantwell and M. E. J. Newman
    Phys. Rev. E 99, 042306 (2019) [code] [arXiv]
  13. Balance in signed networks
    Alec Kirkley, George T. Cantwell, and M. E. J. Newman
    Phys. Rev. E 99, 012320 (2019) [arXiv]
  14. Efficient method for estimating the number of communities in a network
     Maria A. Riolo, George T. Cantwell, Gesine Reinert, and M. E. J. Newman
    Phys. Rev. E 96, 032310 (2017) [code] [arXiv]
  15. Perceptual category learning and visual processing: an exercise in computational cognitive neuroscience
    George Cantwell, Maximilian Riesenhuber, Jessica L. Roeder, and F. Gregory Ashby
    Neural Netw. 89: 31–38. (2017) [pdf]
  16. Multiple stages of learning in perceptual categorization: evidence and neurocomputational theory
    George Cantwell, Matthew J. Crossley, and F. Gregory Ashby
    Psychon. Bull. Rev. 22: 1598-1613 (2015) [pdf]

* denotes equal contribution

Thesis