A Mathematical Journey Through Networks, Chemistry, fixation of popularity, and Machine Learning. Meditation on "what is the use?"
by
Fri, Sep 25, 2026
1 PM – 2 PM EDT (GMT-4)
Private Location (sign in to display)
79
Registered
Registration
Registration is now closed (this event already took place).
Details
Our story begins with the minimum spanning tree. Given a network of possible connections, each with a cost, how can we connect everything as cheaply as possible? This deceptively simple object also lies behind single-linkage clustering, a foundational method for finding structure in unlabeled data. But what does this tree look like when the network (number of data points) is enormous and random? Numerical experiments in statistical physics suggested a remarkable answer: across many different models, its large-scale shape should be universal.
Turning that prediction into rigorous mathematics led through places that initially seemed far removed from machine learning. We will encounter models of particles merging in colloidal chemistry, a beautiful random process called the multiplicative coalescent, Erdős’s leader problem—a model for the fixation of popularity in political group formation, and network models in which a small amount of choice can influence how groups form. Each detour supplied an essential piece of the original puzzle.
No technical background will be assumed. The broader message is personal: many of the most rewarding things I have discovered came from being genuinely curious about questions whose immediate “use” I could not yet see. The converse was often equally revealing: things I pursued purely because they seemed useful for a specific career goal often failed to lead anywhere interesting.
Food Provided
Hosted By
Co-hosted with: Mathematics, Applied Mathematics and Statistics