NETCO-PD: 14 experienced researchers in network science for Europe

Insensitivity for Matching Systems

Autori: Runhan Xie, Elene Anton, Kristen Gardner, Rhonda Righter
Pubblicato in: Queueing Systems, Numero 109, 2025, ISSN 0257-0130
Editore: Baltzer Science Publishers B.V.
DOI: 10.1007/s11134-025-09943-4

Estimation of on- and off-time distributions in a dynamic Erdős–Rényi random graph

Autori: Michel R. H. Mandjes, Jiesen Wang
Pubblicato in: Advances in Applied Probability, Numero 58, 2026, Pagina/e 562-591, ISSN 0001-8678
Editore: Applied Probability Trust
DOI: 10.1017/apr.2025.10027

Inference for dynamic Erdős–Rényi random graphs under regime switching

Autori: Michel Mandjes, Jiesen Wang
Pubblicato in: Performance Evaluation, Numero 169, 2025, Pagina/e 102499, ISSN 0166-5316
Editore: Elsevier BV
DOI: 10.1016/j.peva.2025.102499

Elastic-Degenerate String Matching with 1 Error or Mismatch

Autori: Giulia Bernardini, Esteban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba
Pubblicato in: Theory of Computing Systems, Numero 68, 2024, Pagina/e 1442-1467, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-024-10194-8

On the meeting of random walks on random DFA

Autori: Matteo Quattropani, Federico Sau
Pubblicato in: Stochastic Processes and their Applications, Numero 166, 2026, Pagina/e 104225, ISSN 0304-4149
Editore: Elsevier BV
DOI: 10.1016/j.spa.2023.104225

Similarity of structures in popular music

Autori: Benoît Corsini
Pubblicato in: Journal of New Music Research, Numero 52, 2024, Pagina/e 107-138, ISSN 0929-8215
Editore: Swets & Zeitlinger
DOI: 10.1080/09298215.2024.2329751

The friendship paradox for trees

Autori: Rajat Subhra Hazra, Frank den Hollander, Nelly Litvak, Azadeh Parvaneh
Pubblicato in: Electronic Journal of Probability, Numero 31, 2026, Pagina/e 1-26, ISSN 1083-6489
Editore: Institute of Mathematical Statistics
DOI: 10.1214/26-ejp1575

Elastic-degenerate string comparison

Autori: Estéban Gabory, Moses Njagi Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba
Pubblicato in: Information and Computation, Numero 304, 2025, Pagina/e 105296, ISSN 0890-5401
Editore: Academic Press
DOI: 10.1016/j.ic.2025.105296

Mixing of the averaging process and its discrete dual on finite-dimensional geometries

Autori: Matteo Quattropani, Federico Sau
Pubblicato in: The Annals of Applied Probability, Numero 33, 2026, Pagina/e 1136-1171, ISSN 1050-5164
Editore: Institute of Mathematical Statistics
DOI: 10.1214/22-aap1838

Pangenome comparison via ED strings

Autori: Esteban Gabory, Moses Njagi Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba
Pubblicato in: Frontiers in Bioinformatics, Numero 4, 2024, ISSN 2673-7647
Editore: Frontiers Media SA
DOI: 10.3389/fbinf.2024.1397036

Computing String Covers in Sublinear Time

Autori: Jakub Radoszewski, Wiktor Zuba
Pubblicato in: Theory of Computing Systems, Numero 70, 2026, ISSN 1432-4350
Editore: Springer Verlag
DOI: 10.1007/s00224-025-10258-3

Optimal structure of signal networks for efficient information aggregation

Autori: Bernd Heidergott, Frank den Hollander, Ines Lindner, Azadeh Parvaneh
Pubblicato in: Scientific Reports, Numero 15, 2025, ISSN 2045-2322
Editore: Nature Publishing Group
DOI: 10.1038/s41598-025-24327-7

Concatenating random matchings

Autori: Fabian Burghart, Paul Thévenin
Pubblicato in: Electronic Journal of Probability, Numero 29, 2026, Pagina/e 1-28, ISSN 1083-6489
Editore: Institute of Mathematical Statistics
DOI: 10.1214/24-ejp1237

Parameter estimation in interacting particle systems on dynamic random networks

Autori: Simone Baldassarri, Jiesen Wang
Pubblicato in: Physical Review E, Numero 112, 2026, ISSN 2470-0045
Editore: American Physical Society (APS)
DOI: 10.1103/k8cr-vkkf

Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents

Autori: Georgios Amanatidis, Sophie Klumper, Evangelos Markakis, Guido Schäfer, Artem Tsikiridis
Pubblicato in: ACM Transactions on Economics and Computation, Numero 13, 2025, Pagina/e 1-28, ISSN 2167-8375
Editore: Association for Computing Machinery (ACM)
DOI: 10.1145/3723883

Moments of polynomial functionals of spectrally positive Lévy processes

Autori: Peter Glynn, Royi Jacobovic, Michel Mandjes
Pubblicato in: Stochastic Processes and their Applications, Numero 190, 2025, Pagina/e 104726, ISSN 0304-4149
Editore: Elsevier BV
DOI: 10.1016/j.spa.2025.104726

Functional central limit theorem for the principal eigenvalue of dynamic Erdős–Rényi random graphs

Autori: Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes
Pubblicato in: The Annals of Applied Probability, Numero 36, 2026, Pagina/e 2468-2498, ISSN 1050-5164
Editore: Institute of Mathematical Statistics
DOI: 10.1214/25-aap2284

Limits of Mallows trees

Autori: Benoît Corsini
Pubblicato in: Electronic Journal of Probability, Numero 29, 2026, Pagina/e 1-44, ISSN 1083-6489
Editore: Institute of Mathematical Statistics
DOI: 10.1214/24-ejp1167

Parameter estimation in a dynamic Chung-Lu random graph

Autori: Rajat Subhra Hazra, Michel Mandjes, Jiesen Wang
Pubblicato in: Physical Review E, Numero 112, 2026, ISSN 2470-0045
Editore: American Physical Society (APS)
DOI: 10.1103/6w2h-p1sr

Pandora's box problem with time constraints

Autori: Georgios Amanatidis, Ben Berger, Tomer Ezra, Michal Feldman, Federico Fusco, Rebecca Reiffenhäuser, Artem Tsikiridis
Pubblicato in: Artificial Intelligence, Numero 349, 2026, Pagina/e 104426, ISSN 0004-3702
Editore: Elsevier BV
DOI: 10.1016/j.artint.2025.104426

Breaking Barriers, Finding Boundaries: Not Obviously Manipulable Budget-Feasible Mechanism Design

Autori: Bart De Keijzer, Guido Schäfer, Artem Tsikiridis, Carmine Ventre
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 40, 2026, Pagina/e 16803-16811, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v40i20.38724

Constrained boundary labeling

Autori: Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger
Pubblicato in: Computational Geometry, Numero 129, 2025, Pagina/e 102191, ISSN 0925-7721
Editore: Elsevier BV
DOI: 10.1016/j.comgeo.2025.102191

Grassmannian calculus for probability

Autori: Simone Baldassarri, Alessandra Cipriani
Pubblicato in: Ensaios Matemáticos, Numero 41, 2025, ISSN 2175-0432
Editore: Sociedade Brasileira de Matematica
DOI: 10.21711/217504322025/em412

Discordant edges for the voter model on regular random graphs

Autori: Luca Avena, Rangel Baldasso, Rajat Subhra Hazra, Frank den Hollander, Matteo Quattropani
Pubblicato in: Latin American Journal of Probability and Mathematical Statistics, Numero 21, 2024, Pagina/e 431, ISSN 1980-0436
Editore: Instituto Nacional de Matematica Pura e Aplicada
DOI: 10.30757/alea.v21-18

Binary search trees of permuton samples

Autori: Benoît Corsini, Victor Dubach, Valentin Féray
Pubblicato in: Advances in Applied Mathematics, Numero 162, 2024, Pagina/e 102774, ISSN 0196-8858
Editore: Academic Press
DOI: 10.1016/j.aam.2024.102774

The friendship paradox for sparse random graphs

Autori: Rajat Subhra Hazra, Frank den Hollander, Azadeh Parvaneh
Pubblicato in: Probability Theory and Related Fields, Numero 195, 2026, Pagina/e 109-131, ISSN 0178-8051
Editore: Springer Verlag
DOI: 10.1007/s00440-025-01365-w

Efficient scheduling in redundancy systems with general service times

Autori: Elene Anton, Rhonda Righter, Ina Maria Verloop
Pubblicato in: Queueing Systems, Numero 106, 2024, Pagina/e 333-372, ISSN 0257-0130
Editore: Baltzer Science Publishers B.V.
DOI: 10.1007/s11134-024-09904-3

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks

Autori: Martin Frohn, Steven Kelk
Pubblicato in: Annals of Operations Research, Numero 345, 2025, Pagina/e 125-145, ISSN 0254-5330
Editore: Kluwer Academic Publishers
DOI: 10.1007/s10479-024-06452-0

A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem

Autori: Catanzaro, C. Frohn, M. Gascuel, O., Pesenti, R
Pubblicato in: Computers & Operations Research, Numero Volume 158, October 2023, 2023, Pagina/e 106308, ISSN 0305-0548
Editore: Pergamon Press Ltd.
DOI: 10.1016/j.cor.2023.106308

Polynomial Invariants for Rooted Trees Related to Their Random Destruction

Autori: Fabian Burghart
Pubblicato in: The Electronic Journal of Combinatorics, Numero 31, 2024, ISSN 1077-8926
Editore: Electronic Journal of Combinatorics
DOI: 10.37236/11975

Functional central limit theorem for the subgraph count of the voter model on dynamic random graphs

Autori: Simone Baldassarri, Nikolai Kriukov
Pubblicato in: Bernoulli, Numero 32, 2026, Pagina/e 2473-2500, ISSN 1350-7265
Editore: Chapman & Hall
DOI: 10.3150/25-bej1961

The multi-level friendship paradox for sparse random graphs

Autori: Rajat Subhra Hazra, Frank den Hollander, Azadeh Parvaneh
Pubblicato in: Stochastic Processes and their Applications, Numero 195, 2026, Pagina/e 104873, ISSN 0304-4149
Editore: Elsevier BV
DOI: 10.1016/j.spa.2026.104873

Functional central limit theorem for the simultaneous subgraph count of dynamic Erdős–Rényi random graphs

Autori: Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes
Pubblicato in: Electronic Journal of Probability, Numero 30, 2026, Pagina/e 1-38, ISSN 1083-6489
Editore: Institute of Mathematical Statistics
DOI: 10.1214/25-ejp1442

A unifying theory of aging and mortality

Autori: Valentin Flietner, Bernd Heidergott, Frank den Hollander, Ines Lindner, Azadeh Parvaneh, Holger Strulik
Pubblicato in: Scientific Reports, Numero 15, 2025, ISSN 2045-2322
Editore: Nature Publishing Group
DOI: 10.1038/s41598-025-11454-4

Second order properties of thinned counts in finite birth–death processes

Autori: Daryl. J. Daley, Yoni Nazarathy, Jiesen Wang
Pubblicato in: Queueing Systems, Numero 110, 2026, ISSN 0257-0130
Editore: Baltzer Science Publishers B.V.
DOI: 10.1007/s11134-026-09974-5

Homogeneous nucleation for two-dimensional Kawasaki dynamics

Autori: Simone Baldassarri, Alexandre Gaudillière, Frank den Hollander, Francesca R. Nardi, Enzo Olivieri, Elisabetta Scoppola
Pubblicato in: Stochastic Processes and their Applications, Numero 200, 2026, Pagina/e 105031, ISSN 0304-4149
Editore: Elsevier BV
DOI: 10.1016/j.spa.2026.105031

Assessing the accuracy of externalities prediction in a LCFS-PR M/G/1 queue under partial information

Autori: Royi Jacobovic, Nikki Levering
Pubblicato in: Operations Research Letters, Numero 57, 2024, Pagina/e 107205, ISSN 0167-6377
Editore: Elsevier BV
DOI: 10.1016/j.orl.2024.107205

Local limit of Prim's algorithm

Autori: Benoît Corsini, Rowel Gündlach, Remco van der Hofstad
Pubblicato in: 2026
Editore: arXiv

The hitting time of nice factors

Autori: Burghart, Fabian; Kaufmann, Marc; Müller, Noela; Pasch, Matija
Pubblicato in: Numero 13, 2024
Editore: arXiv

Large deviation principle for friendship-biases in Galton–Watson trees

Autori: F. den Hollander, A. Parvaneh
Pubblicato in: 2026
Editore: arXiv

Mechanism Design with Outliers and Predictions

Autori: Argyrios Deligkas, Eduard Eiben, Sophie Klumper, Guido Schäfer, Artem Tsikiridis
Pubblicato in: 2025
Editore: arXiv

Opinion dynamics on dense dynamic random graphs

Autori: Baldassarri, Simone; Braunsteins, Peter; Hollander, Frank den; Mandjes, Michel
Pubblicato in: Numero 2, 2026
Editore: arXiv
DOI: 10.48550/arxiv.2410.14618

Sharp Thresholds for Factors in Random Graphs

Autori: Burghart, Fabian; Heckel, Annika; Kaufmann, Marc; Müller, Noela; Pasch, Matija
Pubblicato in: Numero 12, 2024
Editore: arXiv

A minimal compact description of the diversity index polytope

Autori: Frohn, Martin; Manson, Kerry
Pubblicato in: Numero 3, 2024
Editore: arXiv
DOI: 10.48550/arxiv.2409.15641

The voter model on random regular graphs with random rewiring

Autori: Avena, Luca; Baldasso, Rangel; Hazra, Rajat Subhra; Hollander, Frank den; Quattropani, Matteo
Pubblicato in: Numero 4, 2025
Editore: arXiv
DOI: 10.48550/arxiv.2501.08703

A Bijection for the Evolution of B-Trees.

Autori: Fabian Burghart and Stephan Wagner
Pubblicato in: 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Numero 302, 2024, Pagina/e 10:1-10:15
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.aofa.2024.10

Enhancing Generalized Compressed Suffix Trees, with Applications.

Autori: Chakraborty, Sankardeep; Sadakane, Kunihiko; Zuba, Wiktor
Pubblicato in: In 35th International Symposium on Algorithms and Computation (ISAAC 2024). Leibniz International Proceedings in Informatics (LIPIcs),, Numero 322, 2024, Pagina/e 18:1-18:15
Editore: Dagstuhl Publishing

Boundary Labeling in a Circular Orbit

Autori: Annika Bonerath; Martin Nöllenburg; Soeren Terziadis; Markus Wallinger; Jules Wulms
Pubblicato in: In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs),, Numero 320, 2024, Pagina/e 22:1-22:17
Editore: Dagstuhl Publishing
DOI: 10.4230/lipics.gd.2024.22

Shortest Undirected Paths in de Bruijn Graphs.

Autori: W.P. Zuba (Wiktor); O. Lachish (Oded); S. Pissis (Solon)
Pubblicato in: In 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025). Leibniz International Proceedings in Informatics (LIPIcs),, Numero 331, 2024, Pagina/e 12:1-12:13
Editore: Dagstuhl Publishing

To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model

Autori: Riccardo Colini-Baldeschi, Sophie Klumper, Guido Schäfer, Artem Tsikiridis
Pubblicato in: Proceedings of the 25th ACM Conference on Economics and Computation, 2025, Pagina/e 1134-1154
Editore: ACM
DOI: 10.1145/3670865.3673578

Constrained Boundary Labeling

Autori: Thomas Depian, Martin Nöllenburg, Soeren Terziadis, and Markus Wallinger
Pubblicato in: In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Numero 322, 2024, Pagina/e 26:1-26:16
Editore: Dagstuhl Publishing
DOI: 10.4230/lipics.isaac.2024.26

Approximate Suffix-Prefix Dictionary Queries.

Autori: W.P. Zuba (Wiktor); G. Loukides (Grigorios); S. Pissis (Solon); S.V. Thankachan (Sharma)
Pubblicato in: n 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs),, Numero 306, 2024, Pagina/e 85:1-85:18
Editore: Dagstuhl Publishing

Space-Efficient Indexes for Uncertain Strings

Autori: Esteban Gabory, Chang Liu, Grigorios Loukides, Solon P. Pissis, Wiktor Zuba
Pubblicato in: 2024 IEEE 40th International Conference on Data Engineering (ICDE), 2024, Pagina/e 4828-4842
Editore: IEEE
DOI: 10.1109/icde60146.2024.00367

Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets

Autori: Riccardo Colini Baldeschi, Sophie Klumper, Twan Kroll, Stefano Leonardi, Guido Schäefer, Artem Tsikiridis
Pubblicato in: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2026, Pagina/e 1795-1823
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978971.64

Online Budget-Feasible Mechanism Design with Predictions

Autori: Georgios Amanatidis, Evangelos Markakis, Christodoulos Santorinaios, Guido Schäfer, Panagiotis Tsamopoulos, Artem Tsikiridis
Pubblicato in: Lecture Notes in Computer Science, Algorithmic Game Theory, 2026, Pagina/e 402-421
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-03639-1_22

Risultati finali

Pubblicazioni

Scarica Scarica il contenuto della pagina

NETCO-PD: 14 experienced researchers in network science for Europe

Risultati dei progetti

Risultati finali

Pubblicazioni

Scarica Scarica il contenuto della pagina