logo
ProjectForthcoming

Dynamics on and of Random Graphs

The status, timeline and source of this project. A free account opens every field.

Source: EU Funding & Tenders Portal

In the past 25 years, networks, such as social, economic and communication networks, have become society’s backbone and arteries. Remarkable insight into network structure has been derived using random graphs, and into network functionality using random processes living on them. This double randomness gives rise to deep and fascinating mathematical problems at the core of modern probability theory

Status
Prospective
Location
Netherlands
Updated
19 Nov 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Dynamics on and of 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

3 Q
The project “Dynamics on and of Random Graphs” is an infrastructure initiative, located in Netherlands. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Not available for this record.

Status

Original status

forthcoming

Taiyo status

Prospective

Taiyo last update

2026-11-19

Contact

Not available for this record.

Description

Description

In the past 25 years, networks, such as social, economic and communication networks, have become society’s backbone and arteries. Remarkable insight into network structure has been derived using random graphs, and into network functionality using random processes living on them. This double randomness gives rise to deep and fascinating mathematical problems at the core of modern probability theory. My focus in this proposal is on solving challenges around tipping points, or phase transitions, of random processes on random graphs. These challenges have so far resisted efforts, yet their solution is now feasible due to recent breakthroughs, including my own. My proposal embarks on the ambitious and timely endeavour to develop a novel transformative theory to determine the behaviour close to the phase transitions of paradigmatic processes on random graphs, with a focus on percolation and spin systems. The holy grail is to give a tangible and effective criterion when the random graph disorder is relevant or irrelevant for the process on it, i.e., when the behaviour is mean field. Throughout my proposal, percolative properties, describing how connectivity depends on model parameters, are a leitmotif. My innovative approach is to use dynamics of and on random graphs. Dynamics arise in three intertwined ways. (1) Key graph properties can be distilled by exploring the graph. (2) Phase transitions and their universality classes are key to understanding random processes on graphs. (3) Dynamic graphs change over time in a way that may depend on the process on them, a setting so-far hardly studied in mathematics. Despite the fact that these three forms of dynamics each have attracted ample attention, my approach leverages their effective combination, a key example being percolation on preferential attachment models. I am a leader worldwide in the mathematics of networks, and uniquely positioned to tackle the above challenges, whose solution will provide a major breakthrough.

Location

Country

Netherlands

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Article published date

2026-10-15

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