Spectral and Optimization Techniques for Robust Recovery, Combinatorial Constructions, and Distributed Algorithms

Información del proyecto

SO-ReCoDi

Identificador del acuerdo de subvención: 834861

DOI

10.3030/834861

Proyecto cerrado

Fecha de la firma de la CE 9 Abril 2019

Fecha de inicio 1 Septiembre 2019

Fecha de finalización 28 Febrero 2025

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 971 805,00

Aportación de la UE

€ 1 971 805,00

Coordinado por

UNIVERSITA COMMERCIALE LUIGI BOCCONI
Italy

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 .

Publicaciones

Conference proceedings (18)

Discrepancy Minimization via Regularization

Autores: Pesenti, Lucas; Vladu, Adrian
Publicado en: https://hal.science/hal-03868123, Edición 9, 2023
Editor: SIAM
DOI: 10.1137/1.9781611977554.ch66

A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs

Autores: Tommaso d’Orsi, Luca Trevisan
Publicado en: 2022
Editor: Online
DOI: 10.48550/arxiv.2204.10881

The Minority Dynamics and the Power of Synchronicity

Autores: Becchetti, Luca; Clementi, Andrea; Pasquale, Francesco; Trevisan, Luca; Vacus, Robin; Ziccardi, Isabella
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912, Edición 12, 2024
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.144

Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification

Autores: Chen, Antares; Shi, Jonathan; Trevisan, Luca
Publicado en: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Página(s) 3693 - 3731
Editor: SIAM
DOI: 10.1137/1.9781611977073.146

Consensus vs Broadcast, with and Without Noise (Extended Abstract)

Autores: Clementi, Andrea ; Gualà, Luciano ; Natale, Emanuele ; Pasquale, Francesco ; Scornavacca, Giacomo ; Trevisan, Luca
Publicado en: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Edición January 6, 2020, 2020, Página(s) 42:1--42:13, ISBN 978-3-95977-134-4
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.itcs.2020.42

Subexponential LPs Approximate Max-Cut

Autores: Samuel B. Hopkins, Tselil Schramm, Luca Trevisan
Publicado en: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, Página(s) 943-953, ISBN 978-1-7281-9621-3
Editor: IEEE
DOI: 10.1109/focs46700.2020.00092

Self-Stabilizing MIS Computation in the Beeping Model

Autores: George Giakkoupis, Volker Turau, Isabella Ziccardi
Publicado en: Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, Edición Article No. 28; pp. 28:1–28:21, 2024
Editor: Dan Alistarh

Distributed Self-Stabilizing MIS with Few States and Weak Communication

Autores: George Giakkoupis; Isabella Ziccardi
Publicado en: PODC 2023 - ACM Symposium on Principles of Distributed Computing, Edición 10, 2023, ISBN 9798400701214
Editor: Association for Computing Machinery
DOI: 10.1145/3583668.3594581

Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond

Autores: Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, Jonathan Shi
Publicado en: 49th International Colloquium on Automata, Languages, and Programming (ICALP), 2022
Editor: Schloss Dagstuhl-Leibniz-Zentrum für Informatik

Deep Networks on Toroids: Removing Symmetries Reveals the Structure ofFlat Regions in the Landscape Geometry

Autores: Fabrizio Pittorino, Antonio Ferraro, Gabriele Perugini, Christoph Feinauer, Carlo Baldassi, Riccardo Zecchina
Publicado en: arXiv preprint arXiv:2202.03038, 2022
Editor: arXiv preprint arXiv:2202.03038

On the Role of Memory in Robust Opinion Dynamics

Autores: Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus
Publicado en: 2023, ISBN 978-1-956792-03-4
Editor: International Joint Conferences on Artificial Intelligence Organization

Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses

Autores: Jones, Chris; Marwaha, Kunal; Sandhu, Juspreet Singh; Shi, Jonathan
Publicado en: Edición 17, 2023
Editor: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.itcs.2023.77

Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models

Autores: Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan
Publicado en: 2022, ISSN 2640-3498
Editor: Proceedings of Machine Learning Research

A Sum-of-Squares Hierarchy in the Absence of Pointwise Proofs I: Energy Certificates

Autores: Sandhu, J. S.; Shi, J.
Publicado en: Edición 13, 2023, ISBN 9781450399135
Editor: Association for Computing Machinery
DOI: 10.48550/arxiv.2401.14383

Percolation and Epidemic Processes in One-Dimensional Small-World Networks

Autores: Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Publicado en: LATIN 2022: Theoretical Informatics, 2022, Página(s) pp 476–492
Editor: Latin American Symposium on Theoretical Informatics

Expansion and Flooding in Dynamic Random Networks withNode Churn

Autores: Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Publicado en: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), 2021
Editor: Institute of Electrical and Electronics Engineers

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Autores: Nikhil Bansal, Ola Svensson, Luca Trevisan
Publicado en: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, Página(s) 910-928, ISBN 978-1-7281-4952-3
Editor: IEEE
DOI: 10.1109/focs.2019.00059

New SDP Roundings and Certifiable Approximation for Cubic Optimization

Autores: Hsieh, Jun-Ting; Kothari, Pravesh K.; Pesenti, Lucas; Trevisan, Luca
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912, Edición 9, 2023, ISBN 978-1-61197-791-2
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.83

Non-peer reviewed articles (1)

Entropic gradient descent algorithms and wide flat minima

Autores: Fabrizio Pittorino; Carlo Lucibello; Christoph Feinauer; Gabriele Perugini; Carlo Baldassi; Elizaveta Demyanenko; Riccardo Zecchina
Publicado en: Journal of Statistical Mechanics: Theory and Experiment, Edición 12, 2021, Página(s) 124015, ISSN 1742-5468
Editor: Institute of Physics
DOI: 10.1088/1742-5468/ac3ae8

Peer reviewed articles (3)

Find Your Place: Simple Distributed Algorithms for Community Detection

Autores: Luca Becchetti; Andrea E. F. Clementi; Emanuele Natale; Francesco Pasquale; Luca Trevisan
Publicado en: SIAM Journal on Computing, Edición vol 49 n 4, 2020, Página(s) 821-864, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/19m1243026

Bond percolation in small-world graphs with power-law distribution

Autores: Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi
Publicado en: Theoretical Computer Science, Edición 1011, 2025, Página(s) 114717, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2024.114717

Luby's MIS algorithms made self-stabilizing

Autores: George Giakkoupis, Volker Turau, Isabella Ziccardi
Publicado en: Information Processing Letters, Edición 188, 2024, Página(s) 106531, ISSN 0020-0190
Editor: Elsevier BV
DOI: 10.1016/j.ipl.2024.106531

Book chapters (2)

Finding a Bounded-Degree Expander Inside a Dense One

Autores: Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
Publicado en: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Página(s) 1320-1336, ISBN 978-1-61197-599-4
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.80

A New Algorithm for the Robust Semi-random Independent Set Problem

Autores: Theo McKenzie, Hermish Mehta, Luca Trevisan
Publicado en: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Página(s) 738-746, ISBN 978-1-61197-599-4
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.45