How would you calculate something like a Hausdorff dimension of a graph given there’s no unique embedding in Euclidean space, but we still think of (for eg) bushy vs sparse branching etc? A long skinny DAG with few branches should be lower dim than dense random graph for eg 🤔
Conversation
Replying to
I'm pretty sure a graph simply has a hausdorff dimension of zero since the nodes are points and there's only one link between any two points. I suppose you could think of a graph with an uncountable number of nodes by constructing some set but that sounds a bit iffy
1
Replying to
You're technically correct, but that's why I said something *like* a hausdorff dimension that captures the sense of spatial density of an embedded graph

