The diameter of the directed configuration model

03/10/2020
by   Xing Shi Cai, et al.
0

We show that the diameter of the directed configuration model with n vertices rescaled by log n converges in probability to a constant. Our assumptions are the convergence of the in- and out-degree of a uniform random vertex in distribution, first and second moment. Our result extends previous results on the diameter of the model and applies to many other random directed graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2021

On the Connectivity and the Diameter of Betweenness-Uniform Graphs

Betweenness centrality is a centrality measure based on the overall amou...
research
04/10/2020

The giant component of the directed configuration model revisited

We prove a law of large numbers for the order and size of the largest st...
research
07/25/2019

A Self-Stabilizing Minimal k-Grouping Algorithm

We consider the minimal k-grouping problem: given a graph G=(V,E) and a ...
research
11/25/2021

New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the √(n) Barrier

For an n-vertex digraph G=(V,E), a shortcut set is a (small) subset of e...
research
07/31/2019

Isodiametry, variance, and regular simplices from particle interactions

Consider a pressureless gas interacting through an attractive-repulsive ...
research
10/18/2021

Diameter constrained Steiner tree and related problems

We give a dynamic programming solution to find the minimum cost of a dia...
research
10/14/2020

Minimum stationary values of sparse random directed graphs

We consider the stationary distribution of the simple random walk on the...

Please sign up or login with your details

Forgot password? Click here to reset