On edge collapse of random simplicial complexes
From MaRDI portal
Cites work
- A simple solution to the k‐core problem
- Collapsibility and vanishing of top homology in random simplicial complexes
- Collapsibility of random clique complexes
- Computing persistent homology of flag complexes via strong collapses
- Concentration and moment inequalities for polynomials of independent random variables
- Concentration of multivariate polynomials and its applications
- Cores in random hypergraphs and Boolean formulas
- Edge Collapse and Persistence of Flag Complexes
- Filtration-Domination in Bifiltered Graphs
- Homological connectivity of random k -dimensional complexes
- Homological connectivity of random 2-complexes
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes
- On the method of typical bounded differences
- One‐sided sharp thresholds for homology of random flag complexes
- Random graphs.
- Random simplicial complexes: around the phase transition
- Simplicial spaces, nuclei and \(m\)-groups.
- Strong Collapse for Persistence
- Strong homotopy types, nerves and collapses
- Sudden emergence of a giant k-core in a random graph
- Swap, Shift and Trim to Edge Collapse a Filtration
- The threshold for d-collapsibility in random complexes
- The threshold function for vanishing of the top homology group of random d-complexes
- Thek-Core and Branching Processes
- Topology of random clique complexes
- Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
- When does the top homology of a random simplicial complex vanish?
This page was built for publication: On edge collapse of random simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895885)
