BEGIN:VCALENDAR
VERSION:2.0
PRODID:talks.ox.ac.uk
BEGIN:VEVENT
SUMMARY:Competing growth with reinforcement - Daniel Ahlberg (Stockholm Un
iversity)
DTSTART;VALUE=DATE-TIME:20231120T140000Z
DTEND;VALUE=DATE-TIME:20231120T150000Z
UID:https://new.talks.ox.ac.uk/talks/id/52c92b65-7865-43cc-9d49-dde7a51fdb
a9/
DESCRIPTION:We study a system of interacting urns where balls of different
colour/type compete for their survival\, and annihilate upon contact. We
shall consider the finite setting\, i.e. when the underlying graph is fini
te and connected. In this case it is known that coexistence is not possibl
e between two types. However\, for competition between three or more types
\, the possibility of coexistence depends on the underlying graph. We prov
e a conjecture stating that when the underlying graph is a cycle\, then th
e competition between three or more types has a single survivor almost sur
ely. As part of the proof we give a detailed description of an auto-annihi
lative process on the cycle\, which can be perceived as an expression of t
he geometry of a MÃ¶bius strip in a discrete setting. (Joint work with Car
olina Fransson.)\n\n\nSpeakers:\nDaniel Ahlberg (Stockholm University)
LOCATION:Mathematical Institute (L5)\, Woodstock Road OX2 6GG
TZID:Europe/London
URL:https://new.talks.ox.ac.uk/talks/id/52c92b65-7865-43cc-9d49-dde7a51fdb
a9/
BEGIN:VALARM
ACTION:display
DESCRIPTION:Talk:Competing growth with reinforcement - Daniel Ahlberg (Sto
ckholm University)
TRIGGER:-PT1H
END:VALARM
END:VEVENT
END:VCALENDAR