Skip to main content
Weiter zur Homepage der Europäischen Kommission (öffnet in neuem Fenster)
Deutsch de
CORDIS - Forschungsergebnisse der EU
CORDIS

LArge STructures IN random Graphs

Projektbeschreibung

Den Zufall der Zufallsgraphen verstehen

Zufallsgraphen sind Graphen, bei denen bestimmte Eigenschaften wie Eckpunkte, Kanten und deren Verbindungen zufällig bestimmt werden. Sie finden in vielen Netzen der echten Welt Anwendung, zum Beispiel im Internet, Nahrungsnetzen, neuronalen Netzen, sozialen Netzwerken und Stromnetzen. Die Charakterisierung und das Verständnis davon, wie große Strukturen und Unterstrukturen in Zufallsgraphen gebildet werden, ist ein Thema von besonderem Interesse. Mit Unterstützung der Marie-Skłodowska-Curie-Maßnahmen untersucht das Projekt LASTING bedeutende Probleme im Bereich großer Strukturen in Zufallsgraphen.

Ziel

The study of random graphs lies in the interface between combinatorics, graph theory, and probability, and has a tremendous amount of applications in various fields such as networks, algorithms, physics, and life sciences. The aim of this project is to study large structures in random graphs, count their appearances and measure their strength.

In the first set of problems we aim to count the number of subgraphs from specific families in random graphs, where the families contain both large and small members. We consider families such as cycles, matchings, trees, and independent sets. In combinatorics, these types of problems are usually studied for families of equal-size members. We will combine advanced probabilistic ideas to solve these problems for families containing graphs of all possible sizes. This has strong connections to ideas from statistical physics.

In the second set of problems we investigate classical extremal graph theoretical problems in the context of random graphs. Roughly speaking, we start with a graph satisfying some property (either deterministically or typically), and we want to measure how many edges can be removed (either randomly or deterministically) until the property no longer holds. These types of problems are known as robustness, resilience, and Turan-type problems. Here we study these problems with respect to spanning structures.

The experienced researcher has made several advances to these problems and to closely related problems. For example, she solved robustness and Turan-type problems for almost-spanning cycles (with Krivelevich and Mond), and she approximately solved the counting problem of directed Hamilton cycles (With Ferber and Long). The supervisor, Prof. Keevash, is a world leading expert on the absorption method, a key tool to approach extremal problems when considering large structures. A combination between these ideas with new probabilistic and statistical-physics tools, will be the key ingredient in this research.

Wissenschaftliches Gebiet (EuroSciVoc)

Schlüsselbegriffe

Programm/Programme

Thema/Themen

Finanzierungsplan

MSCA-IF - Marie Skłodowska-Curie Individual Fellowships (IF)

Alle im Rahmen dieses Finanzierungsinstruments finanzierten Projekte anzeigen

Aufforderung zur Vorschlagseinreichung

(öffnet in neuem Fenster) H2020-MSCA-IF-2020

Alle im Rahmen dieser Aufforderung zur Einreichung von Vorschlägen finanzierten Projekte anzeigen

Koordinator

THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
Netto-EU-Beitrag
€ 224 933,76
Adresse
WELLINGTON SQUARE UNIVERSITY OFFICES
OX1 2JD Oxford
Vereinigtes Königreich
Region
South East (England) Berkshire, Buckinghamshire and Oxfordshire Oxfordshire
Aktivitätstyp
Higher or Secondary Education Establishments
Links
Gesamtkosten
€ 224 933,76