Cover Image

Random Abstract Cell Complexes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hoppe, Josef, Schaub, Michael T.
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Discrete Mathematics Social and Information Networks Algebraic Topology
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
by: Davot, Tom, et al.
Published: (2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
by: Basu, Sabyasachi, et al.
Published: (2024)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
by: Li, Songhua, et al.
Published: (2023)

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
by: Vombatkere, Karan, et al.
Published: (2026)

Aggregating maximal cliques in real-world graphs
by: Alon, Noga, et al.
Published: (2025)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
by: Huang, Yufan, et al.
Published: (2023)

Spectral Triadic Decompositions of Real-World Networks
by: Basu, Sabyasachi, et al.
Published: (2022)

A Structural Equivalence of Symmetric TSP to a Constrained Group Steiner Tree Problem
by: Arslanoğlu, Yılmaz
Published: (2026)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
by: Li, Zihao, et al.
Published: (2024)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
by: Dudeja, Aditi, et al.
Published: (2024)

Random local access for sampling k-SAT solutions
by: Dong, Dingding, et al.
Published: (2024)

Efficient Online Random Sampling via Randomness Recycling
by: Draper, Thomas L., et al.
Published: (2025)

The Complexity of Diameter on H-free graphs
by: Oostveen, Jelle J., et al.
Published: (2024)

Parameterized Complexity of Path Set Packing
by: Aravind, N. R., et al.
Published: (2022)

Parameterized Complexity of Submodular Minimization under Uncertainty
by: Kakimura, Naonori, et al.
Published: (2024)

Terminal Steiner tree problem : Complexity and Algorithms
by: S, Jyothish, et al.
Published: (2026)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
by: Efthymiou, Charilaos, et al.
Published: (2023)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
by: Bentert, Matthias, et al.
Published: (2024)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
by: Li, Xiaxin, et al.
Published: (2024)

Deletion-correcting codes for an adversarial nanopore channel
by: Xie, Huiling, et al.
Published: (2026)

Double-Ended Palindromic Trees in Linear Time
by: Wang, Qisheng, et al.
Published: (2022)

Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time
by: Li, Xiaxin, et al.
Published: (2025)

Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings
by: Brlek, Srečko, et al.
Published: (2024)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
by: Gaikwad, Ajinkya
Published: (2025)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
by: Bentert, Matthias, et al.
Published: (2026)

An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
by: Arndt, Stephen, et al.
Published: (2026)

Non-adaptive Learning of Random Hypergraphs with Queries
by: Austhof, Bethany, et al.
Published: (2025)

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Don't be Afraid of Cell Complexes! An Introduction from an Applied Perspective
by: Hoppe, Josef, et al.
Published: (2025)

Tight Bounds for Sparsifying Random CSPs
by: Brakensiek, Joshua, et al.
Published: (2025)

Packing $K_r$s in bounded degree graphs
by: McKay, Michael, et al.
Published: (2022)

Tight Localizations of Feedback Sets
by: Hecht, Michael, et al.
Published: (2020)

Approximation Algorithms for Optimal Hopsets
by: Dinitz, Michael, et al.
Published: (2025)

A Uniformly Random Solution to Algorithmic Redistricting
by: Cai, Jin-Yi, et al.
Published: (2024)

The Complexity of Homomorphism Reconstruction Revisited
by: Gervens, Timo, et al.
Published: (2026)

Fairness in Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2021)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
by: Mömke, Tobias, et al.
Published: (2024)

The Instability of all Backoff Protocols
by: Goldberg, Leslie Ann, et al.
Published: (2026)

Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity
by: Zhan, Yongjian
Published: (2026)