Saved in:
| Main Authors: | Luevano, Manuel de J., Puga, Alejandro |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.00319 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
All Kolmogorov complexity functions are optimal, but are some more optimal?
by: Bauwens, Bruno, et al.
Published: (2025)
by: Bauwens, Bruno, et al.
Published: (2025)
On the existence of Ulanowicz's optimal structural resilience in complex networks
by: Wei, Si-Yao, et al.
Published: (2026)
by: Wei, Si-Yao, et al.
Published: (2026)
Individual testing is optimal for nonadaptive group testing in the linear regime
by: Aldridge, Matthew
Published: (2018)
by: Aldridge, Matthew
Published: (2018)
An additively optimal interpreter for approximating Kolmogorov prefix complexity
by: Leyva-Acosta, Zoe, et al.
Published: (2024)
by: Leyva-Acosta, Zoe, et al.
Published: (2024)
Weighted cycle-based identification of influential node groups in complex networks
by: Zheng, Wenxin, et al.
Published: (2025)
by: Zheng, Wenxin, et al.
Published: (2025)
A scalable estimator of higher-order information in complex dynamical systems
by: Liardi, Alberto, et al.
Published: (2025)
by: Liardi, Alberto, et al.
Published: (2025)
Infinite families of optimal and minimal codes over rings using simplicial complexes
by: Wu, Yanan, et al.
Published: (2024)
by: Wu, Yanan, et al.
Published: (2024)
On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
by: Estevan, Asier, et al.
Published: (2024)
by: Estevan, Asier, et al.
Published: (2024)
Cross-order induced behaviors in contagion dynamics on higher-order networks
by: Danovski, Kaloyan, et al.
Published: (2026)
by: Danovski, Kaloyan, et al.
Published: (2026)
On the reconstruction limits of complex networks
by: Murphy, Charles, et al.
Published: (2024)
by: Murphy, Charles, et al.
Published: (2024)
Weighted Chernoff information and optimal loss exponent in context-sensitive hypothesis testing
by: Kelbert, Mark, et al.
Published: (2026)
by: Kelbert, Mark, et al.
Published: (2026)
Nonparametric inference of higher order interaction patterns in networks
by: Wegner, Anatol E., et al.
Published: (2024)
by: Wegner, Anatol E., et al.
Published: (2024)
Maximum entropy based testing in network models: ERGMs and constrained optimization
by: Ghosh, Subhro, et al.
Published: (2026)
by: Ghosh, Subhro, et al.
Published: (2026)
A scalable, synergy-first backbone decomposition of higher-order structures in complex systems
by: Varley, Thomas F.
Published: (2024)
by: Varley, Thomas F.
Published: (2024)
A communication protocol based on NK boolean networks for coordinating collective action
by: Ong, Yori
Published: (2024)
by: Ong, Yori
Published: (2024)
Information-theoretic reduction of deep neural networks to linear models in the overparametrized proportional regime
by: Camilli, Francesco, et al.
Published: (2025)
by: Camilli, Francesco, et al.
Published: (2025)
The topology of synergy: linking topological and information-theoretic approaches to higher-order interactions in complex systems
by: Varley, Thomas F., et al.
Published: (2025)
by: Varley, Thomas F., et al.
Published: (2025)
Is speckle noise more challenging to mitigate than additive noise?
by: Malekian, Reihaneh, et al.
Published: (2024)
by: Malekian, Reihaneh, et al.
Published: (2024)
Information-optimal measurement: From fixed sampling protocols to adaptive spectroscopy
by: Schroeder, J., et al.
Published: (2025)
by: Schroeder, J., et al.
Published: (2025)
Is star complexity a proxy for information based complexity of graphs?
by: Standish, Russell K.
Published: (2025)
by: Standish, Russell K.
Published: (2025)
Order-theoretic models for decision-making: Learning, optimization, complexity and computation
by: Hack, Pedro
Published: (2024)
by: Hack, Pedro
Published: (2024)
Generalized informational functionals and new monotone measures of statistical complexity
by: Iagar, Razvan Gabriel, et al.
Published: (2025)
by: Iagar, Razvan Gabriel, et al.
Published: (2025)
Fractal spatio-temporal scale-free messaging: amplitude modulation of self-executable carriers given by the Weierstrass function's components
by: Zenil, Hector, et al.
Published: (2024)
by: Zenil, Hector, et al.
Published: (2024)
Near-optimal Rank Adaptive Inference of High Dimensional Matrices
by: Zheng, Frédéric, et al.
Published: (2025)
by: Zheng, Frédéric, et al.
Published: (2025)
Stable recovery of complex dictionary-sparse signals from phaseless measurements
by: Xia, Lianxing, et al.
Published: (2025)
by: Xia, Lianxing, et al.
Published: (2025)
High-probability sample complexities for policy evaluation with linear function approximation
by: Li, Gen, et al.
Published: (2023)
by: Li, Gen, et al.
Published: (2023)
Higher order definition of causality by optimally conditioned transfer entropy
by: Kořenek, Jakub, et al.
Published: (2024)
by: Kořenek, Jakub, et al.
Published: (2024)
To spike or not to spike: the whims of the Wonham filter in the strong noise regime
by: Bernardin, Cédric, et al.
Published: (2022)
by: Bernardin, Cédric, et al.
Published: (2022)
Neural collapse in the orthoplex regime
by: Alcala, James, et al.
Published: (2026)
by: Alcala, James, et al.
Published: (2026)
TopoLa: a novel embedding framework for understanding complex networks
by: Zheng, Kai, et al.
Published: (2024)
by: Zheng, Kai, et al.
Published: (2024)
The complexity of elliptic normal bases
by: Panario, Daniel, et al.
Published: (2024)
by: Panario, Daniel, et al.
Published: (2024)
Information entropy of complex probability
by: Li, Chan, et al.
Published: (2025)
by: Li, Chan, et al.
Published: (2025)
An optimal tradeoff between entanglement and copy complexity for state tomography
by: Chen, Sitan, et al.
Published: (2024)
by: Chen, Sitan, et al.
Published: (2024)
On the $(k,\ell)$-multiset anonymity measure for social graphs
by: Estrada-Moreno, Alejandro, et al.
Published: (2025)
by: Estrada-Moreno, Alejandro, et al.
Published: (2025)
Uniquely optimal codes of low complexity are symmetric
by: King, Emily J., et al.
Published: (2020)
by: King, Emily J., et al.
Published: (2020)
Quantum Channel Simulation in Fidelity is no more difficult than State Splitting
by: Cao, Michael X., et al.
Published: (2024)
by: Cao, Michael X., et al.
Published: (2024)
To BEE or not to BEE: Estimating more than Entropy with Biased Entropy Estimators
by: la Torre, Ilaria Pia, et al.
Published: (2025)
by: la Torre, Ilaria Pia, et al.
Published: (2025)
On Error Thresholds for Pauli Channels: Some answers with many more questions
by: Agarwal, Avantika, et al.
Published: (2026)
by: Agarwal, Avantika, et al.
Published: (2026)
Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing
by: Liu, Xiaoqi, et al.
Published: (2022)
by: Liu, Xiaoqi, et al.
Published: (2022)
Total/dual correlation/coherence, redundancy/synergy, complexity, and O-information for real and complex valued multivariate data
by: Pascual-Marqui, Roberto D., et al.
Published: (2025)
by: Pascual-Marqui, Roberto D., et al.
Published: (2025)
Similar Items
-
All Kolmogorov complexity functions are optimal, but are some more optimal?
by: Bauwens, Bruno, et al.
Published: (2025) -
On the existence of Ulanowicz's optimal structural resilience in complex networks
by: Wei, Si-Yao, et al.
Published: (2026) -
Individual testing is optimal for nonadaptive group testing in the linear regime
by: Aldridge, Matthew
Published: (2018) -
An additively optimal interpreter for approximating Kolmogorov prefix complexity
by: Leyva-Acosta, Zoe, et al.
Published: (2024) -
Weighted cycle-based identification of influential node groups in complex networks
by: Zheng, Wenxin, et al.
Published: (2025)