Abstract
Horizontal visibility graphs (HVGs) are graphs generated from time (or otherwise ordered) series data. Components of the graph reveal key underlying properties of the series data that generated the graph and there are several applications that use HVGs to uncover information about series data. Recently, a bijection between the degree sequence and adjacency matrix of canonical form HVGs was established. This paper extends the relation between the degree sequence and adjacency matrix of HVGs and then presents an algorithm to uniquely construct an HVG from its directed degree sequence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
