Showing math.PRShow all
2 papers · 1 filter
math.PR2020
The diameter of the minimum spanning tree of the complete graph with inhomogeneous random weights
Othmane Safsafi
We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is giv…
math.PR2020
Exponential bounds for inhomogeneous random graphs in a Gaussian case
Othmane Safsafi
Rank 1 inhomogeneous random graphs are a natural generalization of Erdős Rényi random graphs. In this generalization each node is given a weight. Then the probability that an edge…