A characterization of horizontal visibility graphs and combinatorics on words
نویسندگان
چکیده
An Horizontal Visibility Graph (for short, HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis of time series, their degree distribution being a good discriminator between randomness and chaos [B. Luque, et al., Phys. Rev. E 80 (2009), 046103]. We prove that a graph is an HVG if and only if outerplanar and has a Hamilton path. Therefore, an HVG is a noncrossing graph, as defined in algebraic combinatorics [P. Flajolet and M. Noy, Discrete Math., 204 (1999) 203-229]. Our characterization of HVGs implies a linear time recognition algorithm. Treating ordered sets as words, we characterize subfamilies of HVGs highlighting various connections with combinatorial statistics and introducing the notion of a visible pair. With this technique we determine asymptotically the average number of edges of HVGs.
منابع مشابه
Analysis of the Effect of Wind Speed and Soil Moisture on Horizontal Visibility Variations Caused by Dust Event in Arid Regions (Study Region: Southeast of Iran)
Introduction: Increasing or reducing the production of suspended particles depends on the important climatic and terrestrial characteristics of a region. One of the most important climatic factors affecting soil erosion is wind speed, so if the surface winds speed in a region exceeds the threshold of erosion, soil susceptibility to erosion and dust production increases. In contrast, the most im...
متن کاملMore directions in visibility graphs
In this paper we introduce unit bar k-visibility graphs, which are bar kvisibility graphs in which every bar has unit length. We show that almost all families of unit bar k-visibility graphs and unit bar k-visibility graphs are incomparable under set inclusion. In addition, we establish the largest complete graph that is a unit bar k-visibility graph. As well, we present a family of hyperbox vi...
متن کاملSimultaneous Visibility Representations of Plane st-graphs Using L-shapes
Let 〈Gr, Gb〉 be a pair of plane st-graphs with the same vertex set V . A simultaneous visibility representation with L-shapes of 〈Gr, Gb〉 is a pair of bar visibility representations 〈Γr, Γb〉 such that, for every vertex v ∈ V , Γr(v) and Γb(v) are a horizontal and a vertical segment, which share an end-point. In other words, every vertex is drawn as an L-shape, every edge of Gr is a vertical vis...
متن کاملArc- and circle-visibility graphs
We study polar visibility graphs, graphs whose vertices can be represented by arcs of concentric circles with adjacency determined by radial visibility including visibility through the origin. These graphs are more general than the well-studied bar-visibility graphs and are characterized here, when arcs are proper subsets of circles, as the graphs that embed on the plane with all but at most on...
متن کاملCharacterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کامل