Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Uniform sampling of graphs with a given degree sequence
Speaker:Pieter Kleer
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, SWS
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 19 November 2019
Duration:30 Minutes
Building:E1 4
The (approximate) uniform sampling of graphs with a given degree sequence is an open problem that finds applications in, e.g., the analysis of social networks. The goal is to design an algorithm that, given a degree sequence, outputs every possible graphical realization of that degree sequence with approximately the same probability. In this talk I will provide some context for the problem, discuss some approaches to tackle it (with a focus on simple Markov chain Monte Carlo (MCMC) algorithms), and mention some generalizations/variations of the problem that I have recently worked on.

Based on joint work with Yorgos Amanatidis.

Name(s):Stefano Leucci
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • Stefano Leucci, 11/13/2019 10:03 AM
  • Stefano Leucci, 11/07/2019 02:17 PM
  • Stefano Leucci, 11/04/2019 11:13 AM
  • Stefano Leucci, 11/04/2019 11:13 AM -- Created document.