BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Percolation
DTSTART;VALUE=DATE-TIME:20200306T151500Z
DTEND;VALUE=DATE-TIME:20200306T160000Z
DTSTAMP;VALUE=DATE-TIME:20200928T062829Z
UID:indico-contribution-699-1134@indico.uu.se
DESCRIPTION:Speakers: Johanna Strömberg (Uppsala University)\nPercolation
studies the behaviour of clusters in random graphs. It has applications t
o modeling phenomena as diverse as magnetism\, spread of infectious diseas
es\, and the adaption of new technologies in society. This talk will give
a brief overview of the theory of percolation\, starting from the celebra
ted Harris-Kesten theorem on percolation in the square lattice in two dime
nsions. We will in particular consider tools used to study percolation in
random geometric graphs and the configuration model. Finally\, we will co
nsider what new questions arise when we drop the independence requirement
from the standard percolation process.\n\nhttps://indico.uu.se/event/699/c
ontributions/1134/
LOCATION:Ångströmslaboratoriet 4001
URL:https://indico.uu.se/event/699/contributions/1134/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ramified covers and root stacks
DTSTART;VALUE=DATE-TIME:20200306T084500Z
DTEND;VALUE=DATE-TIME:20200306T093000Z
DTSTAMP;VALUE=DATE-TIME:20200928T062829Z
UID:indico-contribution-699-1129@indico.uu.se
DESCRIPTION:Speakers: Eric Ahlqvist (KTH)\nA ramified cover X of a surface
S gives rise to ramification data in the following sense: the locus in S
over which X is ramified will look like a union of curves and to each curv
e we associate the corresponding ramification index. Conversely\, given a
finite number of curves in S intersecting only transversely\, and a posit
ive integer for each curve\, we may ask when such data comes from a ramifi
ed cover. We will explain how to give a criteria for when this is the case
\, using root stacks.\n\nhttps://indico.uu.se/event/699/contributions/1129
/
LOCATION:Ångströmslaboratoriet 4001
URL:https://indico.uu.se/event/699/contributions/1129/
END:VEVENT
BEGIN:VEVENT
SUMMARY:The Gaussian free field: local sets and their dimensions
DTSTART;VALUE=DATE-TIME:20200306T141500Z
DTEND;VALUE=DATE-TIME:20200306T150000Z
DTSTAMP;VALUE=DATE-TIME:20200928T062829Z
UID:indico-contribution-699-1133@indico.uu.se
DESCRIPTION:Speakers: Lukas Kristiansson Schoug (KTH)\nThe two-dimensional
Gaussian free field is the canonical model for a random surface and is im
portant in many different areas of mathematics and physics. It is the two-
dimensional time analog of Brownian motion and enjoys many similar propert
ies\, such as a certain domain Markov property and local sets\, i.e.\, hig
her-dimensional versions of stopping times. In this talk\, we introduce th
ese notions\, with the Brownian motion in mind\, and discuss the propertie
s of these random sets as well as briefly describe how to compute the dime
nsions of a certain class of local sets. The talk is based on joint work w
ith Avelio Sepúlveda and Fredrik Viklund.\n\nhttps://indico.uu.se/event/6
99/contributions/1133/
LOCATION:Ångströmslaboratoriet 4001
URL:https://indico.uu.se/event/699/contributions/1133/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Strategic ability\, information and memory
DTSTART;VALUE=DATE-TIME:20200306T120000Z
DTEND;VALUE=DATE-TIME:20200306T124500Z
DTSTAMP;VALUE=DATE-TIME:20200928T062829Z
UID:indico-contribution-699-1132@indico.uu.se
DESCRIPTION:Speakers: Daniel Ahlsén (Stockholm University)\nA typical gam
e theoretic question is this: given some set of information and available
memory\, what conditions can an agent force? This talk will tackle the con
verse: given a class of conditions\, what information and memory does an a
gent need to force the conditions? Specifically\, I present the logic ATL*
for reasoning about strategic ability in a multi-agent settings\, and sho
w that for certain fragments of ATL*\, one can restrict the information av
ailable to agents without limiting their strategic abilities.\n\nhttps://i
ndico.uu.se/event/699/contributions/1132/
LOCATION:Ångströmslaboratoriet 4001
URL:https://indico.uu.se/event/699/contributions/1132/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Introduction to homological mirror symmetry and the Fukaya categor
y
DTSTART;VALUE=DATE-TIME:20200306T094500Z
DTEND;VALUE=DATE-TIME:20200306T103000Z
DTSTAMP;VALUE=DATE-TIME:20200928T062829Z
UID:indico-contribution-699-1131@indico.uu.se
DESCRIPTION:Speakers: Johan Asplund (Uppsala University)\nHomological mirr
or symmetry is a deep mathematical conjecture\nproposed by Maxim Kontsevic
h at the 1994 ICM in Zürich\, and it is about\na certain relationship bet
ween the two mathematical areas of symplectic\ngeometry and algebraic geom
etry. More precisely\, the conjecture states\nthat there is a derived equi
valence between the so-called Fukaya\ncategory in symplectic geometry\, an
d the category of coherent sheaves\nwhich is well-studied in the field of
algebraic geometry. The conjecture\nis an attempt at understanding mirror
symmetry in string theory which is\nwell-known by physicists.\n\nIn this t
alk I will first go through history and origins of the\nconjecture. After
that\, an introduction to symplectic geometry will be\ngiven and the goal
will be to give the audience a feeling of what the\nFukaya category is.\n\
nhttps://indico.uu.se/event/699/contributions/1131/
LOCATION:Ångströmslaboratoriet 4001
URL:https://indico.uu.se/event/699/contributions/1131/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Importance sampling and weak convergence in population genetics
DTSTART;VALUE=DATE-TIME:20200306T130000Z
DTEND;VALUE=DATE-TIME:20200306T134500Z
DTSTAMP;VALUE=DATE-TIME:20200928T062829Z
UID:indico-contribution-699-1130@indico.uu.se
DESCRIPTION:Speakers: Martina Favero (KTH)\nImportance sampling algorithms
are used in population genetics to estimate small probabilities of gene c
onfigurations. In order to prove the efficiency of these algorithms\, i
t is necessary to determine the asymptotic behaviour of the sampling proba
bilities. As a first step in this direction\, we show weak convergence for
a sequence of coalescent processes and the corresponding mutation proces
ses\, as the sample size goes to infinity. Time is scaled and convergence
of semigroups is proved. The limiting process consists of a deterministic
part and of conditionally independent Poisson processes with varying inten
sity. This is a work in progress with H.Hult (KTH).\n\nhttps://indico.u
u.se/event/699/contributions/1130/
LOCATION:Ångströmslaboratoriet 4001
URL:https://indico.uu.se/event/699/contributions/1130/
END:VEVENT
END:VCALENDAR