Tight bounds for popping algorithms

DOI10.1002/rsa.20928zbMath1453.62542arXiv1807.01680OpenAlexW3023815738MaRDI QIDQ5136919

Kun He, Heng Guo

Publication date: 30 November 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.01680

zbMATH Keywords

network reliabilityuniform samplingcluster-popping algorithmspanning-trees

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Sampling theory, sample surveys (62D05) Pattern recognition, speech recognition (68T10) Neural nets and related approaches to inference from stochastic processes (62M45)

Related Items (3)

Perfect sampling from spatial mixing ⋮ Approximately counting bases of bicircular matroids ⋮ Dynamic Sampling from Graphical Models

This page was built for publication: Tight bounds for popping algorithms