Zobrazeno 1 - 10
of 91
pro vyhledávání: '"Forcey, Stefan"'
Autor:
Devadoss, Satyan L., Forcey, Stefan
We demonstrate a graphical map, a new correspondence between circular electrical networks and circular planar split systems. When restricted to the planar circular electrical case, this graphical map finds the split system associated uniquely to the
Externí odkaz:
http://arxiv.org/abs/2408.03431
Autor:
Forcey, Stefan
We study a new invariant of circular planar electrical networks, well known to phylogeneticists: the circular split system. We use our invariant to answer some open questions about levels of complexity of networks and their related Kalmanson metrics.
Externí odkaz:
http://arxiv.org/abs/2108.00550
Autor:
Forcey, Stefan, Scalzo, Drew
Phylogenetic networks are notoriously difficult to reconstruct. Here we suggest that it can be useful to view unknown genetic distance along edges in phylogenetic networks as analogous to unknown resistance in electric circuits. This resistance dista
Externí odkaz:
http://arxiv.org/abs/2007.13574
Autor:
Forcey, Stefan, Scalzo, Drew
We describe Galois connections which arise between two kinds of combinatorial structures, both of which generalize trees with labelled leaves, and then apply those connections to a family of polytopes. The graphs we study can be imbued with metric pr
Externí odkaz:
http://arxiv.org/abs/2004.11944
Autor:
Forcey, Stefan, Ronco, María
M. Carr and S. Devadoss introduced in [7] the notion of tubing on a finite simple graph $\Gamma$, in the context of configuration spaces on the Hilbert plane. To any finite simple graph $\Gamma$ they associated a finite partially ordered set, whose e
Externí odkaz:
http://arxiv.org/abs/1910.00670
Phylogenetics begins with reconstructing biological family trees from genetic data. Since Nature is not limited to tree-like histories, we use networks to organize our data, and have discovered new polytopes, metric spaces, and simplicial complexes t
Externí odkaz:
http://arxiv.org/abs/1905.11225
Autor:
Durell, Cassandra, Forcey, Stefan
Balanced minimum evolution is a distance-based criterion for the reconstruction of phylogenetic trees. Several algorithms exist to find the optimal tree with respect to this criterion. One approach is to minimize a certain linear functional over an a
Externí odkaz:
http://arxiv.org/abs/1905.09160
Publikováno v:
Algebr. Geom. Topol. 19 (2019) 1019-1078
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We put these tr
Externí odkaz:
http://arxiv.org/abs/1608.08546
Understanding the face structure of the balanced minimal evolution (BME) polytope, especially its top-dimensional facets, is crucially important to phylogenetic applications. We show that BME polytope has a sub-lattice of its poset of faces which is
Externí odkaz:
http://arxiv.org/abs/1608.01622
A distance-based method to reconstruct a phylogenetic tree with $n$ leaves takes a distance matrix, $n \times n$ symmetric matrix with $0$s in the diagonal, as its input and reconstructs a tree with $n$ leaves using tools in combinatorics. A safety r
Externí odkaz:
http://arxiv.org/abs/1507.08734