Amanatidis, Georgios and Kleer, Pieter (2024) Approximately Sampling and Counting Graphs with Near-Regular Degree Intervals. SIAM Journal on Discrete Mathematics. (In Press)
Amanatidis, Georgios and Kleer, Pieter (2024) Approximately Sampling and Counting Graphs with Near-Regular Degree Intervals. SIAM Journal on Discrete Mathematics. (In Press)
Amanatidis, Georgios and Kleer, Pieter (2024) Approximately Sampling and Counting Graphs with Near-Regular Degree Intervals. SIAM Journal on Discrete Mathematics. (In Press)
Abstract
The approximate uniform sampling of graphs with a given degree sequence is a well-known, extensively studied problem in theoretical computer science and has significant applications, e.g., in the analysis of social networks. In this work we study a generalization of the problem, where degree intervals are specified instead of a single degree sequence. We are interested in sampling and counting graphs whose degree sequences satisfy the corresponding degree interval constraints. A natural scenario where this problem arises is in hypothesis testing on networks that are only partially observed. We provide the first fully polynomial almost uniform sampler (FPAUS) as well as the first fully polynomial randomized approximation scheme (FPRAS) for sampling and counting, respectively, graphs with near-regular degree intervals, i.e., graphs in which every node has a degree from an interval not too far away from a given r ∈ N. In order to design our FPAUS, we rely on various state-of-the-art tools from Markov chain theory and combinatorics. In particular, by carefully using Markov chain decomposition and comparison arguments, we reduce part of our problem to the recent breakthrough of Anari, Liu, Oveis Gharan, and Vinzant (2019) on sampling a base of a matroid under a strongly log-concave probability distribution, and we provide the first non-trivial algorithmic application of a breakthrough asymptotic enumeration formula of Liebenau and Wormald (2017). As a more direct approach, we also study a natural Markov chain recently introduced by Rechner, Strowick and M¨uller-Hannemann (2018), based on three local operations—switches, hinge flips, and additions/deletions of an edge. We obtain the first theoretical results for this Markov chain, showing it is rapidly mixing for the case of near-regular degree intervals of size at most one.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | graph sampling, switch Markov chain, degree intervals |
Divisions: | Faculty of Science and Health > Mathematics, Statistics and Actuarial Science, School of |
SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
Depositing User: | Unnamed user with email elements@essex.ac.uk |
Date Deposited: | 31 Oct 2024 18:31 |
Last Modified: | 31 Oct 2024 18:31 |
URI: | http://repository.essex.ac.uk/id/eprint/39515 |
Available files
Filename: Kleer_Amanatidis_2024_final_Tex.pdf