NETWORKS Doctoral Program

Información del proyecto

NETWORKS

Identificador del acuerdo de subvención: 945045

DOI

10.3030/945045

Proyecto cerrado

Fecha de la firma de la CE 26 Marzo 2020

Fecha de inicio 1 Septiembre 2020

Fecha de finalización 28 Febrero 2026

Financiado con arreglo a

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Coste total

€ 3 037 440,00

Aportación de la UE

€ 1 518 720,00

Coordinado por

TECHNISCHE UNIVERSITEIT EINDHOVEN
Netherlands

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Resultado final

Other (2)

2nd Call: Communication Link to Euraxess

D34 Link to Euraxess website for 2nd call for proposals Inform the Project Officer on publishing each call for proposals by sending the link to the Euraxess website and a screen shot of the related call announcement

1st Call: Communication Link to Euraxess

D3.3 Link to Euraxess website for 1st call for proposals - Inform the Project Officer on publishing each call for proposals, by sending the link to the Euraxess website and a screen shot of the related call announcement.

Publicaciones

Peer reviewed articles (30)

Trajectories and Platoon-forming Algorithm for Intersections with Heterogeneous Autonomous Traffic

Autores: Purva Joshi, Marko Boon, Sem Borst
Publicado en: ACM Journal on Autonomous Transportation Systems, Edición 2, 2025, Página(s) 1-32, ISSN 2833-0528
Editor: Association for Computing Machinery (ACM)
DOI: 10.1145/3701042

The rank of sparse symmetric matrices over arbitrary fields

Autores: Remco van der Hofstad, Noela Müller, Haodong Zhu
Publicado en: Random Structures & Algorithms, Edición 66, 2025, Página(s) 66, ISSN 1042-9832
Editor: John Wiley & Sons Inc.
DOI: 10.1002/rsa.21258

Trusting: Alone and together

Autores: Benedikt V. Meylahn, Arnoud V. Den Boer, Michel Mandjes
Publicado en: The Journal of Mathematical Sociology, Edición 48, 2024, Página(s) 424-478, ISSN 0022-250X
Editor: Taylor & Francis
DOI: 10.1080/0022250x.2024.2340135

On queens and tours

Autores: Pieter Jacobs, Andrés López Martínez, Frits Spieksma
Publicado en: Operations Research Letters, Edición 61, 2025, Página(s) 107283, ISSN 0167-6377
Editor: Elsevier BV
DOI: 10.1016/j.orl.2025.107283

Accurate and efficient approximation of large-scale appointment schedules

Autores: R. Bekker, B. Bharti, M. Mandjes
Publicado en: Stochastic Models, Edición 41, 2025, Página(s) 528-556, ISSN 1532-6349
Editor: Marcel Dekker Inc.
DOI: 10.1080/15326349.2025.2455750

Efficient Autonomous Intersection Access Control with Turning Traffic

Autores: Purva Joshi, Marko A.A. Boon, Sem C. Borst
Publicado en: IFAC-PapersOnLine, Edición 59, 2025, Página(s) 97-102, ISSN 2405-8963
Editor: Elsevier BV
DOI: 10.1016/j.ifacol.2025.07.088

Using diversity for optimizing cycle time for a pick-and-place machine

Autores: Mark de Berg, Ugnė Laima Čižiūtė, Dirk Gerrits, Andrés López Martínez, Frits Spieksma
Publicado en: Flexible Services and Manufacturing Journal, 2026, ISSN 1936-6582
Editor: Springer Pub. Co.,
DOI: 10.1007/s10696-026-09660-x

Trust in society: A stochastic compartmental model

Autores: Benedikt V. Meylahn, Koen De Turck, Michel Mandjes
Publicado en: Physica A: Statistical Mechanics and its Applications, Edición 668, 2025, Página(s) 130563, ISSN 0378-4371
Editor: Elsevier BV
DOI: 10.1016/j.physa.2025.130563

Interpersonal trust: Asymptotic analysis of a stochastic coordination game with multi-agent learning

Autores: Benedikt V. Meylahn, Arnoud V. den Boer, Michel Mandjes
Publicado en: Chaos: An Interdisciplinary Journal of Nonlinear Science, Edición 34, 2025, ISSN 1054-1500
Editor: American Institute of Physics
DOI: 10.1063/5.0205136

Orthogonal schedules in single round robin tournaments

Autores: Roel Lambers, Jop Briët, Viresh Patel, Frits Spieksma, Mehmet Akif Yıldız
Publicado en: Operations Research Letters, Edición 51, 2025, Página(s) 528-532, ISSN 0167-6377
Editor: Elsevier BV
DOI: 10.1016/j.orl.2023.08.002

Stable and Dynamic Minimum Cuts

Autores: Andres Lopez Martinez, Mark De Berg, Frits Spieksma
Publicado en: Journal of Graph Algorithms and Applications, Edición 30, 2026, Página(s) 89-107, ISSN 1526-1719
Editor: Brown University
DOI: 10.7155/jgaa.v30i1.2998

Path decompositions of oriented graphs

Autores: Viresh Patel, Mehmet Akif Yıldız
Publicado en: European Journal of Combinatorics, Edición 134, 2026, Página(s) 104346, ISSN 0195-6698
Editor: Academic Press
DOI: 10.1016/j.ejc.2026.104346

Optimal service and switching strategies for polling systems

Autores: Purva Joshi, Marko A.A. Boon, Erik M.M. Winands
Publicado en: ACM SIGMETRICS Performance Evaluation Review, Edición 53, 2026, Página(s) 62-66, ISSN 0163-5999
Editor: Association for Computing Machinery (ACM)
DOI: 10.1145/3797823.3797846

Appointment Scheduling for Parallel Queues

Autores: R. Bekker, B. Bharti, M. Mandjes
Publicado en: Methodology and Computing in Applied Probability, Edición 27, 2026, Página(s) 31, ISSN 1387-5841
Editor: Kluwer Academic Publishers
DOI: 10.1007/s11009-025-10213-2

Robustness-oriented training for automated design of photonic tensor cores

Autores: Gianluca Kosmella, Matěj Hejda, Thomas Van Vaerenbergh, Wolfger Peelaers
Publicado en: Optics Express, Edición 34, 2026, Página(s) 11710, ISSN 1094-4087
Editor: Optical Society of America
DOI: 10.1364/oe.588175

Noise-resilient designs and analysis for optical neural networks

Autores: Gianluca Kosmella, Ripalta Stabile, Jaron Sanders
Publicado en: Neuromorphic Computing and Engineering, Edición 4, 2025, Página(s) 044002, ISSN 2634-4386
Editor: IOP Publishing
DOI: 10.1088/2634-4386/ad836f

Christensen-Sinclair factorization via semidefinite programming

Autores: Francisco Escudero-Gutiérrez
Publicado en: Linear Algebra and its Applications, Edición 714, 2025, Página(s) 28-44, ISSN 0024-3795
Editor: Elsevier BV
DOI: 10.1016/j.laa.2025.03.007

Hardware-Efficient Entangled Measurements for Variational Quantum Algorithms

Autores: Francisco Escudero, David Fernández-Fernández, Gabriel Jaumà, Guillermo F. Peñas, Luciano Pereira
Publicado en: Physical Review Applied, Edición 20, 2023, ISSN 2331-7019
Editor: American Physical Society (APS)
DOI: 10.1103/physrevapplied.20.034044

Evolution of discordant edges in the voter model on random sparse digraphs

Autores: Federico Capannoli
Publicado en: Electronic Journal of Probability, Edición 30, 2025, ISSN 1083-6489
Editor: Institute of Mathematical Statistics
DOI: 10.1214/24-ejp1265

A queueing-based approach for integrated routing and appointment scheduling

Autores: René Bekker, Bharti Bharti, Leon Lan, Michel Mandjes
Publicado en: European Journal of Operational Research, Edición 318, 2024, Página(s) 534-548, ISSN 0377-2217
Editor: Elsevier BV
DOI: 10.1016/j.ejor.2024.05.038

A cb-Bohnenblust–Hille inequality with constant one and its applications in learning theory

Autores: Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos
Publicado en: Mathematische Annalen, Edición 392, 2025, Página(s) 3367-3396, ISSN 0025-5831
Editor: Springer Verlag
DOI: 10.1007/s00208-025-03142-5

Grothendieck inequalities characterize converses to the polynomial method

Autores: Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling
Publicado en: Quantum, Edición 8, 2024, Página(s) 1526, ISSN 2521-327X
Editor: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
DOI: 10.22331/q-2024-11-18-1526

Dynamic Random Intersection Graph: Dynamic Local Convergence and Giant Structure

Autores: Marta Milewska, Remco van der Hofstad, Bert Zwart
Publicado en: Random Structures & Algorithms, Edición 66, 2025, ISSN 1042-9832
Editor: John Wiley & Sons Inc.
DOI: 10.1002/rsa.21264

Cycle Partitions in Dense Regular Digraphs and Oriented Graphs

Autores: Allan Lo, Viresh Patel, Mehmet Akif Yıldız
Publicado en: Forum of Mathematics, Sigma, Edición 13, 2025, ISSN 2050-5094
Editor: Cambridge University Press (CUP)
DOI: 10.1017/fms.2025.28

On a cover time problem on a dynamic graph with steps at random times

Autores: Yunus Emre Demirci, Ümi̇t Işlak, Mehmet Akif Yıldız
Publicado en: Statistics & Probability Letters, Edición 197, 2025, Página(s) 109821, ISSN 0167-7152
Editor: Elsevier BV
DOI: 10.1016/j.spl.2023.109821

Meeting, coalescence and consensus time on random directed graphs

Autores: Luca Avena, Federico Capannoli, Rajat Subhra Hazra, Matteo Quattropani
Publicado en: The Annals of Applied Probability, Edición 34, 2024, Página(s) 58, ISSN 1050-5164
Editor: Institute of Mathematical Statistics
DOI: 10.1214/24-aap2087

A Phase Transition for Opinion Dynamics with Competing Biases

Autores: Federico Capannoli, Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani
Publicado en: Proceedings of the AAAI Conference on Artificial Intelligence, Edición 40, 2026, Página(s) 29323-29331, ISSN 2374-3468
Editor: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v40i35.40172

How social reinforcement learning can lead to metastable polarisation and the voter model

Autores: Benedikt V. Meylahn, Janusz M. Meylahn
Publicado en: PLOS ONE, Edición 19, 2024, Página(s) e0313951, ISSN 1932-6203
Editor: Public Library of Science
DOI: 10.1371/journal.pone.0313951

Interacting particle systems on random graphs

Autores: Federico Capannoli, Frank den Hollander
Publicado en: Ensaios Matemáticos, Edición 40, 2024, ISSN 2175-0432
Editor: Sociedade Brasileira de Matematica
DOI: 10.21711/217504322024/em402

Opinion dynamics beyond social influence

Autores: Benedikt V Meylahn, Christa Searle
Publicado en: Network Science, Edición 12, 2024, Página(s) 339-365, ISSN 2050-1242
Editor: Cambridge University Press (CUP)
DOI: 10.1017/nws.2024.14

Conference proceedings (7)

The number of random 2-SAT solutions is asymptotically log-normal

Autores: Arnab Chatterjee; Amin Coja-Oghlan; Noëla Müller; Connor Riddlesden; Maurice Rolvien; Pavel Zakharov; Haodong Zhu
Publicado en: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024), 2024
Editor: Leibniz International Proceedings in Informatics
DOI: 10.4230.lipics.approx/random.2024.39

Influences of Fourier Completely Bounded Polynomials and Classical Simulation of Quantum Algorithms

Autores: Francisco Escudero Gutiérrez
Publicado en: Chicago Journal of Theoretical Computer Science, 2024
Editor: Department of Computer Science, The University of Chicago
DOI: 10.4086/cjtcs.2024.02

On Converses to the Polynomial Method

Autores: Jop Briët, Francisco Escudero Gutiérrez,
Publicado en: Proceedings 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022), 2022, Página(s) 6:1 - 6:10, ISBN 978-3-95977-237-2
Editor: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.tqc.2022.6

Learning low-degree quantum objects

Autores: Arunachalam, Srinivasan; Dutt, Arkopal; Escudero Gutiérrez, Francisco; Palazuelos, Carlos
Publicado en: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Edición 51, 2024, Página(s) 19
Editor: Leibniz International Proceedings in Informatics
DOI: 10.4230/lipics.icalp.2024.13

Multi-agent Reinforcement Learning in the All-or-Nothing Public Goods game on Networks

Autores: Benedikt Valentin Meylahn
Publicado en: International Joint Conference on Autonomous Agents and Multiagent Systems, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1, 2026, Página(s) 1492-1500
Editor: IEEE Computer Society
DOI: 10.65109/ognq9493

Finding Diverse Minimum s-t Cuts

Autores: Mark de Berg; Andrés López Martínez; Frits C. R. Spieksma
Publicado en: Proceedings of the 34th International Symposium on Algorithms and Computation (ISAAC 2023), 2023, Página(s) 17
Editor: Schloss Dagstuhl
DOI: 10.4230/lipics.isaac.2023.24

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure

Autores: Mark de Berg, Andrés López Martínez
Publicado en: 36th International Symposium on Algorithms and Computation (ISAAC 2025), 2025, Página(s) 11:1-11.19
Editor: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/lipics.isaac.2025.11

Other (24)

The spectrum of dense kernel-based random graphs

Autores: Alessandra Cipriani, Rajat Subhra Hazra, Nandan Malhotra, Michele Salvi
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv2502.09415

Random $2$-SAT: The set of atoms of the limiting empirical marginal distribution

Autores: Müller, Noela; Neininger, Ralph; Zhu, Haodong
Publicado en: 2024
Editor: arXiv
DOI: 10.48550/arxiv.2410.17749

Hamilton Cycles on Dense Regular Digraphs and Oriented Graphs

Autores: Allan Lo, Viresh Patel, Mehmet Akif Yıldız
Publicado en: 2022
Editor: arxiv
DOI: 10.48550/arxiv.2203.10112

Two more ways of spelling Gini Coefficient with Applications

Autores: Marta Milewska, Remco van der Hofstad, Bert Zwart
Publicado en: 2022
Editor: arXiv
DOI: 10.48550/arxiv.2201.12298

Asymptotic diameter of preferential attachment model

Autores: Hang Du, Shuyang Gong, Zhangsong Li, Haodong Zhu
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv2504.21741

Learning junta distributions, quantum junta states, and QAC$^0$ circuits

Autores: Bao, Jinge; Escudero-Gutiérrez, Francisco
Publicado en: 2024
Editor: arXiv
DOI: 10.48550/arxiv.2410.15822

Detecting weighted hidden cliques

Autores: Urmisha Chatterjee, Karissa Huang, Ritabrata Karmakar, B. R. Vinay Kumar, Gábor Lugosi, Nandan Malhotra, Anirban Mandal, Maruf Alam Tarafdar
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv.2506.21543

Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms

Autores: Lukas Hintze; Lena Krieg; Olga Scheftelowitsch; Haodong Zhu
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv.2411.03839

In situ fine-tuning of in silico trained Optical Neural Networks

Autores: Gianluca Kosmella, Ripalta Stabile, Jaron Sanders
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv.2506.22122

Useful stochastic bounds in time-varying queues with service and patience times having general joint distribution

Autores: Bodas, Shreehari Anand; Jacobovic, Royi
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv.2406.12745

Spectral properties of the Laplacian of Scale-Free Percolation models

Autores: Rajat Subhra Hazra, Nandan Malhotra
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv2504.17552

Statistical inference for a service system with non-stationary arrivals and unobserved balking

Autores: Bodas, Shreehari Anand; Mandjes, Michel; Ravner, Liron
Publicado en: 2024
Editor: arXiv
DOI: 10.48550/arxiv.2311.16884

SIR on locally converging dynamic random graphs

Autores: Milewska, Marta; van der Hofstad, Remco; Zwart, Bert
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv.2501.09623

Voter model on heterogeneous directed networks

Autores: Luca Avena, Federico Capannoli, Diego Garlaschelli, Rajat Subhra Hazra
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv.2506.12169

Percolation on preferential attachment models

Autores: Hazra, Rajat Subhra; van der Hofstad, Remco; Ray, Rounak
Publicado en: 2023
Editor: arXiv
DOI: 10.48550/arxiv.2312.14085

Detection and Evaluation of Clusters within Sequential Data

Autores: Alexander Van Werde, Albert Senen-Cerda, Gianluca Kosmella, Jaron Sanders
Publicado en: 2022
Editor: arxiv
DOI: 10.48550/arxiv.2210.01679

A framework for window design in delivery schedules

Autores: Bharti Bharti, René Bekker, Nikki Levering, Michel Mandjes
Publicado en: 2026
Editor: arXiv
DOI: 10.4855/arxiv.2601.19601

Limiting Spectra of inhomogeneous random graphs

Autores: Avena, Luca; Hazra, Rajat Subhra; Malhotra, Nandan
Publicado en: 2023
Editor: arXiv
DOI: 10.48550/arxiv.2312.02805

Logarithmic typical distances in preferential attachment models

Autores: Remco van der Hofstad, Haodong Zhu
Publicado en: 2025
Editor: arXiv
DOI: 10.48550/arxiv.2502.07961

Trajectories and Platoon-forming Algorithm for Intersections with Heterogeneous Autonomous Traffic

Autores: P. C. Joshi, M. A. A. Boon, S. C. Borst
Publicado en: 2023
Editor: arXiv
DOI: 10.48550/arxiv.2311.07435

Simple algorithms to test and learn local Hamiltonians

Autores: Francisco Escudero Gutiérrez
Publicado en: 2024
Editor: arXiv
DOI: 10.48550/arxiv.2404.06282

All $S_p$ notions of quantum expansion are equivalent

Autores: Francisco Escudero Gutiérrez; Garazi Muguruza
Publicado en: 2024
Editor: arXiv
DOI: 10.48550/arxiv.2405.03517

Maximum of the membrane model on regular trees

Autores: Alessandra Cipriani, Biltu Dan, Rajat Subhra Hazra, Rounak Ray
Publicado en: 2022
Editor: arxiv
DOI: 10.48550/arxiv.2107.12276

Maximum size of a triangle-free graph with bounded maximum degree and matching number

Autores: Milad Ahanjideh, Tınaz Ekim, Mehmet Akif Yıldız
Publicado en: 2022
Editor: arXiv
DOI: 10.48550/arxiv.2207.02271

Book chapters (2)

Stable and Dynamic Minimum Cuts

Autores: Mark de Berg, Andrés López Martínez, Frits Spieksma
Publicado en: Lecture Notes in Computer Science, WALCOM: Algorithms and Computation, 2024, Página(s) 273-287
Editor: Springer Nature Singapore
DOI: 10.1007/978-981-97-0566-5_20

Disjoint Tours and the Price of Diversity

Autores: Mark de Berg, Andrés López Martínez, Frits Spieksma
Publicado en: Lecture Notes in Computer Science, WALCOM: Algorithms and Computation, 2026, Página(s) 402-417
Editor: Springer Nature Singapore
DOI: 10.1007/978-981-95-7127-7_27

Thesis and dissertations (2)

Cycle partitions and path decompositions in directed graphs

Autores: M.A. Yildiz
Publicado en: 2025
Editor: Korteweg-de Vries Institute for Mathematics at the University of Amsterdam

Universality of the local limit of preferential attachment models

Autores: Garavaglia, Alessandro; Hazra, Rajat Subhra; van der Hofstad, Remco; Ray, Rounak
Publicado en: 2022
Editor: arXiv
DOI: 10.48550/arxiv.2212.05551