logo
ProjectOngoing

Universality in phase transitions in random graphs

One of 5,541 projects Taiyo tracks in Netherlands.

Source: EU Funding & Tenders Portal

GraPhTra aims to advance the rigorous theoretical understanding of phase transitions in random graphs and their universal properties, driven by questions in neuromorphic computing, physics, and epidemiology. We will work on three work packages. -We introduce a new model for random graphs, that are sampled with local energy considerations, inspired by statistical physics and motivated by material s

Status
Under Construction
Sector
Government
Location
Netherlands
Updated
22 Jul 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Universality in phase transitions in random graphs

Pick a question to edit it, or write your own.

First answer free · no account

I am a

Project Information FAQ

Project Information

4 Q
The project “Universality in phase transitions in random graphs” is an infrastructure initiative in the Government sector, located in Netherlands. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Sponsoring Agency

Status

Original status

ongoing

Taiyo status

Under Construction

Taiyo last update

2026-07-22

Contact

Not available for this record.

Description

Description

GraPhTra aims to advance the rigorous theoretical understanding of phase transitions in random graphs and their universal properties, driven by questions in neuromorphic computing, physics, and epidemiology. We will work on three work packages. -We introduce a new model for random graphs, that are sampled with local energy considerations, inspired by statistical physics and motivated by material science for neuromorphic computing. We use a Gibbs measure to sample a spanning tree of a graph, and by varying the temperature we thus interpolate between the uniform spanning tree and the minimal spanning tree. We demonstrate that the global structure of Gibbsian trees (in the Gromov-Hausdorff-Prokhorov topology) exhibits a phase transition that is universal across various underlying graphs. -We find conditions under which the position of the percolation phase transition on random unimodular graphs can be reliably estimated using local information. On the way, we resolve a key conjecture on the limiting threshold for Poisson–Voronoi percolation in hyperbolic space as the density of points goes to 0. -We prove that the spatial random graph models ‘long-range percolation’ and ‘scale-free percolation’ possess a phase where neighbourhoods grow exponentially, ensuring a well-defined reproductive number for spatial SIR (Susceptible → Infected → Recovered) epidemics, answering a long-standing open question.

Location

Country

Netherlands

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Government

Article published date

2026-01-01

More on this project

Research

Free account

View all details

You are reading the public part. A free account opens the rest:

  • Every detail on this project
  • News and media coverage
  • Technical research
View all details

Free account · no card · lands you back on this project