Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · nlin/0511024

The co-evolutionary dynamics of directed network of spin market agents

D. Horvath·Z. Kuscsik·M. Gmitra
View original source ↗Read source document ↗Export metadata ↓

Abstract

The spin market model [S. Bornholdt, Int.J.Mod.Phys. C 12 (2001) 667] is extended into co-evolutionary version, where strategies of interacting and competitive traders are represented by local and global couplings between the nodes of dynamic directed stochastic network. The co-evolutionary principles are applied in the frame of Bak - Sneppen self-organized dynamics [P. Bak, K. Sneppen, Phys. Rev. Letter 71 (1993) 4083] that includes the processes of selection and extinction actuated by the local (node) fitness. The local fitness is related to orientation of spin agent with respect to instant magnetization. The stationary regime characterized by a fat tailed distribution of the log-price returns with index $α\simeq 3.6$ (out of the Levy range) is identified numerically. The non-trivial consequence of the extremal dynamics is the partially power-law decay (an effective exponent varies between -0.3 and -0.6) of the autocorrelation function of volatility. Broad-scale network topology with node degree distribution characterized by the exponent $γ=1.8$ from the range of social networks is obtained.

Explore related subjects

nlin.AO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

D. Horvath, Z. Kuscsik, M. Gmitra. 2005-11-13. The co-evolutionary dynamics of directed network of spin market agents. https://doi.org/10.1016/j.physa.2006.01.067

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

KEEP EXPLORING

Related papers

arXiv2026

Symmetry breaking in minimum dissipation networks

Natural and engineered supply networks exhibit universal structural patterns, such as the formation of loops, yet the principles governing optimal structures remain unclear. These patterns can be interpreted as solutions of optimization problems in which dissipation is minimized under a constraint on the available resources. Optimal networks break the symmetry of such a problem in two distinct ways: weakly, where the topology stays symmetric but the edge capacities do not, and strongly, altering the topology itself. Both scenarios are organized by the symmetry group of the optimization problem, which determines the pattern of capacities in the weakly broken state and may constrain the residual symmetry of the strongly broken one. Symmetric structures are favored at intermediate fluctuation levels, i.e., noise both induces and suppresses symmetry breaking. Here, we show that symmetry breaking, influenced by network meshing, resource constraints and fluctuations, is a generic organizing principle of optimal transport networks.

nlin.AO↗
arXiv2026

Trail systems self-organize through individual route optimization

As animals, including humans, walk, they compact the vegetation and ground beneath them, reducing the cost of movement for subsequent travelers. From this positive feedback emerge networks of trails which allow for efficient movement and store generational-scale information about the environment. Models simulating this process show how individuals following local cues produce trail systems with many of the features of real-world networks. However, little has been done to investigate walkers with more complete knowledge of their environment and the abilities to plan their behavior intelligently. Here we introduce a simple general model for trail formation, based on minimizing cost of movement by individuals. As in real environments, our simulations produce a striking variety of complex trail networks. We show that these trail systems optimally connect space according to the spatial needs of the walkers, that the geometry of those trail systems matches theoretical predictions and that the systems they generate may fall into multiple attracting states. As technological advances allow us to quantify trail systems across diverse habitats and species, our model provides a theoretical foundation for empirical research on animal trails and for understanding the emergence of human transportation networks, with implications for urban design.

nlin.AO↗
arXiv2026

Solving Stochastic Inverse Problems in Embedding Space

Solving an inverse problem consists in finding the unknown parameters of a system from observations. This task is particularly challenging when observations have a strong stochastic component, producing diverse yet equivalent patterns. Self-organizing systems are a notable case: simple local rules can generate complex stochastic patterns. Many natural systems rely on such processes, making self-organization central to understanding natural phenomena. Inverse methods based on direct comparison of observed values struggle in this setting, as such comparisons cannot capture feature similarities between variable outcomes; as a result, the loss fails to meaningfully inform the optimizer. In this work, we show that the difficulty posed by stochasticity in observable patterns can be overcome by reformulating the inverse problem in an embedding space. By mapping stochastic patterns onto an invariant embedding space, where equivalent patterns have similar representations, we can effectively recover unknown causal parameters without the need for handcrafted objective functions or heuristics. We show that embedding models trained on large image datasets produce robust representations that capture these invariances. We evaluate the method on three self-organizing systems: a physical, a biological, and a social one; namely, a reaction-diffusion system, a model of embryonic development, and an agent-based model of social segregation. We show that the method reliably recovers parameters despite stochasticity in the pattern outcomes. We further apply the method to real biological patterns, highlighting its potential as a tool for both theorists and experimentalists to investigate the dynamics underlying complex stochastic pattern formation.

nlin.AO↗