Monte Carlo: Triangle Inequality in Fully Connected Graphs

This chart estimates the probability that all triangles in a random complete graph with edge weights drawn from Uniform(0.1, ln(N)) satisfy the triangle inequality. Each data point is based on a Monte Carlo simulation.