Search arXivSearch

arXiv · 2302.03611

Classifying Tree Topologies along Tropical Line Segments

Abstract

The space of phylogenetic trees arises naturally in tropical geometry as the tropical Grassmannian. Tropical geometry therefore suggests a natural notion of a tropical path between two trees, given by a tropical line segment in the tropical Grassmannian. It was previously conjectured that tree topologies along such a segment change by a combinatorial operation known as Nearest Neighbor Interchange (NNI). We provide counterexamples to this conjecture, but prove that changes in tree topologies along the tropical line segment are either NNI moves or "four clade rearrangement" moves for generic trees. In addition, we show that the number of NNI moves occurring along the tropical line segment can be as large as $n^2$, but the average number of moves when the two endpoint trees are chosen at random is $O(n (\log n)^4)$. This is in contrast with $O(n \log n)$, the average number of NNI moves needed to transform one tree into another.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shelby Cox. 2023-02-07. Classifying Tree Topologies along Tropical Line Segments. https://doi.org/10.2140/astat.2023.14.71

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO