YoVDO

The Largest Common Subtree of Uniform Attachment Trees

Offered By: Instituto de Matemática Pura e Aplicada via YouTube

Tags

Network Analysis Courses Combinatorics Courses Graph Theory Courses Algorithms Courses Probability Theory Courses Statistical Physics Courses Random Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Workshop on Randomness and Learning on Networks - Miklos Rácz


Taught by

Instituto de Matemática Pura e Aplicada

Related Courses

Introduction to Statistics: Probability
University of California, Berkeley via edX
Aléatoire : une introduction aux probabilités - Partie 1
École Polytechnique via Coursera
Einführung in die Wahrscheinlichkeitstheorie
Johannes Gutenberg University Mainz via iversity
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera
Probability
University of Pennsylvania via Coursera