Stochastic Embeddings of Graphs into Trees
Abstract
It is known that every graph with n vertices embeds stochastically into trees with distortion O( n). In this paper, we show that this upper bound is sharp for a large class of graphs. As this class of graphs contains diamond graphs, this result extends known examples that obtain this largest possible stochastic distortion.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.