Edge crossings in random linear arrangements

DOI10.1088/1742-5468/ab6845zbMath1456.05119arXiv1910.03926OpenAlexW2979516301MaRDI QIDQ5135062

Lluís Alemany-Puig, Ramon Ferrer-i-Cancho

Publication date: 19 November 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.03926

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Reappraising the distribution of the number of edge crossings of graphs on a sphere ⋮ Bounds of the sum of edge lengths in linear arrangements of trees

Uses Software

• nauty
• Traces

Cites Work

• The book thickness of a graph
• Statistics on non-crossing trees
• Morphogenesis of spatial networks
• Are crossing dependencies really scarce?
• Practical graph isomorphism. II.
• Random k -noncrossing RNA structures
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• The scaling of the minimum sum of edge lengths in uniformly random trees
• On the Maximum Crossing Number
• Introduction to Quantum Fields on a Lattice
• On the Distribution of Crossings in Random Complete Graphs
• Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability
• Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge crossings in random linear arrangements