arXiv subjects

Juan I. Perotti

Publications and source records attributed to Juan I. Perotti.

13 recordsLinked to original sources

arXiv2025

Extended Yard Sale model of wealth distribution on Erdős-Rényi random networks

Excessive wealth concentration can undermine economic and social development. Random Asset Exchange (RAE) models provide valuable tools to investigate this phenomenon. Assuming that economic systems may operate optimally near the critical point of a continuous phase transition, the Extended Yard Sale (EYS) model introduced by Boghosian et al.~[Physica A 476, 15 (2017)] offers a compelling framework. This model captures the interplay between wealth redistribution and accumulation, exhibiting a continuous phase transition marked by a broad wealth distribution at criticality, separating a condensed phase -- where a microscopic fraction of agents holds a macroscopic share of total wealth -- from a distributed phase with a light-tailed wealth distribution. While the original EYS model assumes fully connected interactions, this work introduces and studies a networked variant where agents interact over Erdős-Rényi random networks. The analysis combines Monte Carlo simulations with Quenched Mean Field and Mean Field approximations, exploring a variety of interaction and taxation schemes. A scaling analysis shows that, although the networked model also undergoes a continuous phase transition, it leads to local wealth condensation rather than the global condensation found in the fully connected case. These results deepen our understanding of wealth dynamics in structured populations and may help inform the development of more effective economic and social policies.

cond-mat.stat-mech↗

arXiv2020

Towards a generalization of information theory for hierarchical partitions

Complex systems often exhibit multiple levels of organization covering a wide range of physical scales, so the study of the hierarchical decomposition of their structure and function is frequently convenient. To better understand this phenomenon, we introduce a generalization of information theory that works with hierarchical partitions. We begin revisiting the recently introduced Hierarchical Mutual Information (HMI), and show that it can be written as a level by level summation of classical conditional mutual information terms. Then, we prove that the HMI is bounded from above by the corresponding hierarchical joint entropy. In this way, in analogy to the classical case, we derive hierarchical generalizations of many other classical information-theoretic quantities. In particular, we prove that, as opposed to its classical counterpart, the hierarchical generalization of the Variation of Information is not a metric distance, but it admits a transformation into one. Moreover, focusing on potential applications of the existing developments of the theory, we show how to adjust by chance the HMI. We also corroborate and analyze all the presented theoretical results with exhaustive numerical computations, and include an illustrative application example of the introduced formalism. Finally, we mention some open problems that should be eventually addressed for the proposed generalization of information theory to reach maturity.

cs.IT↗

arXiv2019

Universal and non-universal neural dynamics on small world connectomes: a finite size scaling analysis

Evidence of critical dynamics has been recently found in both experiments and models of large scale brain dynamics. The understanding of the nature and features of such critical regime is hampered by the relatively small size of the available connectome, which prevent among other things to determine its associated universality class. To circumvent that, here we study a neural model defined on a class of small-world network that share some topological features with the human connectome. We found that varying the topological parameters can give rise to a scale-invariant behavior belonging either to mean field percolation universality class or having non universal critical exponents. In addition, we found certain regions of the topological parameters space where the system presents a discontinuous (i.e., non critical) dynamical phase transition into a percolated state. Overall these results shed light on the interplay of dynamical and topological roots of the complex brain dynamics.

cond-mat.dis-nn↗

arXiv2017

A short-ranged memory model with preferential growth

In this work we introduce a variant of the Yule-Simon model for preferential growth by incorporating a finite kernel to model the effects of bounded memory. We characterize the properties of the model combining analytical arguments with extensive numerical simulations. In particular, we analyze the lifetime and popularity distributions by mapping the model dynamics to corresponding Markov chains and branching processes, respectively. These distributions follow power-laws with well defined exponents that are within the range of the empirical data reported in ecologies. Interestingly, by varying the innovation rate, this simple out-of-equilibrium model exhibits many of the characteristics of a continuous phase transition and, around the critical point, it generates time series with power-law popularity, lifetime and inter-event time distributions, and non-trivial temporal correlations, such as a bursty dynamics in analogy with the activity of solar flares. Our results suggest that an appropriate balance between innovation and oblivion rates could provide an explanatory framework for many of the properties commonly observed in many complex systems.

physics.soc-ph↗

arXiv2017

Hierarchical benchmark graphs for testing community detection algorithms

Hierarchical organization is an important, prevalent characteristic of complex systems; in order to understand their organization, the study of the underlying (generally complex) networks that describe the interactions between their constituents plays a central role. Numerous previous works have shown that many real-world networks in social, biologic and technical systems present hierarchical organization, often in the form of a hierarchy of community structures. Many artificial benchmark graphs have been proposed in order to test different community detection methods, but no benchmark has been developed to throughly test the detection of hierarchical community structures. In this study, we fill this vacancy by extending the Lancichinetti-Fortunato-Radicchi (LFR) ensemble of benchmark graphs, adopting the rule of constructing hierarchical networks proposed by Ravasz and Barabási. We employ this benchmark to test three of the most popular community detection algorithms, and quantify their accuracy using the traditional Mutual Information and the recently introduced Hierarchical Mutual Information. The results indicate that the Ravasz-Barabási-Lancichinetti-Fortunato-Radicchi (RB-LFR) benchmark generates a complex hierarchical structure constituting a challenging benchmark for the considered community detection methods.

physics.soc-ph↗

arXiv2016

A study of memory effects in a chess database

A series of recent works studying a database of chronologically sorted chess games --containing 1.4 million games played by humans between 1998 and 2007-- have shown that the popularity distribution of chess game-lines follows a Zipf's law, and that time series inferred from the sequences of those game-lines exhibit long-range memory effects. The presence of Zipf's law together with long-range memory effects was observed in several systems, however, the simultaneous emergence of these two phenomena were always studied separately up to now. In this work, by making use of a variant of the Yule-Simon preferential growth model, introduced by Cattuto et al., we provide an explanation for the simultaneous emergence of Zipf's law and long-range correlations memory effects in a chess database. We find that Cattuto's Model (CM) is able to reproduce both, Zipf's law and the long-range correlations, including size-dependent scaling of the Hurst exponent for the corresponding time series. CM allows an explanation for the simultaneous emergence of these two phenomena via a preferential growth dynamics, including a memory kernel, in the popularity distribution of chess game-lines. This mechanism results in an aging process in the chess game-line choice as the database grows. Moreover, we find burstiness in the activity of subsets of the most active players, although the aggregated activity of the pool of players displays inter-event times without burstiness. We show that CM is not able to produce time series with bursty behavior providing evidence that burstiness is not required for the explanation of the long-range correlation effects in the chess database.

physics.soc-ph↗

arXiv2015

Correlated bursts and the role of memory range

Inhomogeneous temporal processes in natural and social phenomena have been described by bursts that are rapidly occurring events within short time periods alternating with long periods of low activity. In addition to the analysis of heavy-tailed inter-event time distributions, higher-order correlations between inter-event times, called correlated bursts, have been studied only recently. As the possible mechanisms underlying such correlated bursts are far from being fully understood, we devise a simple model for correlated bursts by using a self-exciting point process with variable memory range. Here the probability that a new event occurs is determined by a memory function that is the sum of decaying memories of the past events. In order to incorporate the noise and/or limited memory capacity of systems, we apply two memory loss mechanisms, namely either fixed number or variable number of memories. By using theoretical analysis and numerical simulations we find that excessive amount of memory effect may lead to a Poissonian process, which implies that for memory effect there exists an intermediate range that will generate correlated bursts of magnitude comparable to empirical findings. Hence our results provide deeper understanding of how long-range memory affects correlated bursts.

physics.soc-ph↗

arXiv2014

Analytically Solvable Model of Spreading Dynamics with Non-Poissonian Processes

Non-Poissonian bursty processes are ubiquitous in natural and social phenomena, yet little is known about their effects on the large-scale spreading dynamics. In order to characterize these effects we devise an analytically solvable model of Susceptible-Infected (SI) spreading dynamics in infinite systems for arbitrary inter-event time distributions and for the whole time range. Our model is stationary from the beginning, and the role of lower bound of inter-event times is explicitly considered. The exact solution shows that for early and intermediate times the burstiness accelerates the spreading as compared to a Poisson-like process with the same mean and same lower bound of inter-event times. Such behavior is opposite for late time dynamics in finite systems, where the power-law distribution of inter-event times results in a slower and algebraic convergence to fully infected state in contrast to the exponential decay of the Poisson-like process. We also provide an intuitive argument for the exponent characterizing algebraic convergence.

physics.soc-ph↗

arXiv2013

Innovation and Nested Preferential Growth in Chess Playing Behavior

Complexity develops via the incorporation of innovative properties. Chess is one of the most complex strategy games, where expert contenders exercise decision making by imitating old games or introducing innovations. In this work, we study innovation in chess by analyzing how different move sequences are played at the population level. It is found that the probability of exploring a new or innovative move decreases as a power law with the frequency of the preceding move sequence. Chess players also exploit already known move sequences according to their frequencies, following a preferential growth mechanism. Furthermore, innovation in chess exhibits Heaps' law suggesting similarities with the process of vocabulary growth. We propose a robust generative mechanism based on nested Yule-Simon preferential growth processes that reproduces the empirical observations. These results, supporting the self-similar nature of innovations in chess are important in the context of decision making in a competitive scenario, and extend the scope of relevant findings recently discovered regarding the emergence of Zipf's law in chess.

physics.soc-ph↗

arXiv2013

Memory and long-range correlations in chess games

In this paper we report the existence of long-range memory in the opening moves of a chronologically ordered set of chess games using an extensive chess database. We used two mapping rules to build discrete time series and analyzed them using two methods for detecting long-range correlations; rescaled range analysis and detrented fluctuation analysis. We found that long-range memory is related to the level of the players. When the database is filtered according to player levels we found differences in the persistence of the different subsets. For high level players, correlations are stronger at long time scales; whereas in intermediate and low level players they reach the maximum value at shorter time scales. This can be interpreted as a signature of the different strategies used by players with different levels of expertise. These results are robust against the assignation rules and the method employed in the analysis of the time series.

physics.data-an↗

arXiv2013

Contextual analysis framework for bursty dynamics

To understand the origin of bursty dynamics in natural and social processes we provide a general analysis framework, in which the temporal process is decomposed into sub-processes and then the bursts in sub-processes, called contextual bursts, are combined to collective bursts in the original process. For the combination of sub-processes, it is required to consider the distribution of different contexts over the original process. Based on minimal assumptions for inter-event time statistics, we present a theoretical analysis for the relationship between contextual and collective inter-event time distributions. Our analysis framework helps to exploit contextual information available in decomposable bursty dynamics.

physics.soc-ph↗

arXiv2012

Smart random walkers: the cost of knowing the path

In this work we study the problem of targeting signals in networks using entropy information measurements to quantify the cost of targeting. We introduce a penalization rule that imposes a restriction to the long paths and therefore focus the signal to the target. By this scheme we go continuously from fully random walkers to walkers biased to the target. We found that the optimal degree of penalization is mainly determined by the topology of the network. By analyzing several examples, we have found that a small amount of penalization reduces considerably the typical walk length, and from this we conclude that a network can be efficiently navigated with restricted information.

cond-mat.stat-mech↗

arXiv2010

Stability as a natural selection mechanism on interacting networks

Biological networks of interacting agents exhibit similar topological properties for a wide range of scales, from cellular to ecological levels, suggesting the existence of a common evolutionary origin. A general evolutionary mechanism based on global stability has been proposed recently [J I Perotti, O V Billoni, F A Tamarit, D R Chialvo, S A Cannas, Phys. Rev. Lett. 103, 108701 (2009)]. This mechanism is incorporated into a model of a growing network of interacting agents in which each new agent's membership in the network is determined by the agent's effect on the network's global stability. We show that, out of this stability constraint, several topological properties observed in biological networks emerge in a self organized manner. The influence of the stability selection mechanism on the dynamics associated to the resulting network is analyzed as well.

cond-mat.dis-nn↗