# Distributions of restricted rotation distances

### Abstract

Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a single rotation. There are no known efficient algorithms to compute rotation distance between trees and thus distances in rotation graphs. Limiting the allowed locations of where rotations are permitted gives rise to a number of notions related to rotation distance. Allowing rotations at a minimal such set of locations gives restricted rotation distance. There are linear-time algorithms to compute restricted rotation distance, where there are only two permitted locations for rotations to occur. The associated restricted rotation graph has an efficient distance algorithm. There are linear upper and lower bounds on restricted rotation distance with respect to the sizes of the reduced tree pairs. Here, we experimentally investigate the expected restricted rotation distance between two trees selected at random of increasing size and find that it lies typically in a narrow band well within the earlier proven linear upper and lower bounds.