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

04/12/2023
by   Christian Borgs, et al.
0

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 ϵ. But given the existential nature of local limits, our arguments do not give any bound on the functional dependence of this constant on ϵ, nor do they give a bound on how large the graph has to be for the asymptotic additive error bound ϵ to hold.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2021

Locality of Random Digraphs on Expanders

We study random digraphs on sequences of expanders with bounded average ...
research
10/18/2021

Algorithms Using Local Graph Features to Predict Epidemics

We study a simple model of epidemics where an infected node transmits th...
research
05/30/2022

On the External Validity of Average-Case Analyses of Graph Algorithms

The number one criticism of average-case analysis is that we do not actu...
research
10/27/2017

On distance r-dominating and 2r-independent sets in sparse graphs

Dvorak (2013) gave a bound on the minimum size of a distance r dominatin...
research
05/19/2020

Coalition and Core in Resource Allocation and Exchange

In discrete exchange economies with possibly redundant and joint ownersh...
research
09/28/2022

Auditing for Core Stability in Participatory Budgeting

We consider the participatory budgeting problem where each of n voters s...
research
02/27/2018

Treedepth Bounds in Linear Colorings

Low-treedepth colorings are an important tool for algorithms that exploi...

Please sign up or login with your details

Forgot password? Click here to reset