Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS

Counting (with) homomorphisms

Project description

Counting the hidden patterns in networks

Counting is at the heart of understanding complex systems. Recognizing and counting patterns in networks is crucial in science and technology. This applies in various fields, from network analysis and machine learning to probabilistic databases and statistical physics. The ERC-funded CountHom project aims to develop new mathematical tools to make counting less computationally demanding. It will link graph theory with computational complexity to simplify and unify difficult counting problems. The results could improve methods used in machine learning, network analysis and statistical physics, while also shedding light on some of computer science’s most fundamental theoretical questions.

Objective

This project addresses the computational complexity of counting problems in graphs; such problems ask to compute the number of certain structures rather than merely deciding their existence. Counting problems find applications in diverse areas like network analysis, machine learning, probabilistic databases, and statistical physics. They are linked to fundamental questions in complexity theory and give rise to algorithmic breakthroughs for decision problems.

The proposed project will go beyond the state of the art in computational counting by building bridges between algorithms/complexity and the mathematical theory of graph homomorphisms, which are structure-preserving maps between graphs. Already starting from the 1960s, Lovász and others showed that homomorphism numbers between graphs tie together disparate mathematical areas—similarly, the PI observed in the past 5 years that the computational problem of counting homomorphisms unifies a range of problems in computer science that were previously studied in isolation. This connection allows us to approach fundamental questions in parameterized and fine-grained complexity related to the complexity of counting small patterns in large graphs, which were out of reach for more combinatorial approaches. Secondly, it allows us to revisit problems in classical counting complexity from a new angle, especially for partition functions in discrete physical systems, with the aim of simplifying, unifying and extending known results. Thirdly, homomorphism counts give a surprising novel viewpoint on questions in algebraic complexity surrounding the “permanent versus determinant” problem, an algebraic variant of the “P versus NP” problem.

Fields of science (EuroSciVoc)

Keywords

Programme(s)

Topic(s)

Funding Scheme

HORIZON-ERC - HORIZON ERC Grants

See all projects funded under this funding scheme

Call for proposal

(opens in new window) ERC-2022-STG

See all projects funded under this call

Host institution

UNIVERSITAET REGENSBURG
Net EU contribution
€ 918 676,18
Address
UNIVERSITATSSTRASSE 31
93053 Regensburg
Germany
Region
Bayern Oberpfalz Regensburg, Kreisfreie Stadt
Activity type
Higher or Secondary Education Establishments
Links
Total cost
€ 918 676,18

Beneficiaries (2)