Alexander Strang
Assistant Teaching Professor
The University of California Berkeley, Department of Statistics
Evans Hall 305, University Dr,
Berkeley, CA 94720, United States
Email: alexstrang@berkeley.edu
Bio
Alex Strang is an assistant professor in Statistics and Data Science at UC Berkeley. He served as a postdoctoral instructor in computational and applied mathematics at the University of Chicago from 2020 to 2023. He received his PhD in applied math from Case Western Reserve University in 2020.
Alex studies the structures of networks that arise in a variety of disciplines including biophysics, ecology, neuroscience, and in competitive systems. In each field, he seeks to understand the interplay between structure and dynamics. He is particularly interested in random walks on networks associated with biophysical processes occurring at the molecular scale. He also works on networks that represent competing agents who evolve according to a training protocol. He draws on tools from discrete topology, non-equilibrium thermodynamics, and functional form game theory to study the interplay of structure and dynamics in these systems.
He also works on Bayesian inference and sparsity promotion via hierarchical hyperpriors. His work here has focused on coordinate ascent methods for MAP estimation, the sensitivity of estimators (and the effective regularizer) to changes in hyperparameters, and variational methods for estimating confidence intervals.
Latest Publication
Similarity Suppresses Cyclicity: Why Similar Competitors Form Hierarchies
Hierarchies are extremely common in competitive systems, yet most randomly drawn competitive systems are highly cyclic. We show that, provided the relation between agent attribute and agent performance is smooth, then ensembles of similar competitors necessarily form hierarchies, and analyze convergence rates to hierarchy as a function of similarity.
Alexander Strang
Evans Hall 305, University Dr.
Berkeley, CA 94720, United States