A new family of distances over partially ordered sets

Abstract: Order theory is increasingly relevant in applications where data is naturally structured as a partially ordered set (poset), often requiring meaningful notions of distance over posets. In this paper, we introduce a new family of extended metrics on path-connected and fence-connected posets that do not require additional structure. Unlike many existing distances, these metrics are not induced by valuations, but instead arise as a type of shortest-path distance determined by both path length and the number of alternations. For discrete posets, we show that these metrics converge to a type of shortest-fence metric. Our main result establishes that these metrics characterize most discrete path-connected posets up to isomorphism, and up to duality for modular posets. Finally, we prove that this family defines interleaving distances when posets are viewed as thin categories.