Skip to main content
Vai all'homepage della Commissione europea (si apre in una nuova finestra)
italiano it
CORDIS - Risultati della ricerca dell’UE
CORDIS

LArge STructures IN random Graphs

Descrizione del progetto

Riuscire a gestire la casualità nei grafici casuali

I grafici casuali sono grafici per cui determinate proprietà, tra cui vertici, spigoli e le connessioni tra tali elementi, vengono determinate in qualche tipo di modo casuale. Essi hanno molte applicazioni nelle reti del mondo reale, tra cui il World Wide Web, reti alimentari, reti neurali, reti sociali e reti elettriche. La caratterizzazione e la comprensione della comparsa di grandi strutture e sottostrutture nei grafici casuali è un tema che riveste un particolare interesse. Con il sostegno del programma di azioni Marie Skłodowska-Curie, il progetto LASTING sta approfondendo importanti problemi nel campo delle strutture di grandi dimensioni nei grafici casuali.

Obiettivo

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.

Campo scientifico (EuroSciVoc)

Parole chiave

Programma(i)

Argomento(i)

Meccanismo di finanziamento

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

Vedi tutti i progetti finanziati nell’ambito di questo schema di finanziamento

Invito a presentare proposte

(si apre in una nuova finestra) H2020-MSCA-IF-2020

Vedi tutti i progetti finanziati nell’ambito del bando

Coordinatore

THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
Contributo netto dell'UE
€ 224 933,76
Indirizzo
WELLINGTON SQUARE UNIVERSITY OFFICES
OX1 2JD Oxford
Regno Unito
Regione
South East (England) Berkshire, Buckinghamshire and Oxfordshire Oxfordshire
Tipo di attività
Higher or Secondary Education Establishments
Collegamenti
Costo totale
€ 224 933,76