Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2304.06170

Locality via Global Ties: Stability of the 2-Core Against Misspecification

Christian Borgs·Geng Zhao
View original source ↗Read source document ↗Export metadata ↓

Abstract

For many random graph models, the analysis of a related birth process suggests local sampling algorithms for the size of, e.g., the giant connected component, the $k$-core, the size and probability of an epidemic outbreak, etc. In this paper, we study the question of when these algorithms are robust against misspecification of the graph model, for the special case of the 2-core. We show that, for locally converging graphs with bounded average degrees, under a weak notion of expansion, a local sampling algorithm provides robust estimates for the size of both the 2-core and its largest component. Our weak notion of expansion generalizes the classical definition of expansion, while holding for many well-studied random graph models. Our method involves a two-step sprinkling argument. In the first step, we use sprinkling to establish the existence of a non-empty $2$-core inside the giant, while in the second, we use this non-empty $2$-core as seed for a second sprinkling argument to establish that the giant contains a linear sized $2$-core. The second step is based on a novel coloring scheme for the vertices in the tree-part. Our algorithmic results follow from the structural properties for the $2$-core established in the course of our sprinkling arguments. The run-time of our local algorithm is constant independent of the graph size, with the value of the constant depending on the desired asymptotic accuracy $\epsilon$. But given the existential nature of local limits, our arguments do not give any bound on the functional dependence of this constant on $\epsilon$, nor do they give a bound on how large the graph has to be for the asymptotic additive error bound $\epsilon$ to hold.

Explore related subjects

cs.DSmath.PR

Keep this discovery

BibTeXRIS

Christian Borgs, Geng Zhao. 2023-04-12. Locality via Global Ties: Stability of the 2-Core Against Misspecification. https://arxiv.org/abs/2304.06170

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗