• State Polytopes of Combinatorial Neural Codes (Rob Davis, HMC)

    Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

    Combinatorial neural codes are 0/1 vectors that are used to model the co-firing patterns of a set of place cells in the brain. One wide-open problem in this area is […]

  • Great Expectations (Matthew Junge, Duke Univ.)

    Argue Auditorium, Pomona College 610 N. College Ave., Claremont, CA, United States

    The mean of a random quantity is supposed to confirm our expectations. What happens when it defies them? We will look at a few famous expected values; some old, some […]

  • Isometric Circle Actions (Catherline Searle, Wichita State)

    Argue Auditorium, Pomona College 610 N. College Ave., Claremont, CA, United States

    I will begin by describing a number of important examples of isometric actions of circles in Euclidean space and their restrictions to subspaces of Euclidean space. The goal of the talk will […]

  • Minimal Gaussian Partitions, Clustering Hardness and Voting (Steven Heilman, USC)

    Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, California

    A single soap bubble has a spherical shape since it minimizes its surface area subject to a fixed enclosed volume of air.  When two soap bubbles collide, they form a "double-bubble" composed of three spherical caps.  The double-bubble minimizes total surface area among all sets enclosing two fixed volumes.  This was proven mathematically in a […]

  • GEMS Workshop: Exploring the fascinating world of prime numbers, Part I with Professor Adolfo Rumbos, from Pomona College.

    Shanahan 1480, Harvey Mudd College 301 Platt Blvd., Claremont, CA, United States

    TOPIC: Exploring the fascinating world of prime numbers, Part I The study of patterns in the sequence of prime numbers has fascinated mathematicians for centuries.  Are there formulas that generate prime numbers?  Are there patterns in the distribution of prime numbers and the distribution of gaps between consecutive primes?  In this series of two workshops, beginning […]

    Free
  • CFTP: the algorithm ERGM deserves, but not the one it needs right now (Matt Moores, University of Wollongong)

    Emmy Noether Room, Millikan 1021, Pomona College 610 N. College Ave., Claremont, California

    The exchange algorithm enables Bayesian posterior inference for models with intractable likelihoods, such as Ising, Potts, or exponential random graph models (ERGM). Crucially, this algorithm relies on an auxiliary Markov chain to obtain an unbiased sample from the generative distribution of the model.             It was originally proposed to use coupling from the past (CFTP) for […]

  • Turning probability into polynomials (Mark Huber, CMC)

    Millikan 2099, Pomona College 610 N. College Ave., Claremont, CA, United States

    Moment generating functions (Laplace transforms) are a means for transforming probability problems into problems involving polynomials.  Here I will concentrate on the binomial distribution, and use the mgf to link […]