The scaling of the minimum sum of edge lengths in uniformly random trees

@article{Esteban2016TheSO,
  title={The scaling of the minimum sum of edge lengths in uniformly random trees},
  author={J. L. Esteban and Ramon Ferrer-i-Cancho and Carlos G{\'o}mez-Rodr{\'i}guez},
  journal={ArXiv},
  year={2016},
  volume={abs/1602.07940}
}
  • J. L. Esteban, Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez
  • Published 2016
  • Mathematics, Computer Science, Physics
  • ArXiv
  • The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial time, they have remained theoretical and have not been implemented in practical contexts to our knowledge. Here we use one of those algorithms to investigate the growth of this sum as a function of the size of the tree in uniformly random trees. We show that… CONTINUE READING
    12 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    The variation of the sum of edge lengths in linear arrangements of trees
    • 1
    • PDF
    Edge crossings in random linear arrangements
    • 4
    • PDF
    The sum of edge lengths in random linear arrangements
    • 6
    • PDF
    A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees
    • 7
    • PDF
    Random crossings in dependency trees
    • 11
    • PDF
    Dependency distance: A new perspective on syntactic patterns in natural languages.
    • 86
    Are crossing dependencies really scarce?
    • 15
    • PDF

    References

    SHOWING 1-10 OF 53 REFERENCES
    Minimum Linear Arrangement of Trees
    • 3
    Optimal one-page tree embeddings in linear time
    • 10
    • PDF
    Generating random spanning trees
    • A. Broder
    • Mathematics, Computer Science
    • 30th Annual Symposium on Foundations of Computer Science
    • 1989
    • 343
    • PDF
    ON OPTIMAL LINEAR ARRANGEMENTS OF TREES
    • 51
    • PDF
    A Minimum Linear Arrangement Algorithm for Undirected Trees
    • Y. Shiloach
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1979
    • 99
    • Highly Influential
    Spanning trees in two dimensions.
    • Manna, Dhar, Majumdar
    • Physics, Medicine
    • Physical review. A, Atomic, molecular, and optical physics
    • 1992
    • 27
    A Critical Point for Random Graphs with a Given Degree Sequence
    • 1,979
    • PDF
    The Number of Trees
    • 424
    • PDF
    A survey of graph layout problems
    • 586
    • PDF
    The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
    • D. Aldous
    • Mathematics, Computer Science
    • SIAM J. Discret. Math.
    • 1990
    • 264
    • PDF