Show simple item record

dc.contributor.authorSkraba, P
dc.contributor.authorThoppe, G
dc.contributor.authorYogeshwaran, D
dc.date.accessioned2020-05-18T08:51:18Z
dc.date.available2020-05-18T08:51:18Z
dc.date.issued2020-04-17
dc.identifier.citationSkraba, Primoz et al. "Randomly Weighted $D$-Complexes: Minimal Spanning Acycles And Persistence Diagrams". The Electronic Journal Of Combinatorics, vol 27, no. 2, 2020. The Electronic Journal Of Combinatorics, doi:10.37236/8679. Accessed 18 May 2020.en_US
dc.identifier.issn1077-8926
dc.identifier.urihttps://qmro.qmul.ac.uk/xmlui/handle/123456789/64138
dc.description.abstractA weighted d -complex is a simplicial complex of dimension d in which each face is assigned a real-valued weight. We derive three key results here concerning persistence diagrams and minimal spanning acycles (MSAs) of such complexes. First, we establish an equivalence between the MSA face-weights and death times in the persistence diagram. Next, we show a novel stability result for the MSA face-weights which, due to our first result, also holds true for the death and birth times, separately. Our final result concerns a perturbation of a mean-field model of randomly weighted d -complexes. The d -face weights here are perturbations of some i.i.d. distribution while all the lower-dimensional faces have a weight of 0 . If the perturbations decay sufficiently quickly, we show that suitably scaled extremal nearest face-weights, face-weights of the d -MSA, and the associated death times converge to an inhomogeneous Poisson point process. This result completely characterizes the extremal points of persistence diagrams and MSAs. The point process convergence and the asymptotic equivalence of three point processes are new for any weighted random complex model, including even the non-perturbed case. Lastly, as a consequence of our stability result, we show that Frieze's ζ ( 3 ) limit for random minimal spanning trees and the recent extension to random MSAs by Hino and Kanazawa also hold in suitable noisy settings.en_US
dc.publisherThe Electronic Journal of Combinatoricsen_US
dc.relation.ispartofELECTRONIC JOURNAL OF COMBINATORICS
dc.titleRandomly weighted d-complexes: Minimal spanning acycles and Persistence diagramsen_US
dc.typeArticleen_US
dc.rights.holder© 2020 The authors. Released under the CC BY license (International 4.0)
dc.identifier.doi10.37236/8679
pubs.author-urlhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000526058000006&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6aen_US
pubs.issue2en_US
pubs.notesNot knownen_US
pubs.publication-statusPublisheden_US
pubs.volume27en_US
rioxxterms.funderDefault funderen_US
rioxxterms.identifier.projectDefault projecten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record