Workshop
| Registration Deadline: | January 31, 2025 about 1 month from now |
|---|---|
| To apply for Funding you must register by: | October 27, 2024 about 2 months ago |
| Parent Program: | |
|---|---|
| Location: | SLMath: Eisenbud Auditorium, Atrium, Online/Virtual, Front Courtyard, 2nd Floor Deck |
Show List of Speakers
- David Aldous (University of California, Berkeley; University of Washington)
- Sarah Cannon (Claremont McKenna College)
- Catherine Greenhill (UNSW Sydney)
- Xiangying Huang (University of North Carolina)
- Tom Hutchcroft (California Institute of Technology)
- Svante Janson (Uppsala University)
- Lasse Leskela (Aalto University)
- Shuangping Li (Stanford University)
- Noela Muller (Technische Universiteit Eindhoven)
- Evita Nestoridi (Stony Brook University)
- Guillem Perarnau (Universitat Politècnica de Catalunya)
- Will Perkins (Georgia Institute of Technology)
- Kavita Ramanan (Brown University)
- Miklós Rácz (Northwestern University)
- Justin Salez (Université de Paris IX (Paris-Dauphine))
- Peter Winkler (Dartmouth College)
- Corrine Yap (Georgia Institute of Technology)
Visualization of a network constructed using simple probabilistic rules, showing the emergence of hubs and other macroscopic network phenomenon. From https://graph-tool.skewed.de
Networks, graph driven algorithms, and dynamics on graphs such as epidemics, random walks and centrality measures all play a major role, both in our daily lives as well as many scientific and engineering disciplines. This introductory workshop will bring together experts and junior researchers in combinatorics, probability, and statistics to share a broad vision of major challenges and objectives, with a primary focus on models of random graphs and their limits, network inference, dynamic processes on networks and algorithms and optimization on random structures.
Download a workshop flyer to share with your colleagues, department, or networks
Keywords and Mathematics Subject Classification (MSC)
Tags/Keywords
Network models and random graphs
statistcal learning and network inference
counting and sampling discrete structures
dynamics on networks
probabilistic analysis of network algorithms
Show Funding
To apply for funding, you must register by the funding application deadline displayed above.
Students, recent PhDs, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.
Show Lodging
For information about recommended hotels for visits of under 30 days, visit Short-Term Housing. Questions? Contact coord@slmath.org.