|Registration Deadline:||January 31, 2025 about 1 year from now|
|To apply for Funding you must register by:||October 27, 2024 11 months from now|
|Location:||SLMath: Eisenbud Auditorium, Atrium, Online/Virtual, Front Courtyard, 2nd Floor Deck|
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.Show less
Network models and random graphs
statistcal learning and network inference
counting and sampling discrete structures
dynamics on networks
probabilistic analysis of network algorithms
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.