Tag
Mathematicians have proven the long-standing sandwich conjecture in graph theory, showing that large random graphs can be approximated between two simpler graphs, connecting different random processes and advancing the field.
This paper analyzes distance-preserving embeddings in inhomogeneous random graphs, providing tighter distortion bounds than classical worst-case results and introducing a GNN-augmented variant that learns universal features from small graphs.
Amazon discusses the evolution of flat datacenter network topologies, from theoretical expander graphs to practical implementations like VL2 and Jellyfish, and current research into Penrose tiling-based designs at AWS.