A limit theorem for the 1st Betti number of layer-1 subgraphs in random graphs

11/01/2019
by   Minghao Tian, et al.
0

We initiate the study of local topology of random graphs. The high level goal is to characterize local "motifs" in graphs. In this paper, we consider what we call the layer-r subgraphs for an input graph G = (V,E): Specifically, the layer-r subgraph at vertex u ∈ V, denoted by G_u; r, is the induced subgraph of G over vertex set Δ_u^r:= {v ∈ V: d_G(u,v) = r }, where d_G is shortest-path distance in G. Viewing a graph as a 1-dimensional simplicial complex, we then aim to study the 1st Betti number of such subgraphs. Our main result is that the 1st Betti number of layer-1 subgraphs in Erdős–Rényi random graphs G(n,p) satisfies a central limit theorem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2023

Odd Chromatic Number of Graph Classes

A graph is called odd (respectively, even) if every vertex has odd (resp...
research
06/28/2020

Central limit theorems for local network statistics

Subgraph counts - in particular the number of occurrences of small shape...
research
12/16/2021

Min-cost-flow preserving bijection between subgraphs and orientations

Consider an undirected graph G=(V,E). A subgraph of G is a subset of its...
research
06/29/2020

Higher-order fluctuations in dense random graph models

Our main results are quantitative bounds in the multivariate normal appr...
research
09/02/2018

Mining Frequent Patterns in Evolving Graphs

Given a labeled graph, the frequent-subgraph mining (FSM) problem asks t...
research
04/06/2020

Graph Distances and Clustering

With a view on graph clustering, we present a definition of vertex-to-ve...
research
06/18/2020

An Alon-Boppana theorem for powered graphs and generalized Ramanujan graphs

The r-th power of a graph modifies a graph by connecting every vertex pa...

Please sign up or login with your details

Forgot password? Click here to reset