Imagen de Portada

Eliminating Majority Illusions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fioravantes, Foivos, Lahiri, Abhiruk, Lauerbach, Antonio, Sabater, Lluís, Sieper, Marie Diana, Wolf, Samuel
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Social and Information Networks
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Parameterized Complexity of Coloring Mixed Graphs
por: Lauerbach, Antonio, et al.
Publicado: (2026)

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
por: Lauerbach, Antonio, et al.
Publicado: (2024)

Parameterised distance to local irregularity
por: Fioravantes, Foivos, et al.
Publicado: (2023)

Defensive Alliances in Signed Networks
por: Arrighi, Emmanuel, et al.
Publicado: (2023)

Efficient Algorithms for Relevant Quantities of Friedkin-Johnsen Opinion Dynamics Model
por: Wang, Gengyu, et al.
Publicado: (2025)

On the Limits of PAC Learning of Networks from Opinion Dynamics
por: Chistikov, Dmitry, et al.
Publicado: (2026)

Exact Algorithms for Distance to Unique Vertex Cover
por: Fioravantes, Foivos, et al.
Publicado: (2025)

Graph Irregularity via Edge Deletions
por: Bensmail, Julien, et al.
Publicado: (2025)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
por: Fioravantes, Foivos, et al.
Publicado: (2024)

Parameterized Shortest Path Reconfiguration
por: Bousquet, Nicolas, et al.
Publicado: (2024)

Counting Graphlets of Size $k$ under Local Differential Privacy
por: Suppakitpaisarn, Vorapong, et al.
Publicado: (2025)

The Theory and Practice of Computing the Bus-Factor
por: Piccolo, Sebastiano A., et al.
Publicado: (2026)

Faster maximal clique enumeration in large real-world link streams
por: Baudin, Alexis, et al.
Publicado: (2023)

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
por: Baudin, Alexis, et al.
Publicado: (2024)

Solving Multiagent Path Finding on Highly Centralized Networks
por: Fioravantes, Foivos, et al.
Publicado: (2024)

Phase transition of the 3-majority opinion dynamics with noisy interactions
por: d'Amore, Francesco, et al.
Publicado: (2021)

Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions
por: d'Amore, Francesco, et al.
Publicado: (2020)

Seed Selection in the Heterogeneous Moran Process
por: Petsinis, Petros, et al.
Publicado: (2024)

Modelling Network Resilience: The Complexity of Some Graph Division Games
por: Gutowski, Grzegorz, et al.
Publicado: (2026)

On the Graph Theory of Majority Illusions: Theoretical Results and Computational Experiments
por: Los, Maaike, et al.
Publicado: (2023)

Eliminating Illusion in Directed Networks
por: Jana, Sougata, et al.
Publicado: (2026)

Social Simulations with Large Language Model Risk Utopian Illusion
por: Bian, Ning, et al.
Publicado: (2025)

Constructive Separations from Gate Elimination
por: Carmosino, Marco, et al.
Publicado: (2026)

Seeding with Differentially Private Network Information
por: Liu, Yuxin, et al.
Publicado: (2023)

Oblivious Deletion Codes
por: Con, Roni, et al.
Publicado: (2025)

Space-bounded online Kolmogorov complexity is additive
por: Bauwens, Bruno, et al.
Publicado: (2025)

Decoding Balanced Linear Codes With Preprocessing
por: Bogdanov, Andrej, et al.
Publicado: (2025)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
por: Goyal, Rohan, et al.
Publicado: (2025)

Deterministic list decoding of Reed-Solomon codes
por: Chatterjee, Soham, et al.
Publicado: (2025)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
por: Li, Songsong, et al.
Publicado: (2025)

Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof
por: Bauwens, Bruno, et al.
Publicado: (2025)

Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
por: Goyal, Rohan, et al.
Publicado: (2025)

The Optimization of Random Tree Codes for Limited Computational Resources
por: Bacinoglu, B. Tan
Publicado: (2025)

Tight Quantum Time-Space Tradeoffs for Permutation Inversion
por: Akshima, et al.
Publicado: (2025)

Explicit Codes approaching Generalized Singleton Bound using Expanders
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
por: Drucker, Andrew, et al.
Publicado: (2024)

A lower bound on the field size of convolutional codes with a maximum distance profile and an improved construction
por: Chen, Zitan
Publicado: (2023)

Relaxed Local Correctability from Local Testing
por: Kumar, Vinayak M., et al.
Publicado: (2023)

Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
por: Fawzi, Omar, et al.
Publicado: (2023)

Improved PIR Schemes using Matching Vectors and Derivatives
por: Ghasemi, Fatemeh, et al.
Publicado: (2024)