Campus Event Calendar: Xavier Pérez Giménez (07/23/2012 in E1 4/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Asymptotic enumeration of sparse strongly connected digraphs by vertices and edges

Xavier Pérez Giménez

Max-Planck-Institut für Informatik - D1

AG1 Mittagsseminar (own work)

AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Monday, 23 July 2012

13:00

30 Minutes

E1 4

024

Saarbrücken

Abstract

I shall survey several related asymptotic enumeration problems concerning certain types of connected sparse graphs with a given number of vertices and edges, and discuss some of the probabilistic techniques that are usually applied in these settings. In particular, I shall present our asymptotic formula for the number of strongly connected sparse digraphs with n vertices and m arcs.

Contact

Carola Winzen

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Carola Winzen, 07/16/2012 14:00 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis