Abstract

We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degrees, which are found by solving an optimization problem. Furthermore, we show that this optimization problem allows to design a linear-time, randomized algorithm that distinguishes between uniform random graphs and random graph models that create graphs with approximately a desired degree sequence: the power-law rank-1 inhomogeneous random graph. This algorithm uses the fact that some specific induced subgraphs appear significantly more often in uniform random graphs than in rank-1 inhomogeneous random graphs.

Highlights

  • Many networks were found to have a degree distribution that is well approximated by a power-law distribution with exponent τ ∈ (2, 3)

  • In the case of power-law degrees with exponent τ ∈ (2, 3) the probability of the configuration model resulting in a simple random graph vanishes, so that the configuration model cannot be used as a method to analyze power-law uniform random graphs [11]

  • We are interested in N (H ), the induced subgraph count of H, the number of subgraphs of URG(n)(d) that are isomorphic to H

Read more

Summary

Introduction

Many networks were found to have a degree distribution that is well approximated by a power-law distribution with exponent τ ∈ (2, 3). These power-law real-world networks are often modeled by random graphs: randomized mathematical models that create networks. The configuration model creates random multigraphs with a specified degree sequence, i.e., graphs where multiple edges and self-loops can be present. When conditioning on the event that the configuration model results in a simple graph, it is distributed as a uniform random graph. If the probability of the event that the configuration model results in a simple graph is sufficiently large, it is possible to translate results from the configuration model to the uniform random graph

Stegehuis
Main Results
37 Page 4 of 29
Optimizing the Subgraph Degrees
37 Page 6 of 29
Distinguishing Uniform Random Graphs from Rank-1 Inhomogeneous Random Graphs
37 Page 8 of 29
Subgraph Probability in the Uniform Random Graph
Optimizing the Probability of a Subgraph
37 Page 12 of 29
37 Page 14 of 29
Conditional Expectation
Variance of the Number of Induced Subgraphs
Major Contribution to General Subgraphs
37 Page 18 of 29
37 Page 20 of 29
37 Page 22 of 29
37 Page 24 of 29
37 Page 26 of 29
37 Page 28 of 29
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call