Networks
Research themes
5. Dynamics on networks
While random processes in static random structures are relatively well understood, their analysis in the dynamic setting is still in its infancy. Recently, progress has been made for reaction diffusion networks and for random walks in dynamic random environments. Sometimes, the dynamics alters the qualitative behavior, in other cases it does not. It is believed that local conservation laws in the dynamics play a crucial role, but very little is known to date.
The projects related to this theme are:
- Exploration of sparse networks through random rooted forests
- Game of Thieves as centrality measure on static and dynamic random graphs
- Understanding superspreading phenomena of epidemics on complex networks
- Statistical inverse problems for network dynamics
- Resource allocation in stochastic networks
- Parabolic Anderson Model on sparse random graphs
- Percolation and Random Walks on Preferential Attachment Models
- Modeling and Analysis of Optical Neural Networks across Photon Density Regimes
- Inverse based input estimation in stochastic networks
- Interacting particle systems on random graphs
- Extremal, algorithmic, and enumerative problems in graph theory
-
Emergence of heavy tails in stochastic networks
- Estimation of model primitives based on partial information
-
A new information theory perspective on network design in phylogenetics and beyond
- Fairness in Combinatorial Optimization
- Developments on the Configuration Model
- Voter model and coalescent random walks on random graphs
-
Multivariate extremes and networks