Visibility graphs of animal foraging trajectories

Paiva, Leticia R.; Alves, Sidiney G.; Lacasa, Lucas; DeSouza, Og; Miramontes, Octavio

doi:10.48550/arxiv.2204.11690

Cited by 1 publication

(1 citation statement)

References 58 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The essence of the VA is to create a network from a set of data by assigning a node to each datum and assigning edges based on the mutual visibility between two data, i.e., if a line of visibility is not "intersected" by any intermediate data. This algorithm was originally developed [28] to uncover structures in time series data, uch as finding signatures of self-organised criticality (SOC) in avalanche-based data [29], and it has found applications in astrophysics [30], medicine [31], fluid mechanics [32] and several other fields [33]. Generally, the VA comes in two types: the Natural Visibility Algorithm (NVA) and the Horizontal Visibility Algorithm (HVA).…”

Section: Introductionmentioning

confidence: 99%

Hierarchical deposition and scale-free networks: A visibility algorithm approach

Berx

2022

Phys. Rev. E

View full text Add to dashboard Cite

The growth of an interface formed by the hierarchical deposition of particles of unequal size is studied in the framework of a dynamical network generated by a horizontal visibility algorithm. For a deterministic model of the deposition process, the resulting network is scale-free with dominant degree exponent γe = ln 3/ ln 2 and transient exponent γo = 1. An exact calculation of the network diameter and clustering coefficient reveals that the network is scale invariant and inherits the modular hierarchical nature of the deposition process. For the random process, the network remains scale free, where the degree exponent asymptotically converges to γ = 3, independent of the system parameters. This result shows that the model is in the class of fractional Gaussian noise (fGn) through the relation between the degree exponent and the series' Hurst exponent H. Finally, we show through the degree-dependent clustering coefficient C(k) that the modularity remains present in the system.

show abstract

Section: Introductionmentioning

confidence: 99%

Hierarchical deposition and scale-free networks: A visibility algorithm approach

Berx

2022

Phys. Rev. E

View full text Add to dashboard Cite

show abstract

Visibility graphs of animal foraging trajectories

Cited by 1 publication

References 58 publications

Hierarchical deposition and scale-free networks: A visibility algorithm approach

Hierarchical deposition and scale-free networks: A visibility algorithm approach

Contact Info

Product

Resources

About