arXiv subjects

Arthur A. B. Pessa

Publications and source records attributed to Arthur A. B. Pessa.

16 recordsLinked to original sources

arXiv2026

Charting the life of Billboard hits through memory, turnover, and predictability

Rankings shape the visibility and success of cultural products, yet their temporal dynamics remain underexplored when comparing distinct ranked objects within the same domain. Here, we use nearly seven decades of Billboard Hot 100 songs and six decades of Billboard 200 albums to investigate how success emerges, persists, and differs between songs and albums. We find that albums exhibit a heavier-tailed permanence distribution and reenter the charts more often than songs, whereas songs typically have longer uninterrupted runs. Similarity between successive charts decays much faster for songs than for albums, suggesting that individual hits reflect shorter-lived collective attention, while albums retain longer cultural memory. Rank-turbulence divergence shows that consecutive charts are similar, but that top positions are dominated more by rank reshuffling than by turnover. Entropy-based analyses reveal high uncertainty in rank movements, with distinct historical patterns for songs and albums and a strong dependence on trajectory length. Clustering of trajectories shows that chart success is organized into a small number of typical pathways, including canonical rise-and-fall trajectories, high-end persistence, and monotonic decline. Together, these results show that musical charts are not merely records of popularity, but dynamic memory systems in which attention, turnover, and predictability interact differently for songs and albums.

physics.soc-ph↗

arXiv2026

Bipartite structure and dynamics of political corruption networks

Political corruption is inherently an affiliation process linking agents to corruption cases; yet it is often studied via one-mode projections that connect co-offenders within the same scandal, implying a loss of information that potentially confounds properties of agents and cases. Here, we adopt a bipartite representation to analyze datasets of corruption scandals in Brazil and Spain spanning nearly three decades. By tracking the temporal growth of these networks, we quantify density and redundancy measures to capture partner reuse and co-occurrence across cases. Networks in both countries become progressively sparser over time, and agent redundancy is systematically higher than case redundancy, indicating a small cadre of recidivists who recombine largely with novice partners rather than forming durable co-offending ties. These networks exhibit near-exponential degree distributions, reflecting low recidivism and likely high coordination costs and secrecy constraints of large-scale scandals. Our bipartite view further reveals a moderate cross-mode disassortative degree mixing between agents and cases, with high-degree agents distributing their activity across small cases and large scandals mainly comprising low-degree participants. Finally, identifying atypical individuals within the bipartite structure reveals criminal trajectories marked by a gradual rise in network embeddedness that can appear ordinary in agent-projected networks.

physics.soc-ph↗

arXiv2025

Similarity networks of ordinal-pattern transitions classify falling paper trajectories

Paper fragments in free fall constitute a simple yet paradigmatic mechanical system exhibiting remarkably complex motions. Despite a long history of investigation, this system has defied comprehensive first-principles modeling, motivating the development of phenomenological and experimental approaches to classify the free-fall dynamics of small paper fragments. Here we apply the Bandt-Pompe symbolization method to extract high-dimensional features corresponding to ordinal-pattern transitions (so-called ordinal networks) from observed area time series of video-recorded falling papers shaped as circles, squares, hexagons, and crosses. We then represent each trajectory as a node in a weighted similarity network, with edges encoding pairwise dynamical similarity, and identify motion classes via community detection. Our method automatically clusters trajectories into tumbling and chaotic falls in excellent agreement with expert visual classification. Notably, it outperforms previous approaches based on classical physical features derived from complete three-dimensional trajectories -- especially for cross-shaped papers -- and requires no prior specification of the number of motion classes. We further find that trajectories diverging from expert classifications occupy more central positions in the similarity network, suggesting more complex and ambiguous dynamic behavior.

physics.data-an↗

arXiv2025

Nearest neighbor permutation entropy detects phase transitions in complex high-pressure systems

Understanding the high-pressure phase behavior of carbon dioxide-hydrocarbon mixtures is of considerable interest owing to their wide range of applications. Under certain conditions, these systems are not amenable to direct visual monitoring, and experimentalists often rely on spectrophotometric data to infer phase behavior. Consequently, developing computationally efficient and robust methods to leverage such data is crucial. Here, we combine nearest neighbor permutation entropy, computed directly from in situ near-infrared absorbance spectra acquired during depressurization trials of mixtures of carbon dioxide and a distilled petroleum fraction, with an anomaly detection approach to identify phase transitions. We show that changes in nearest neighbor entropy effectively signal transitions from initially homogeneous mixtures to two-phase equilibria, thereby enabling accurate out-of-sample online predictions of transition pressures. Our approach requires minimum data preprocessing, no specialized detection techniques or visual inspection of the spectra, and is sufficiently general to be adapted for studying phase behavior in other high-pressure systems monitored via spectrophotometry.

physics.chem-ph↗

arXiv2025

Structural roles and gender disparities in corruption networks

Criminal activities are predominantly due to males, with females exhibiting a significantly lower involvement, especially in serious offenses. This pattern extends to organized crime, where females are often perceived as less tolerant to illegal practices. However, the roles of males and females within corruption networks are less understood. Here, we analyze data from political scandals in Brazil and Spain to shed light on gender differences in corruption networks. Our findings reveal that females constitute 10% and 20% of all agents in the Brazilian and Spanish corruption networks, respectively, with these proportions remaining stable over time and across different scandal sizes. Despite this disparity in representation, centrality measures are comparable between genders, except among highly central individuals, for which males are further overrepresented. Additionally, gender has no significant impact on network resilience, whether through random dismantling or targeted attacks on the largest component. Males are more likely to be involved in multiple scandals than females, and scandals predominantly involving females are rare, though these differences are explained by a null network model in which gender is randomly assigned while maintaining gender proportions. Our results further reveal that the underrepresentation of females partially explains gender homophily in network associations, although in the Spanish network, male-to-male connections exceed expectations derived from a null model.

physics.soc-ph↗

arXiv2025

Two-by-two ordinal patterns in art paintings

Quantitative analysis of visual arts has recently expanded to encompass a more extensive array of artworks due to the availability of large-scale digitized art collections. Consistent with formal analyses by art historians, many of these studies highlight the significance of encoding spatial structures within artworks to enhance our understanding of visual arts. However, defining universally applicable, interpretable, and sufficiently simple units that capture the essence of paintings and their artistic styles remains challenging. Here we examine ordering patterns in pixel intensities within two-by-two partitions of images from nearly 140,000 paintings created over the past thousand years. These patterns, categorized into eleven types based on arguments of continuity and symmetry, are both universally applicable and detailed enough to correlate with low-level visual features of paintings. We uncover a universal distribution of these patterns, with consistent prevalence within groups, yet modulated across groups by a nontrivial interplay between pattern smoothness and the likelihood of identical pixel intensities. This finding provides a standardized metric for comparing paintings and styles, further establishing a scale to measure deviations from the average prevalence. Our research also shows that these simple patterns carry valuable information for identifying painting styles, though styles generally exhibit considerable variability in the prevalence of ordinal patterns. Moreover, shifts in the prevalence of these patterns reveal a trend in which artworks increasingly diverge from the average incidence over time; however, this evolution is neither smooth nor uniform, with substantial variability in pattern prevalence, particularly after the 1930s.

physics.soc-ph↗

arXiv2024

Shape patterns in popularity series of video games

In recent years, digital games have become increasingly present in people's lives both as a leisure activity or in gamified activities of everyday life. Despite this growing presence, large-scale, data-driven analyses of video games remain a small fraction of the related literature. In this sense, the present work constitutes an investigation of patterns in popularity series of video games based on monthly popularity series, spanning eleven years, for close to six thousand games listed on the online platform Steam. Utilizing these series, after a preprocessing stage, we perform a clustering task in order to group the series solely based on their shape. Our results indicate the existence of five clusters of shape patterns named decreasing, hilly, increasing, valley, and bursty, with approximately half of the games showing a decreasing popularity pattern, 20.7% being hilly, 11.8% increasing, 11.0% bursty, and 9.1% valley. Finally, we have probed the prevalence and persistence of shape patterns by comparing the shapes of longer popularity series during their early stages and after completion. We have found the majority of games tend to maintain their pattern over time, except for a constant pattern that appears early in popularity series only to later originate hilly and bursty popularity series.

physics.soc-ph↗

arXiv2024

Characterizing unstructured data with the nearest neighbor permutation entropy

Permutation entropy and its associated frameworks are remarkable examples of physics-inspired techniques adept at processing complex and extensive datasets. Despite substantial progress in developing and applying these tools, their use has been predominantly limited to structured datasets such as time series or images. Here, we introduce the k-nearest neighbor permutation entropy, an innovative extension of the permutation entropy tailored for unstructured data, irrespective of their spatial or temporal configuration and dimensionality. Our approach builds upon nearest neighbor graphs to establish neighborhood relations and uses random walks to extract ordinal patterns and their distribution, thereby defining the k-nearest neighbor permutation entropy. This tool not only adeptly identifies variations in patterns of unstructured data, but also does so with a precision that significantly surpasses conventional measures such as spatial autocorrelation. Additionally, it provides a natural approach for incorporating amplitude information and time gaps when analyzing time series or images, thus significantly enhancing its noise resilience and predictive capabilities compared to the usual permutation entropy. Our research substantially expands the applicability of ordinal methods to more general data types, opening promising research avenues for extending the permutation entropy toolkit for unstructured data.

physics.data-an↗

arXiv2023

Complexity of the COVID-19 pandemic in Maringa

While extensive literature exists on the COVID-19 pandemic at regional and national levels, understanding its dynamics and consequences at the city level remains limited. This study investigates the pandemic in Maringá, a medium-sized city in Brazil's South Region, using data obtained by actively monitoring the disease from March 2020 to June 2022. Despite prompt and robust interventions, COVID-19 cases increased exponentially during the early spread of COVID-19, with a reproduction number lower than that observed during the initial outbreak in Wuhan. Our research demonstrates the remarkable impact of non-pharmaceutical interventions on both mobility and pandemic indicators, particularly during the onset and the most severe phases of the emergency. However, our results suggest that the city's measures were primarily reactive rather than proactive. Maringá faced six waves of cases, with the third and fourth waves being the deadliest, responsible for over two-thirds of all deaths and overwhelming the local healthcare system. Excess mortality during this period exceeded deaths attributed to COVID-19, indicating that the burdened healthcare system may have contributed to increased mortality from other causes. By the end of the fourth wave, nearly three-quarters of the city's population had received two vaccine doses, significantly decreasing deaths despite the surge caused by the Omicron variant. Finally, we compare these findings with the national context and other similarly sized cities, highlighting substantial heterogeneities in the spread and impact of the disease.

physics.soc-ph↗

arXiv2023

Deep Learning Criminal Networks

Recent advances in deep learning methods have enabled researchers to develop and apply algorithms for the analysis and modeling of complex networks. These advances have sparked a surge of interest at the interface between network science and machine learning. Despite this, the use of machine learning methods to investigate criminal networks remains surprisingly scarce. Here, we explore the potential of graph convolutional networks to learn patterns among networked criminals and to predict various properties of criminal networks. Using empirical data from political corruption, criminal police intelligence, and criminal financial networks, we develop a series of deep learning models based on the GraphSAGE framework that are able to recover missing criminal partnerships, distinguish among types of associations, predict the amount of money exchanged among criminal agents, and even anticipate partnerships and recidivism of criminals during the growth dynamics of corruption networks, all with impressive accuracy. Our deep learning models significantly outperform previous shallow learning approaches and produce high-quality embeddings for node and edge properties. Moreover, these models inherit all the advantages of the GraphSAGE framework, including the generalization to unseen nodes and scaling up to large graph structures.

physics.soc-ph↗

arXiv2023

Age and market capitalization drive large price variations of cryptocurrencies

Cryptocurrencies are considered the latest innovation in finance with considerable impact across social, technological, and economic dimensions. This new class of financial assets has also motivated a myriad of scientific investigations focused on understanding their statistical properties, such as the distribution of price returns. However, research so far has only considered Bitcoin or at most a few cryptocurrencies, whilst ignoring that price returns might depend on cryptocurrency age or be influenced by market capitalization. Here, we therefore present a comprehensive investigation of large price variations for more than seven thousand digital currencies and explore whether price returns change with the coming-of-age and growth of the cryptocurrency market. We find that tail distributions of price returns follow power-law functions over the entire history of the considered cryptocurrency portfolio, with typical exponents implying the absence of characteristic scales for price variations in about half of them. Moreover, these tail distributions are asymmetric as positive returns more often display smaller exponents, indicating that large positive price variations are more likely than negative ones. Our results further reveal that changes in the tail exponents are very often simultaneously related to cryptocurrency age and market capitalization or only to age, with only a minority of cryptoassets being affected just by market capitalization or neither of the two quantities. Lastly, we find that the trends in power-law exponents usually point to mixed directions, and that large price variations are likely to become less frequent only in about 28\% of the cryptocurrencies as they age and grow in market capitalization.

physics.soc-ph↗

arXiv2022

Clustering free-falling paper motion with complexity and entropy

Many simple natural phenomena are characterized by complex motion that appears random at first glance, but that often displays underlying patterns and behavior that can be clustered in groups. The movement of small pieces of paper falling through the air is one of these systems whose complete mathematical description seems unworkable. Understanding these types of motion thus demands automated experimentation capable of producing large datasets covering different behaviors -- a task that has become feasible only recently with advances in computer vision and machine learning methods. Here we use one of these datasets related to the motion of free-falling paper with different shapes to propose an information-theoretical approach that automatically clusters different types of behavior. We evaluate the permutation entropy and statistical complexity from time series related to the observable area of free-falling paper pieces captured by a video camera. We find that chaotic and tumbling motions have a distinct average degree of entropy and complexity, allowing us to accurately discriminate between these two types of behavior with a simple unsupervised machine learning algorithm. Our method has a performance comparable to other approaches based on physical quantities but does not depend on reconstructing the three-dimensional falling trajectory.

physics.data-an↗

arXiv2022

Determining liquid crystal properties with ordinal networks and machine learning

Machine learning methods are becoming increasingly important for the development of materials science. In spite of this, the use of image analysis in the development of these systems is still recent and underexplored, especially in materials often studied via optical imaging techniques such as liquid crystals. Here we apply the recently proposed method of ordinal networks to map optical textures obtained from experimental samples of liquid crystals into complex networks and use this representation jointly with a simple statistical learning algorithm to investigate different physical properties of these materials. Our research demonstrates that ordinal networks formed by only 24 nodes encode crucial information about liquid crystal properties, thus allowing us to train simple machine learning models capable of identifying and classifying mesophase transitions, distinguishing among different doping concentrations used to induce chiral mesophases, and predicting sample temperatures with outstanding accuracy. The precision and scalability of our approach indicate it can be used to probe properties of different materials in situations involving large-scale datasets or real-time monitoring systems.

physics.data-an↗

arXiv2021

ordpy: A Python package for data analysis with permutation entropy and ordinal network methods

Since Bandt and Pompe's seminal work, permutation entropy has been used in several applications and is now an essential tool for time series analysis. Beyond becoming a popular and successful technique, permutation entropy inspired a framework for mapping time series into symbolic sequences that triggered the development of many other tools, including an approach for creating networks from time series known as ordinal networks. Despite the increasing popularity, the computational development of these methods is fragmented, and there were still no efforts focusing on creating a unified software package. Here we present ordpy, a simple and open-source Python module that implements permutation entropy and several of the principal methods related to Bandt and Pompe's framework to analyze time series and two-dimensional data. In particular, ordpy implements permutation entropy, Tsallis and Rényi permutation entropies, complexity-entropy plane, complexity-entropy curves, missing ordinal patterns, ordinal networks, and missing ordinal transitions for one-dimensional (time series) and two-dimensional (images) data as well as their multiscale generalizations. We review some theoretical aspects of these tools and illustrate the use of ordpy by replicating several literature results.

physics.data-an↗

arXiv2020

Mapping images into ordinal networks

An increasing abstraction has marked some recent investigations in network science. Examples include the development of algorithms that map time series data into networks whose vertices and edges can have different interpretations, beyond the classical idea of parts and interactions of a complex system. These approaches have proven useful for dealing with the growing complexity and volume of diverse data sets. However, the use of such algorithms is mostly limited to one-dimension data, and there has been little effort towards extending these methods to higher-dimensional data such as images. Here we propose a generalization for the ordinal network algorithm for mapping images into networks. We investigate the emergence of connectivity constraints inherited from the symbolization process used for defining the network nodes and links, which in turn allows us to derive the exact structure of ordinal networks obtained from random images. We illustrate the use of this new algorithm in a series of applications involving randomization of periodic ornaments, images generated by two-dimensional fractional Brownian motion and the Ising model, and a data set of natural textures. These examples show that measures obtained from ordinal networks (such as average shortest path and global node entropy) extract important image properties related to roughness and symmetry, are robust against noise, and can achieve higher accuracy than traditional texture descriptors extracted from gray-level co-occurrence matrices in simple image classification tasks.

physics.soc-ph↗

arXiv2019

Characterizing stochastic time series with ordinal networks

Approaches for mapping time series to networks have become essential tools for dealing with the increasing challenges of characterizing data from complex systems. Among the different algorithms, the recently proposed ordinal networks stand out due to its simplicity and computational efficiency. However, applications of ordinal networks have been mainly focused on time series arising from nonlinear dynamical systems, while basic properties of ordinal networks related to simple stochastic processes remain poorly understood. Here, we investigate several properties of ordinal networks emerging from random time series, noisy periodic signals, fractional Brownian motion, and earthquake magnitude series. For ordinal networks of random series, we present an approach for building the exact form of the adjacency matrix, which in turn is useful for detecting non-random behavior in time series and the existence of missing transitions among ordinal patterns. We find that the average value of a local entropy, estimated from transition probabilities among neighboring nodes of ordinal networks, is more robust against noise addition than the standard permutation entropy. We show that ordinal networks can be used for estimating the Hurst exponent of time series with accuracy comparable with state-of-the-art methods. Finally, we argue that ordinal networks can detect sudden changes in Earth seismic activity caused by large earthquakes.

physics.data-an↗