Campus Event Calendar
Event Entry
What and Who
Uniform sampling of graphs with a given degree sequence
Pieter Kleer
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 19 November 2019
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
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.
Contact
Stefano Leucci
--email hidden
passcode not visible
logged in users only
Stefano Leucci, 11/13/2019 10:03
Stefano Leucci, 11/07/2019 14:17
Stefano Leucci, 11/04/2019 11:13
Stefano Leucci, 11/04/2019 11:13 -- Created document.
Stefano Leucci, 11/07/2019 14:17
Stefano Leucci, 11/04/2019 11:13
Stefano Leucci, 11/04/2019 11:13 -- Created document.