Copertina

Efficient set-theoretic algorithms for computing high-order Forman-Ricci curvature on abstract simplicial complexes

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	de Souza, Danillo Barros, da Cunha, Jonatas T. S., Santos, Fernando A. N., Jost, Jürgen, Rodrigues, Serafim
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Analysis, Statistics and Probability Discrete Mathematics Performance Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Efficient Decomposition of Forman-Ricci Curvature on Vietoris-Rips Complexes and Data Applications
di: de Souza, Danillo Barros, et al.
Pubblicazione: (2025)

Alternative set-theoretical algorithms for efficient computations of cliques in Vietoris-Rips complexes
di: de Souza, Danillo Barros, et al.
Pubblicazione: (2025)

Sunflowers in set systems with small VC-dimension
di: Balogh, József, et al.
Pubblicazione: (2024)

Graph-theoretical estimates of the diameters of the Rubik's Cube groups
di: Hirata, So
Pubblicazione: (2024)

First order complexity of finite random structures
di: Demin, Danila, et al.
Pubblicazione: (2024)

Canonical labelling of random regular graphs
di: Isaev, Mikhail, et al.
Pubblicazione: (2026)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
di: Chinyaev, Boris
Pubblicazione: (2025)

A threshold for online balancing of sparse i.i.d. vectors
di: Altschuler, Dylan J., et al.
Pubblicazione: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
di: Gurvits, Leonid, et al.
Pubblicazione: (2023)

Speeding up random walk mixing by starting from a uniform vertex
di: Díaz, Alberto Espuny, et al.
Pubblicazione: (2022)

Limit Laws for Critical Dispersion on Complete Graphs
di: De Ambroggio, Umberto, et al.
Pubblicazione: (2024)

Zero-One Laws for Random Feasibility Problems
di: Altschuler, Dylan J.
Pubblicazione: (2023)

Shotgun assembly of random graphs
di: Johnston, Tom, et al.
Pubblicazione: (2022)

Infinite Schnyder Woods
di: Addario-Berry, Louigi, et al.
Pubblicazione: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
di: Li, Ray, et al.
Pubblicazione: (2025)

Approximate polymorphisms of predicates
di: Alekseev, Yaroslav, et al.
Pubblicazione: (2025)

Record-biased permutations and their permuton limit
di: Bouvel, Mathilde, et al.
Pubblicazione: (2024)

A Proof of Talagrand's Creating Large Sets Conjecture
di: Fang, Xuan, et al.
Pubblicazione: (2025)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
di: Pham, Huy Tuan
Pubblicazione: (2024)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
di: Tiskin, Alexander
Pubblicazione: (2022)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
di: Gamarnik, David, et al.
Pubblicazione: (2023)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Minimum stationary values of sparse random directed graphs
di: Cai, Xing Shi, et al.
Pubblicazione: (2020)

Spread blow-up lemma with an application to perturbed random graphs
di: Nenadov, Rajko, et al.
Pubblicazione: (2024)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
di: Gajjala, Rishikesh
Pubblicazione: (2026)

A binomial random multigraph
di: Pelekis, Christos
Pubblicazione: (2023)

A lower bound on the spectrum of unimodular networks
di: Rahman, Mustazee
Pubblicazione: (2016)

Random 0/1-polytopes expand rapidly
di: Guo, He, et al.
Pubblicazione: (2026)

Strong spatial mixing for colorings on trees and its algorithmic applications
di: Chen, Zongchen, et al.
Pubblicazione: (2023)

Decoupling of clusters in independent sets in a percolated hypercube
di: Chowdhury, Mriganka Basu Roy, et al.
Pubblicazione: (2025)

Gaussian to log-normal transition for independent sets in a percolated hypercube
di: Chowdhury, Mriganka Basu Roy, et al.
Pubblicazione: (2024)

Rapid mixing of the flip chain over non-crossing spanning trees
di: Anand, Konrad, et al.
Pubblicazione: (2024)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
di: Bencs, Ferenc, et al.
Pubblicazione: (2023)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
di: Aigner-Horev, Elad, et al.
Pubblicazione: (2023)

On the clique number of random Cayley graphs and related topics
di: Conlon, David, et al.
Pubblicazione: (2024)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
di: Wang, Geyang, et al.
Pubblicazione: (2025)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
di: Marić, Nevena
Pubblicazione: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
di: Wang, Geyang, et al.
Pubblicazione: (2026)

Cutoff profile of the Metropolis biased card shuffling
di: Zhang, Lingfu
Pubblicazione: (2022)

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration
di: Bangachev, Kiril, et al.
Pubblicazione: (2024)