<div class="csl-bib-body">
<div class="csl-entry">Drmota, M. (2024, July 29). <i>Pattern Counts in Random Planar Maps</i> [Conference Presentation]. Workshop on Randomness and Learning on Networks, Rio de Janeiro, Brazil. http://hdl.handle.net/20.500.12708/210985</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/210985
-
dc.description.abstract
Random planar maps have been studied from various aspects dur-
ing the last 15 or 20 years, including various limiting distributions
for several parameters of interest (such as the largest 2-connected
component) and local Benjamini-Schramm limits as well as scaling
limits. A pattern is a given planar map and we say that it ap-
pears in another map if it could be ”cut out” just leaving a face.
The simplest pattern is just an k-gons. It directly follows from the
Benjamini-Schramm limit that the expected number of occurences
of a given pattern is asympotically linear in the number of edges of
the random map. However, it seems to be a challenging problem
to provide a more precise limit law. The purpose of this talk is to
give a survey on the results and methods that have used so far in
order to settle this question. It is conjectured that there is always a
central limit theorem - and all results so far support this conjecture.
In particular in a recent joint work with Eva-Maria Hainzl and Nick
Wormald we prove a central limit theorem for patten with a simple
boundary.
en
dc.description.sponsorship
European Commission
-
dc.language.iso
en
-
dc.subject
Planar Maps
en
dc.title
Pattern Counts in Random Planar Maps
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.relation.grantno
101007705
-
dc.type.category
Conference Presentation
-
tuw.publication.invited
invited
-
tuw.project.title
Zufälligkeit und Lernen in Netzwerken
-
tuw.researchTopic.id
A3
-
tuw.researchTopic.name
Fundamental Mathematics Research
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E104-05 - Forschungsbereich Kombinatorik und Algorithmen
-
tuw.event.name
Workshop on Randomness and Learning on Networks
-
tuw.event.startdate
29-07-2024
-
tuw.event.enddate
02-08-2024
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Rio de Janeiro
-
tuw.event.country
BR
-
tuw.event.presenter
Drmota, Michael
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
5
-
wb.sciencebranch.value
95
-
item.languageiso639-1
en
-
item.openairetype
conference paper not in proceedings
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cp
-
crisitem.author.dept
E104 - Institut für Diskrete Mathematik und Geometrie
