H2020Индивидуална стипендия2018–2022

QuasiHyp · Quasi-random hypergraphs

„Хоризонт 2020“ — Действия „Мария Склодовска-Кюри“

Период: 2018-10-01 → 2022-04-18
Финансиране от ЕС: 239 861 €
Участници: 2
Схема: MSCA-IF

Линиите свързват координатора с партньорите.

Накратко на български

Математическите методи за анализ на големи мрежи, като социалните платформи или интернет рутерите, са в центъра на този проект. Те помагат за по-доброто разбиране на сложните системи и подобряват начините, по които компютрите намират правилни математически доказателства.

Този кратък обзор е генериран от изкуствен интелект

Кратко обяснение, генерирано от езиков модел по текста на CORDIS. Оригиналът е по-долу.

Резултати накратко

Quasi-random hypergraphs

This project aims to create novel mathematical methods that facilitate a better understanding of the properties of large networks. Large networks appear in many real-life situations such as the network of routers in the Internet, social networks like Facebook, Twitter and Linkedin, or protein-to-protein interactions inside a molecule. They can also be applied to many purely mathematical questions that, at first glance, seem completely unrelated. One of the important elements of this project will focus on providing novel ways that allow usage of computer in order to find formally correct justifications (mathematical proofs). Another important aspect of the project will revolve around randomness, which turns out to be extremely useful in various situations. In fact, for many mathematical problems involving decisions, we currently do not know anything that would perform even nearly as good as random choices do. This project aims to study ways that should improve such a situation and catch up with the randomness by being smart.

Текст от CORDIS, на английски · Данни: CORDIS, © Европейски съюз

Цел на проекта

This project concerns research on the frontier between discrete mathematics and computer science, and focuses on studying properties of randomly behaving discrete structures. Specifically, it studies quasi-random properties of k-uniform hypergraphs by using a combination of hypergraph regularity methods and flag algebras. The properties the project will be mainly focused on are containments and counting small substructures in large quasi-random hypergraphs. These questions are closely related to problems from other areas such as number theory, algorithm design, and property testing.

Оригинален текст от CORDIS (на английски).

Участници

UNIVERSITY OF HAMBURG · HamburgКоординаторГермания
EMORY UNIVERSITY NON PROFIT CORP · AtlantaСъединени щати