Recursive Formula for Labeled Graph Enumeration

12/31/2019
by   Ravi Goyal, et al.
0

This manuscript presents a general recursive formula to estimate the size of fibers associated with algebraic maps from graphs to summary statistics of importance for social network analysis, such as number of edges (graph density), degree sequence, degree distribution, mixing by nodal covariates, and degree mixing. That is, the formula estimates the number of labeled graphs that have given values for network properties. The proposed approach can be extended to additional network properties (e.g., clustering) as well as properties of bipartite networks. For special settings in which alternative formulas exist, simulation studies demonstrate the validity of the proposed approach. We illustrate the approach for estimating the size of fibers associated with the Barabási–Albert model for the properties of degree distribution and degree mixing. In addition, we demonstrate how the approach can be used to assess the diversity of graphs within a fiber.

READ FULL TEXT

page 8

page 10

research
08/13/2020

On Testability of First-Order Properties in Bounded-Degree Graphs

We study property testing of properties that are definable in first-orde...
research
02/26/2020

Assortativity and bidegree distributions on Bernoulli random graph superpositions

A probabilistic generative network model with n nodes and m overlapping ...
research
09/26/2020

Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties

We show that if the degree sequence of a graph G is close in ℓ_1-distanc...
research
01/09/2023

Digraph redicolouring

Given two k-dicolourings of a digraph D, we prove that it is PSPACE-comp...
research
10/30/2020

Glauber dynamics for colourings of chordal graphs and graphs of bounded treewidth

The Glauber dynamics on the colourings of a graph is a random process wh...
research
04/04/2022

A PRticle filter algorithm for nonparametric estimation of multivariate mixing distributions

Predictive recursion (PR) is a fast, recursive algorithm that gives a sm...
research
08/05/2019

Incorporating Structural Stigma into Network Analysis

A rich literature has explored the modeling of homophily and other forms...

Please sign up or login with your details

Forgot password? Click here to reset