Skip to main content
Ir a la página de inicio de la Comisión Europea (se abrirá en una nueva ventana)
español es
CORDIS - Resultados de investigaciones de la UE
CORDIS

LArge STructures IN random Graphs

Descripción del proyecto

Controlar la aleatoriedad en grafos aleatorios

Los grafos aleatorios son grafos en los que ciertas propiedades —como los vértices, las aristas y las conexiones entre ellos— se determinan de forma aleatoria. Tienen muchas aplicaciones en redes del mundo real, incluida la web, las redes tróficas, las redes neuronales, las redes sociales y las redes eléctricas. Caracterizar y comprender la aparición de grandes estructuras y subestructuras en grafos aleatorios es un tema de especial interés. En el proyecto LASTING, que cuenta con el apoyo de las Acciones Marie Skłodowska-Curie, se están investigando problemas importantes en el ámbito de las grandes estructuras en grafos aleatorios.

Objetivo

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.

Ámbito científico (EuroSciVoc)

Palabras clave

Programa(s)

Tema(s)

Régimen de financiación

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

Ver todos los proyectos financiados en el marco de este régimen de financiación

Convocatoria de propuestas

(se abrirá en una nueva ventana) H2020-MSCA-IF-2020

Ver todos los proyectos financiados en el marco de esta convocatoria

Coordinador

THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
Aportación neta de la UEn
€ 224 933,76
Dirección
WELLINGTON SQUARE UNIVERSITY OFFICES
OX1 2JD Oxford
Reino Unido
Región
South East (England) Berkshire, Buckinghamshire and Oxfordshire Oxfordshire
Tipo de actividad
Higher or Secondary Education Establishments
Enlaces
Coste total
€ 224 933,76