The scaling limit of critical random graphs

Nicolas Broutin, Ralph Neininger, Henning Sulzbach

Description

The scaling limit of critical random graphs L. Addario–Berry 1 N. Broutin 2 C. Goldschmidt 3 1Department of Mathematics and Statistics McGill University 2Projet Algorithms INRIA Paris-Rocquencourt 3Department of Statistics University of Warwick April 5, 2011 The scaling limit of critical random graphs 1 / 31

• critical random


• projet algorithms


• paris rocquencourt


• connected components


• sn1 ≥


• branching processes


• fixed snk

Sujets

• Connected component
• Branching process

Informations

• Publié par: profil-urra-2012
• Nombre de lectures: 13
• Langue: English

Extrait

Partial match queries: a

Nicolas Broutin

Partial match queries: a limit process

Ralph Neininger

limit process

Henning Sulzbach

1 /

19

BackortntcuduorgI/dnnio queries:ialmatchaPtr

Data structures/Algorithms I Analysis of costs/running times in natural conditions I expected cost I performance guarantee provided by concentration

Methodology I complex “objects” that decompose recursively (tree like, or related) I general approach for convergence using contractions

91/2ssecorptimila

Partial

Searching

2

1

match queries:

a

limit

geometric

process

4

3

data

and

quadtrees

3

/

19