
On the Connectivity and the Diameter of BetweennessUniform Graphs
Betweenness centrality is a centrality measure based on the overall amou...
read it

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...
read it

A SelfStabilizing Minimal kGrouping Algorithm
We consider the minimal kgrouping problem: given a graph G=(V,E) and a ...
read it

Diameter constrained Steiner tree and related problems
We give a dynamic programming solution to find the minimum cost of a dia...
read it

Isodiametry, variance, and regular simplices from particle interactions
Consider a pressureless gas interacting through an attractiverepulsive ...
read it

Minimum stationary values of sparse random directed graphs
We consider the stationary distribution of the simple random walk on the...
read it

Constructions of betweennessuniform graphs from trees
Betweenness centrality is a measure of the importance of a vertex x insi...
read it
The diameter of the directed configuration model
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 outdegree 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
Comments
There are no comments yet.