Organizing Committee
 Zhongyang Li
University of Connecticut  Tom Roby
University of Connecticut  Mei Yin
University of Denver
Abstract
Limits of discrete random structures appear in different areas of probability, combinatorics, and machine learning. In statistical mechanics, probabilistic and combinatorial techniques are applied to rigorously describe the scaling limits of such random graphical models, which are closely related to phase transitions. In the vicinity of a phase transition, even a tiny change in some local parameter can result in dramatic changes in the macroscopic properties of the entire system. Random discrete structures are also useful mathematical models of large networks, which play a central role in our social and economic lives as the fabric over which we interact, form social connections, conduct economic transactions, transmit information, propagate disease, and much more.
The goal of this workshop is to integrate the algebraic combinatorics, probability, and machine learning paradigms of statistical mechanical models and to bring together researchers in related fields to discuss recent progress and new ideas.
Confirmed Speakers & Participants
Talks will be presented virtually or inperson as indicated in the schedule below.
 Speaker
 Poster Presenter
 Attendee
 Virtual Attendee

Kimberly Ayers
Cal State San Marcos

Cyril Banderier
Univ Paris 13

Bhaswar Bhattacharya
University of Pennsylvania

Charles Burnette
Xavier University of Louisiana

Jeremy Chizewer
University of Waterloo

Chris Coscia
Tufts University

Poly Hannah da Silva
Columbia University

Chinmay Dharmendra
University of Connecticut

EvaMaria Hainzl
TU Wien

pawel hitczenko
Drexel University

Jiaoyang Huang
University of Pennsylvania

Arash Jamshidpey
Columbia University

Richard Kenyon
Yale University

Zhongyang Li
University of Connecticut

Russell Lyons
Indiana University

Abram Magner
University at Albany, State University of New York

Olya Mandelshtam
University of Waterloo

Sumit Mukherjee
Columbia University

Rosa Orellana
Dartmouth College

Robin Pemantle
University of Pennsylvania

Huy Tuan Pham
Stanford University

Matthew Plante
University of Connecticut

Kavita Ramanan
Brown University

Rodrigo Ribeiro
University of Denver

Tom Roby
University of Connecticut

Haolin Shi
Yale University

martin tassy
Self employed

Peter Winkler
Dartmouth College

Christian Wolf
The City College of New York

Catherine Wolfram
MIT

Mei Yin
University of Denver
Workshop Schedule
Friday, September 29, 2023

8:30  8:50 am EDTCheck In11th Floor Collaborative Space

8:50  9:00 am EDTWelcome11th Floor Lecture Hall
 Brendan Hassett, ICERM/Brown University

9:00  9:45 am EDTFormulas for Macdonald polynomials via the multispecies exclusion and zero range processes11th Floor Lecture Hall
 Olya Mandelshtam, University of Waterloo
Abstract
We describe some recently discovered connections between onedimensional interacting particle models and Macdonald polynomials and show the combinatorial objects that make this connection explicit. The first such model is the multispecies asymmetric simple exclusion process (ASEP) on a ring, linked to the symmetric Macdonald polynomials P_\lambda through its partition function, with multiline queues as the corresponding combinatorial object. The second particle model is the multispecies totally asymmetric zero range process (TAZRP) on a ring, which was recently found to have an analogous connection to the modified Macdonald polynomial H_\lambda. The combinatorial objects interpolating between probabilities of the TAZRP and the modified Macdonald polynomials turn out to be tableaux with a queue inversion statistic. We explain the plethystic relationship between multiline queues and queue inversion tableaux, and along the way, derive a new formula for P_\lambda using the queue inversion statistic. This plethystic correspondence is closely related to fusion in the setting of integrable systems.

10:00  10:30 am EDTCoffee Break11th Floor Collaborative Space

10:30  11:15 am EDTDimers in 3D11th Floor Lecture Hall
 Catherine Wolfram, MIT
Abstract
A dimer tiling of Z^d is a collection of edges such that every vertex is covered exactly once. Given a compact region R in R^d, consider regions R_n in (1/n) Z^d which approximate R (and some boundary condition). What do random dimer tilings of R_n look like for large n? The 2D version of this question was answered by Cohn, Kenyon, and Propp in 2000. I will talk about how to answer this question in 3D. In both cases, it turns out that a random tiling of R_n is exponentially more likely to lie close to a fixed ""limit shape"" (and more generally, there is a large deviation principle, meaning the probability of lying close to any possible limiting configuration is given by a function called the ""rate function""). While the results are analogous, I will explain that the methods of proof are very different, because many of the key tools for studying dimers are special to two dimensions. This talk is based on https://arxiv.org/abs/2304.08468, which is joint work with Nishant Chandgotia and Scott Sheffield.

11:30 am  12:15 pm EDTDimer models and local systems11th Floor Lecture Hall
 Haolin Shi, Yale University
Abstract
The dimer model studies a natural probability measure on the space of perfect matching (""dimer covers"") of an edgeweighted graph; the probability of a dimer cover is proportional to the product of its edge weights. When the graph is bipartite, a useful change in viewpoint is to view the edge weights as defining a ""C∗ local system"", that is a line bundle with connection. This leads us to consider natural generalizations using higherrank bundles, in particular SLn local systems. We will talk about a collection of results with emphasis on calculating connection probabilities in double and triple dimer models.

12:25  12:30 pm EDTGroup Photo (Immediately After Talk)11th Floor Lecture Hall

12:30  2:30 pm EDTLunch/Free Time

2:30  3:15 pm EDTDiagram algebras11th Floor Lecture Hall
 Rosa Orellana, Dartmouth College
Abstract
One of the bestknown planar diagram algebras is the TemperleyLieb algebra. This algebra is defined combinatorially using nonintersecting matchings and can be realized as a centralizer of Lie algebras (or quantum groups) acting on tensor space. They have a wide range of applications, most notably to knot theory and statistical mechanics. The partition algebra is a generalization of the TemperleyLieb algebra which was proposed by Martin to study higher dimensional statistical models. In this talk I will discuss planar subalgebras of the partition algebras related to the TemperleyLieb algebra. This is joint work with N. Wallace and M. Zabrocki.

3:30  4:00 pm EDTCoffee Break11th Floor Collaborative Space

4:00  4:45 pm EDTRestricted permutations11th Floor Lecture Hall
 Richard Kenyon, Yale University
Abstract
We discuss large permutations with restricted permutation matrices, that is, whose permutation matrix has no 1s in some region. We give enumerative results and limit shapes.

5:00  6:30 pm EDTReception11th Floor Collaborative Space
Saturday, September 30, 2023

8:30  9:15 am EDTA Sanovtype theorem for Unimodular Marked Random Graphs, and its applications11th Floor Lecture Hall
 Kavita Ramanan, Brown University
Abstract
We establish a large deviation principle in a strong topology for the component empirical measure of several sequences of marked random graph models, including ErdosRenyi random graphs, random regular graphs, and more general configuration models. We show that the corresponding rate function is given by a relatively tractable formula involving the relative entropy functional. We also describe several applications of this result, such as Gibbs conditioning principles. This talk is based on joint work with IHsun Chen and Sarath Yasodharan.

9:30  10:15 am EDTPermutation limits (Permutons)11th Floor Lecture Hall
 Sumit Mukherjee, Columbia University
Abstract
Permutation limit theory arises by viewing a permutation as a probability measure on the unit square, and is motivated by dense graph limit theory. Using the theory of permutation limits (permutons), we can compute limiting properties of various permutation statistics for random permutations, such as number of fixed points, number of small cycles, pattern counts, and degree distribution of permutation graphs. We can also derive LDPs for random permutations. Our results apply to many non uniform distributions on permutations, including the the celebrated Mallows model, and murandom permutations. This is based on joint work with Bhaswar Bhattacharya, Jacopo Borga, Sayan Das and Peter Winkler.

10:30  11:00 am EDTCoffee Break11th Floor Collaborative Space

11:00  11:45 am EDTHigherOrder Graphon and Permuton Theories: Fluctuations, Inference, and Degeneracies11th Floor Lecture Hall
 Bhaswar Bhattacharya, University of Pennsylvania
Abstract
Motifs (patterns of subgraphs), such as edges and triangles, encode important structural information about the geometry of a network. Consequently, counting motifs in a large network is an important statistical and computational problem. In this talk we will consider the problem of estimating motif densities and fluctuations of subgraph counts in an inhomogeneous random graph sampled from a graphon. We will show that the limiting distributions of subgraph counts can be Gaussian or nonGaussian, depending on a notion of regularity of subgraphs with respect to the graphon. Using these results and a novel multiplier bootstrap for graphons, we will construct confidence intervals for the motif densities. We will also present parallel results for patterns in random permutations through the lens of permuton theory. Finally, we will discuss various structure theorems and open questions about degeneracies of the limiting distribution.

12:00  1:30 pm EDTLunch/Free Time

1:30  2:15 pm EDTInteractive workshop on planning a new active learning probability course for researchlevel students in mathadjacent fields.11th Floor Lecture Hall
 Robin Pemantle, University of Pennsylvania

2:30  3:00 pm EDTCoffee Break11th Floor Collaborative Space

3:00  4:00 pm EDT

4:00  5:00 pm EDTActive Learning Process11th Floor Lecture Hall
 Robin Pemantle, University of Pennsylvania
Abstract
The workshop will continue in an optional evening session, where we will make a plan for a course that fits the most populations of those attending the evening session. We will look over some existing materials, plan a shared materials archive, and discuss some of the more crucial mechanics of active classrooms.
Sunday, October 1, 2023

9:00  9:45 am EDTStrong characterization of the Airy line ensemble11th Floor Lecture Hall
 Jiaoyang Huang, University of Pennsylvania
Abstract
The Airy line ensemble was introduced by Prähofer and Spohn and is conjectured to describe the scaling limit of various random surfaces and stochastic growth models in the Kardar–Parisi–Zhang universality class. In this talk I will discuss a characterization result for Airy line ensembles, essentially indicating that if the top curve of a Brownian line ensemble is within a multiplicative 1+o(1) from a parabola, then it must be the Airy line ensemble (up to an affine shift). This is a joint work with Amol Aggarwal.

10:00  10:30 am EDTCoffee Break11th Floor Collaborative Space

10:30  11:15 am EDTStructures in random graphs: New connections11th Floor Lecture Hall
 Huy Tuan Pham, Stanford University
Abstract
The study of structures in large random graphs has been a central direction in probabilistic combinatorics. In this talk, I will survey several recent developments in this front with interesting connections. Certain important aspects in the study of structures in random graphs can be phrased in terms of thresholds — the density locations at which a structure emerges. In joint work with Jinyoung Park, building on connections to our resolution of a conjecture of Talagrand on the behavior of random linear programs under combinatorial constraints, we prove the longstanding KahnKalai conjecture, that thresholds of general monotone properties are closely predicted by expectation obstructions. The KahnKalai conjecture is a beautiful milestone towards the understanding of emergence of general structures, and yet to complete the quest, it remains to study these expectation obstructions. This latter task can prove to be highly challenging in several cases and bring in interesting connections to structural results. As an illustration, I will discuss joint work with Ashwin Sah, Mehtaab Sawhney and Michael Simkin on enumerating and determining the threshold of clique factors and bounded degree spanning trees in random subgraphs of graphs with high minimum degree. Our proof crucially builds on the regularity method and embedding techniques, which are seminal cornerstones of modern combinatorics. Switching from independent ErdosRenyi random graphs to structured ensembles with dependency introduces significant challenges. I will discuss this challenge in the context of random Cayley subgraphs of general groups. Given a fixed finite group, random Cayley graphs are constructed by choosing the generating set at random. These graphs thus reflect interesting symmetries and properties of the group, at the cost of inducing complex dependencies. I will discuss results on clique and independence numbers in random Cayley graphs of general groups, as well as progress towards a conjecture of Alon on Cayley graphs with small clique and independence number. These questions are naturally connected with some fundamental problems in additive combinatorics, which we address using both group theoretic and purely combinatorial perspectives. This is based on joint work with David Conlon, Jacob Fox and Liana Yepremyan.

11:30 am  12:15 pm EDTQuestions on Finite Graphs Motivated by Infinite Graphs11th Floor Lecture Hall
 Virtual Speaker
 Russell Lyons, Indiana University
Abstract
We discuss two questions for random walks on finite graphs that are motivated by an old conjecture of Benjamini, Schramm, and me and an old question of Fontes and Mathieu. These old questions concern random walks on infinite Cayley graphs, the first involving also percolation and the second involving random environments. We try to attack them via questions on finite graphs without any group structure.

12:30  2:30 pm EDTLunch/Free Time
All event times are listed in ICERM local time in Providence, RI (Eastern Daylight Time / UTC4).
All event times are listed in .
ICERM local time in Providence, RI is Eastern Daylight Time (UTC4). Would you like to switch back to ICERM time or choose a different custom timezone?
Request Reimbursement
This section is for general purposes only and does not indicate that all attendees receive funding. Please refer to your personalized invitation to review your offer.
 ORCID iD
 As this program is funded by the National Science Foundation (NSF), ICERM is required to collect your ORCID iD if you are receiving funding to attend this program. Be sure to add your ORCID iD to your Cube profile as soon as possible to avoid delaying your reimbursement.
 Acceptable Costs

 1 roundtrip between your home institute and ICERM
 Flights in economy class to either Providence airport (PVD) or Boston airport (BOS)
 Ground Transportation to and from airports and ICERM.
 Unacceptable Costs

 Flights on U.K. airlines
 Seats in economy plus, business class, or first class
 Change ticket fees of any kind
 Multiuse bus passes
 Meals or incidentals
 Advance Approval Required

 Personal car travel to ICERM from outside New England
 Multipledestination plane ticket; does not include layovers to reach ICERM
 Arriving or departing from ICERM more than a day before or day after the program
 Multiple trips to ICERM
 Rental car to/from ICERM
 Arriving or departing from airport other than PVD/BOS or home institution's local airport
 2 oneway plane tickets to create a roundtrip (often purchased from Expedia, Orbitz, etc.)
 Travel Maximum Contributions

 New England: $350
 Other contiguous US: $850
 Asia & Oceania: $2,000
 All other locations: $1,500
 Note these rates were updated in Spring 2023 and superseded any prior invitation rates. Any invitations without travel support will still not receive travel support.
 Reimbursement Requests

Request Reimbursement with Cube
Refer to the back of your ID badge for more information. Checklists are available at the front desk and in the Reimbursement section of Cube.
 Reimbursement Tips

 Scanned original receipts are required for all expenses
 Airfare receipt must show full itinerary and payment
 ICERM does not offer per diem or meal reimbursement
 Allowable mileage is reimbursed at prevailing IRS Business Rate and trip documented via pdf of Google Maps result
 Keep all documentation until you receive your reimbursement!
 Reimbursement Timing

6  8 weeks after all documentation is sent to ICERM. All reimbursement requests are reviewed by numerous central offices at Brown who may request additional documentation.
 Reimbursement Deadline

Submissions must be received within 30 days of ICERM departure to avoid applicable taxes. Submissions after thirty days will incur applicable taxes. No submissions are accepted more than six months after the program end.