The Largest Common Subtree of Uniform Attachment Trees

Explore a comprehensive workshop on Randomness and Learning on Networks featuring a lecture by Miklos Rácz on "The largest common subtree of uniform attachment trees." Delve into a week-long program packed with plenary talks by leading experts, contributed presentations, and minicourses on discrete Probability and Statistics for networks. Engage in open problem sessions and collaborative work opportunities. Gain insights from renowned speakers including Cynthia Rush, David Gamarnik, Luc Devroye, Michael Drmota, and Simon Griffiths on topics ranging from high-dimensional model selection to Ramsey Numbers. Participate in minicourses led by Dieter Mitsche on discrete random models and Keith Levin on statistical network analysis. Hosted by the Instituto de Matemática Pura e Aplicada, this event offers a unique opportunity for researchers and students to advance their knowledge in the field of randomness and network learning.