David Dobáš

Robotics Research Engineer @ UFB

ex-quant @ RSJ · ex-high school teacher

Papers

• 
  2026-05-29

  q-Exponential Random Graphs: higher-order networks from simple constraints

  David Dobáš, Diego Garlaschelli, Petr Jizba

  We introduce q-Exponential Random Graphs, a generalization of classical ERGs in which simple constraints can induce dependencies between edges. Unlike standard Shannon-based models, these ensembles can generate higher-order phenomena such as phase transitions, assortativity, and especially the coexistence of sparsity with clustering—a key feature of real-world networks. This provides a new framework for studying how correlations and dependencies shape complex network structure.

  arXiv|PDF|code