The scaling of the minimum sum of edge lengths in uniformly random trees
From MaRDI portal
Publication:3302733
DOI10.1088/1742-5468/2016/06/063401zbMath1456.68128arXiv1602.07940OpenAlexW2274259205MaRDI QIDQ3302733
Juan Luis Esteban, Ramon Ferrer-i-Cancho, C. Gómez-Rodríguez
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07940
Programming involving graphs or networks (90C35) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees ⋮ Are crossing dependencies really scarce? ⋮ Edge crossings in random linear arrangements ⋮ Bounds of the sum of edge lengths in linear arrangements of trees
Cites Work
- Unnamed Item
- Unnamed Item
- On optimal linear arrangements of trees
- Optimal cuts in graphs and statistical mechanics
- Optimal one-page tree embeddings in linear time
- Enumeration of noncrossing trees on a circle
- Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph.
- The number of trees
- Emergence of Scaling in Random Networks
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- SOME WORD ORDER BIASES FROM LIMITED BRAIN RESOURCES: A MATHEMATICAL APPROACH
- Dynamical Processes on Complex Networks
- A Minimum Linear Arrangement Algorithm for Undirected Trees
- A critical point for random graphs with a given degree sequence
- Collective dynamics of ‘small-world’ networks
- Networks
This page was built for publication: The scaling of the minimum sum of edge lengths in uniformly random trees
