RELATIVE NODE DEGREES AND LINK LENGTHS OF PARAMETRIC THUE–MORSE NETWORK

In this paper, we study the parametric visibility graph (PVG) and parametric modified limited penetrable visibility graph (PMLPVG) generated by the Thue–Morse sequence. First, we reconstruct the time series and map the sequence to the complex network using the PVG algorithm. Then, we study the relative average degree of nodes and link length of Thue–Morse PVG by an iterative method, and we further derive them of Thue–Morse PMLPVG with a penetrable distance of [Formula: see text]. Finally, we show that the numerical simulations are in good agreement with the theoretical results.