Search arXivSearch

arXiv · 2407.13714

Mapping Inter-City Trade Networks to Maximum Entropy Models using Electronic Invoice Data

Abstract

We analyze the network of transactions among cities based on the electronic invoice database for the municipalities in the Ceará state, Brazil. It consists of approximately 3.7 billion records, registered during the period between the years 2016 to 2019. All the transactions are grouped in a unique dataset and represented as an asymmetrical adjacency matrix corresponding to a directed graph with connections weighted by the number of transactions among cities. Due to the large size of Ceará state, its unequal distribution of wealth, and spatially heterogeneous population, we initially determine communities of cities based on their mutual intensity of trades and verify to which extent their economic interests reflect a community cohesiveness. For the first task, we use the Infomap algorithm to detect the partition which provides the shortest description length and captures the optimal community structure of the network in terms of its associated flow dynamics. Surprisingly, the partition identified has five modules, whose two-dimensional geographical projections are all simply-connected domains. We proceed with the analysis of traded products by building bipartite structures represented in terms of adjacency matrices between municipalities and products, considering selling and buying. Using the revealed comparative advantage (RCA) concept, we define a non-monetary and binary activity index that can distinguish the RCA of a city in a class of goods or services as evidenced by trade flows. Finally, through the pairwise Maximum Entropy Model, we can associate to the largest communities their corresponding binary Ising-like Hamiltonian models. In an analogy with critical phenomena, our results reveal that each community operates at a "temperature" that is close to the corresponding "critical point", suggesting a high degree of "economic cohesiveness" in its trade network of cities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cesar I. N. Sampaio Filho, Rilder S. Pires, Humberto A. Carmona, José S. Andrade Jr. 2024-07-18. Mapping Inter-City Trade Networks to Maximum Entropy Models using Electronic Invoice Data. https://doi.org/10.1016/j.chaos.2025.117593

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Quantifying the Dynamics of Innovation Abandonment Across Scientific, Technological, Commercial, and Pharmacological Domains

Despite the vast literature on the diffusion of innovations that impacts a broad range of disciplines, our understanding of the abandonment of innovations remains limited yet is essential for a deeper understanding of the innovation lifecycle. Here, we analyze four large-scale datasets that capture the temporal and structural patterns of innovation abandonment across scientific, technological, commercial, and pharmacological domains. The paper makes three primary contributions. First, across these diverse domains, we uncover one simple pattern of preferential abandonment, whereby the probability for individuals or organizations to abandon an innovation increases with time and correlates with the number of network neighbors who have abandoned the innovation. Second, we find that the presence of preferential abandonment fundamentally alters the way in which the underlying ecosystem breaks down, inducing a novel structural collapse in networked systems commonly perceived as robust against abandonments. Third, we derive an analytical framework to systematically understand the impact of preferential abandonment on network dynamics, pinpointing specific conditions where it may accelerate, decelerate, or have an identical effect compared to random abandonment, depending on the network topology. Together, these results deepen our quantitative understanding of the abandonment of innovation within networked social systems, with implications for the robustness and functioning of innovation communities. Overall, they demonstrate that the dynamics of innovation abandonment follow simple yet reproducible patterns, suggesting that the uncovered preferential abandonment may be a generic property of the innovation lifecycle.

physics.soc-ph

When higher-order interactions matter: reducibility, parsimony, and microscopic organization

The current debate on higher-order interactions raises a fundamental question: when can systems organized through group interactions be faithfully represented within a graph-based formalism? Recent results show that graph descriptions can reproduce higher-order dynamics exactly or preserve selected macroscopic observables. Yet reducibility does not necessarily imply simplification, as information removed from the interaction structure may reappear as complexity in the effective dynamics, while structural features such as nestedness, heterogeneity, and cross-order correlations may be obscured by the reduction. We argue that formal representability alone is insufficient as a criterion for model choice. Both "simpler" and "equivalent" are question-dependent notions: parsimony must be assessed for the complete structure-dynamics model, and adequacy must be defined relative to the observables, scales, and regimes required by the scientific question. A reduced model may therefore be fully adequate for locating a phase transition or identifying a universality class while being inadequate for reproducing microscopic trajectories, transient dynamics, or structure-function relations. When group structure carries relevant microscopic information, higher-order representations may remain the most direct, interpretable, and parsimonious description, as well as the natural framework for understanding how microscopic organization gives rise to macroscopic behavior and functionality.

physics.soc-ph

Emotions as intrinsic colored noise in biological systems

The idea that emotions in biological systems are analogous to intrinsic colored noise is advanced and justified. A model describing the dynamics of operation of biological networks under the influence of colored noise is suggested. The agents of a biological network can be represented either by biological species, such as humans and animals, or by neurons of the brain, or by the nodes of a neural network. Operational actions, or decisions, in a biological noisy network are based not only on the evaluation of utility of alternatives, but also on the agents emotions. The model is probabilistic, with the choice of alternatives characterized by the related probabilities. At the initial step, the agents make decisions individually and then start exchanging information with each other and imitating the actions of other agents, thus forming a biological network of interacting agents. Numerical simulations are accomplished for a heterogeneous society consisting of three groups of agents, one group possessing long-range memory, the other group, short-range memory, and the third group of super-rational agents acting strictly on the basis of utility, being deprived of emotions. Dynamics of opinions in different groups can be smooth, oscillatory, or chaotic. Altogether, eight types of operation are found, depending on the dynamics of group decisions. Under strong imitation effect, there appears chaotic motion in the evolution of decision choice. It is shown how the Ellsberg paradox can be resolved and how the exchange of information influences the dynamics of this paradox.

physics.soc-ph