Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

RandomHypGra

Financiado

Cerrado

Concentration and threshold phenomena in random graphs and hypergraphs

The central theme of this proposal is the enumeration of large structures obeying a family of local constraints. There are numerous well-studied instances of this general problem in combinatorics, probability theory, and statisti... ver más

30/09/2027

TAU

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

TEL AVIV UNIVERSITY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2022-10-01

ERC-2021-COG: ERC CONSOLIDATOR GRANTS Scope:Objectives

I+D

Cerrada hace 3 años

0% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

Participantes

TAU

Lider

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

LASTING LArge STructures IN random Graphs 225K€ Cerrado

PROBCOMB Sparse Discrete Structures 119K€ Cerrado

CHROMPART Partition calculus on graphs digraphs and hypergraphs with... 225K€ Cerrado

HI-DIM COMBINATORICS High dimensional combinatorics 2M€ Cerrado

RANDSTRUCT Randomness and structure in combinatorics 1M€ Cerrado

SSiGraph Spanning Subgraphs in Graphs 1M€ Cerrado

Duración del proyecto: 59 meses Fecha Inicio: 2022-10-01
Fecha Fin: 2027-09-30

Líder del proyecto

TEL AVIV UNIVERSITY No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto The central theme of this proposal is the enumeration of large structures obeying a family of local constraints. There are numerous well-studied instances of this general problem in combinatorics, probability theory, and statistical physics. We propose to study a variety of interrelated open problems, spanning extremal and probabilistic combinatorics, Ramsey theory, and large deviation theory, whose unifying theme is the distribution of copies of a given graph in large random graphs.The first part of the proposal revolves around the 'infamous' upper tail problem for subgraph counts in random graphs, which has seen spectacular progress in the last few years. We propose to advance the combinatorial approach introduced in our recent work on a special case of the problem to solve this problem completely and make progress on several related questions.The second part of the proposal discusses the global structure of 'sparse' subsets in hypergraphs. We propose to prove a far-reaching generalisation of the hypergraph container theorem that provides a useful description of the family of all 'sparser-than-average' sets. We plan to use it to resolve the lower tail problem for subgraph counts in the uniform random graph and to prove a sparse analogue of the counting lemma for regular graphs.The third part of the proposal concerns the enumeration of independent sets in hypergraphs with cardinalities below the threshold for appearance of global structure. In order to obtain precise asymptotics for the number of such sets, we propose to extend the cluster expansion method from statistical physics to models with non-pairwise interactions.The fourth part of this proposal deals with thresholds for fundamental extremal and Ramsey properties of random graphs and hypergraphs. We propose to resolve several outstanding open problems in this area that have resisted the recent dramatic advances in the field.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores