arXiv subjects

Frank Schweitzer

Publications and source records attributed to Frank Schweitzer.

At least 127 records · Page 7Linked to original sources

arXiv2008

Nonlinear Voter Models: The Transition from Invasion to Coexistence

In nonlinear voter models the transitions between two states depend in a nonlinear manner on the frequencies of these states in the neighborhood. We investigate the role of these nonlinearities on the global outcome of the dynamics for a homogeneous network where each node is connected to $m=4$ neighbors. The paper unfolds in two directions. We first develop a general stochastic framework for frequency dependent processes from which we derive the macroscopic dynamics for key variables, such as global frequencies and correlations. Explicite expressions for both the mean-field limit and the pair approximation are obtained. We then apply these equations to determine a phase diagram in the parameter space that distinguishes between different dynamic regimes. The pair approximation allows us to identify three regimes for nonlinear voter models: (i) complete invasion, (ii) random coexistence, and -- most interestingly -- (iii) correlated coexistence. These findings are contrasted with predictions from the mean-field phase diagram and are confirmed by extensive computer simulations of the microscopic dynamics.

cond-mat.stat-mech↗

arXiv2008

Investments in Random Environments

We present analytical investigations of a multiplicative stochastic process that models a simple investor dynamics in a random environment. The dynamics of the investor's budget, $x(t)$, depends on the stochasticity of the return on investment, $r(t)$, for which different model assumptions are discussed. The fat-tail distribution of the budget is investigated and compared with theoretical predictions. Weare mainly interested in the most probable value $x_mp$ of the budget that reaches a constant value over time. Based on an analytical investigation of the dynamics, we are able to predict $x_mp^stat$. We find a scaling law that relates the most probable value to the characteristic parameters describing the stochastic process. Our analytical results are confirmed by stochastic computer simulations that show a very good agreement with the predictions.

q-fin.PM↗

arXiv2008

Decelerating microdynamics can accelerate macrodynamics in the voter model

For the voter model, we study the effect of a memory-dependent transition rate. We assume that the transition of a spin into the opposite state decreases with the time it has been in its current state. Counter-intuitively, we find that the time to reach a macroscopically ordered state can be accelerated by slowing-down the microscopic dynamics in this way. This holds for different network topologies, including fully-connected ones. We find that the ordering dynamics is governed by two competing processes which either stabilize the majority or the minority state. If the first one dominates, it accelerates the ordering of the system. The conclusions of this Letter are not restricted to the voter model, but remain valid to many other spin systems as well.

cond-mat.dis-nn↗

arXiv2008

Risk-Seeking versus Risk-Avoiding Investments in Noisy Periodic Environments

We study the performance of various agent strategies in an artificial investment scenario. Agents are equipped with a budget, $x(t)$, and at each time step invest a particular fraction, $q(t)$, of their budget. The return on investment (RoI), $r(t)$, is characterized by a periodic function with different types and levels of noise. Risk-avoiding agents choose their fraction $q(t)$ proportional to the expected positive RoI, while risk-seeking agents always choose a maximum value $q_{max}$ if they predict the RoI to be positive ("everything on red"). In addition to these different strategies, agents have different capabilities to predict the future $r(t)$, dependent on their internal complexity. Here, we compare 'zero-intelligent' agents using technical analysis (such as moving least squares) with agents using reinforcement learning or genetic algorithms to predict $r(t)$. The performance of agents is measured by their average budget growth after a certain number of time steps. We present results of extensive computer simulations, which show that, for our given artificial environment, (i) the risk-seeking strategy outperforms the risk-avoiding one, and (ii) the genetic algorithm was able to find this optimal strategy itself, and thus outperforms other prediction approaches considered.

q-fin.PM↗

arXiv2007

On Algebraic Graph Theory and the Dynamics of Innovation Networks

We investigate some of the properties and extensions of a dynamic innovation network model recently introduced in \citep{koenig07:_effic_stabil_dynam_innov_networ}. In the model, the set of efficient graphs ranges, depending on the cost for maintaining a link, from the complete graph to the (quasi-) star, varying within a well defined class of graphs. However, the interplay between dynamics on the nodes and topology of the network leads to equilibrium networks which are typically not efficient and are characterized, as observed in empirical studies of R&D networks, by sparseness, presence of clusters and heterogeneity of degree. In this paper, we analyze the relation between the growth rate of the knowledge stock of the agents from R&D collaborations and the properties of the adjacency matrix associated with the network of collaborations. By means of computer simulations we further investigate how the equilibrium network is affected by increasing the evaluation time $τ$ over which agents evaluate whether to maintain a link or not. We show that only if $τ$ is long enough, efficient networks can be obtained by the selfish link formation process of agents, otherwise the equilibrium network is inefficient. This work should assist in building a theoretical framework of R&D networks from which policies can be derived that aim at fostering efficient innovation networks.

physics.soc-ph↗

arXiv2007

Modeling Evolving Innovation Networks

We develop a new framework for modeling innovation networks which evolve over time. The nodes in the network represent firms, whereas the directed links represent unilateral interactions between the firms. Both nodes and links evolve according to their own dynamics and on different time scales. The model assumes that firms produce knowledge based on the knowledge exchange with other firms, which involves both costs and benefits for the participating firms. In order to increase their knowledge production, firms follow different strategies to create and/or to delete links with other firms. Dependent on the information firms take into account for their decision, we find the emergence of different network structures. We analyze the conditions for the existence of these structures within a mathematical approach and underpin our findings by extensive computer simulations which show the evolution of the networks and their equilibrium state. In the discussion of the results, particular attention is given to the emergence of direct and indirect reciprocity in knowledge exchange, which refers to the emergence of cycles in the network structure. In order to motivate our modeling framework, in the first part of the chapter we give a broad overview of existing literature from economics and physics. This shows that our framework bridges and extends two different lines of research, namely the study of equilibrium networks with simple topologies and the dynamic approach of hypercycle models.

physics.soc-ph↗

arXiv2007

A Model of a Trust-based Recommendation System on a Social Network

In this paper, we present a model of a trust-based recommendation system on a social network. The idea of the model is that agents use their social network to reach information and their trust relationships to filter it. We investigate how the dynamics of trust among agents affect the performance of the system by comparing it to a frequency-based recommendation system. Furthermore, we identify the impact of network density, preference heterogeneity among agents, and knowledge sparseness to be crucial factors for the performance of the system. The system self-organises in a state with performance near to the optimum; the performance on the global level is an emergent property of the system, achieved without explicit coordination from the local interactions of agents.

nlin.AO↗

arXiv2007

Coexistence of Social Norms based on In- and Out-group Interactions

The question how social norms can emerge from microscopic interactions between individuals is a key problem in social sciences to explain collective behavior. In this paper we propose an agent-based model to show that randomly distributed social behavior by way of local interaction converges to a state with a multimodal distribution of behavior. This can be interpreted as a coexistence of different social norms, a result that goes beyond previous investigations. The model is discrete in time and space, behavior is characterized in a continuous state space. The adaptation of social behavior by each agent is based on attractive and repulsive forces caused by friendly and adversary relations among agents. The model is analyzed both analytically and by means of spatio-temporal computer simulations. It provides conditions under which we find convergence towards a single norm, coexistence of two opposing norms, and coexistence of a multitude of norms. For the latter case, we also show the evolution of the spatio-temporal distribution of behavior.

nlin.AO↗

arXiv2007

Aggregate Dynamics in an Evolutionary Network Model

We analyze a model of interacting agents (e.g. prebiotic chemical species) which are represended by nodes of a network, whereas their interactions are mapped onto directed links between these nodes. On a fast time scale, each agent follows an eigendynamics based on catalytic support from other nodes, whereas on a much slower time scale the network evolves through selection and mutation of its nodes-agent. In the first part of the paper, we explain the dynamics of the model by means of characteristic snapshots of the network evolution and confirm earlier findings on crashes an recoveries in the network structure. In the second part, we focus on the aggregate behavior of the network dynamics. We show that the disruptions in the network structure are smoothed out, so that the average evolution can be described by a growth regime followed by a saturation regime, without an initial random regime. For the saturation regime, we obtain a logarithmic scaling between the average connectivity per node $\mean{l}_{s}$ and a parameter $m$, describing the average incoming connectivity, which is independent of the system size $N$.

q-bio.PE↗

arXiv2007

Multi-Agent Approach to the Self-Organization of Networks

Is it possible to link a set of nodes without using preexisting positional information or any kind of long-range attraction of the nodes? Can the process of generating positional information, i.e. the detection of ``unknown'' nodes and the estabishment of chemical gradients, \emph{and} the process of network formation, i.e. the establishment of links between nodes, occur in parallel, on a comparable time scale, as a process of co-evolution? The paper discusses a model where the generation of relevant information for establishing the links between nodes results from the interaction of many \emph{agents}, i.e. subunits of the system that are capable of performing some activities. Their collective interaction is based on (indirect) communication, which also includes memory effects and the dissemination of information in the system. The relevant (``pragmatic'') information that leads to the establishment of the links then emerges from an evolutionary interplay of selection and reamplification.

nlin.AO↗

arXiv2007

Modeling Vortex Swarming In Daphnia

Based on experimental observations in \textit{Daphnia}, we introduce an agent-based model for the motion of single and swarms of animals. Each agent is described by a stochastic equation that also considers the conditions for active biological motion. An environmental potential further reflects local conditions for \textit{Daphnia}, such as attraction to light sources. This model is sufficient to describe the observed cycling behavior of single \textit{Daphnia}. To simulate vortex swarming of many \textit{Daphnia}, i.e. the collective rotation of the swarm in one direction, we extend the model by considering avoidance of collisions. Two different ansatzes to model such a behavior are developed and compared. By means of computer simulations of a multi-agent system we show that local avoidance - as a special form of asymmetric repulsion between animals - leads to the emergence of a vortex swarm. The transition from uncorrelated rotation of single agents to the vortex swarming as a function of the swarm size is investigated. Eventually, some evidence of avoidance behavior in \textit{Daphnia} is provided by comparing experimental and simulation results for two animals.

q-bio.PE↗

arXiv2004

Self-Organization, Active Brownian Dynamics, and Biological Applications

After summarizing basic features of self-organization such as entropy export, feedbacks and nonlinear dynamics, we discuss several examples in biology. The main part of the paper is devoted to a model of active Brownian motion that allows a stochastic description of the active motion of biological entities based on energy consumption and conversion. This model is applied to the dynamics of swarms with external and interaction potentials. By means of analytical results, we can distiguish between translational, rotational and amoebic modes of swarm motion. We further investigate swarms of active Brownian particles interacting via chemical fields and demonstrate the application of this model to phenomena such as biological aggregation and trail formation in insects.

cond-mat.stat-mech↗

arXiv2003

On Spatial Consensus Formation: Is the Sznajd Model Different from a Voter Model?

In this paper, we investigate the so-called ``Sznajd Model'' (SM) in one dimension, which is a simple cellular automata approach to consensus formation among two opposite opinions (described by spin up or down). To elucidate the SM dynamics, we first provide results of computer simulations for the spatio-temporal evolution of the opinion distribution $L(t)$, the evolution of magnetization $m(t)$, the distribution of decision times $P(τ)$ and relaxation times $P(μ)$. In the main part of the paper, it is shown that the SM can be completely reformulated in terms of a linear VM, where the transition rates towards a given opinion are directly proportional to frequency of the respective opinion of the second-nearest neighbors (no matter what the nearest neighbors are). So, the SM dynamics can be reduced to one rule, ``Just follow your second-nearest neighbor''. The equivalence is demonstrated by extensive computer simulations that show the same behavior between SM and VM in terms of $L(t)$, $m(t)$, $P(τ)$, $P(μ)$, and the final attractor statistics. The reformulation of the SM in terms of a VM involves a new parameter $σ$, to bias between anti- and ferromagnetic decisions in the case of frustration. We show that $σ$ plays a crucial role in explaining the phase transition observed in SM. We further explore the role of synchronous versus asynchronous update rules on the intermediate dynamics and the final attractors. Compared to the original SM, we find three additional attractors, two of them related to an asymmetric coexistence between the opposite opinions.

cond-mat.stat-mech↗

arXiv2002

Self-Assembling of Networks in an Agent-Based Model

We propose a model to show the self-assembling of network-like structures between a set of nodes without using preexisting positional information or long-range attraction of the nodes. The model is based on Brownian agents that are capable of producing different local (chemical) information and respond to it in a non-linear manner. They solve two tasks in parallel: (i) the detection of the appropriate nodes, and (ii) the establishment of stable links between them. We present results of computer simulations that demonstrate the emergence of robust network structures and investigate the connectivity of the network by means of both analytical estimations and computer simulations. PACS: 05.65.+b, 89.75.Kd, 84.30.Bv, 87.18.Sn

cond-mat.stat-mech↗

arXiv2002

Evolution of Cooperation in a Spatial Prisoner's Dilemma

We investigate the spatial distribution and the global frequency of agents who can either cooperate or defect. The agent interaction is described by a deterministic, non-iterated prisoner's dilemma game, further each agent only locally interacts with his neighbors. Based on a detailed analysis of the local payoff structures we derive critical conditions for the invasion or the spatial coexistence of cooperators and defectors. These results are concluded in a phase diagram that allows to identify five regimes, each characterized by a distinct spatiotemporal dynamics and a corresponding final spatial structure. In addition to the complete invasion of defectors, we find coexistence regimes with either a majority of cooperators in large spatial domains, or a minority of cooperators organized in small non-stationary domains or in small clusters. The analysis further allowed a verification of computer simulation results by Nowak and May (1993). Eventually, we present simulation results of a true 5-person game on a lattice. This modification leads to non-uniform spatial interactions that may even enhance the effect of cooperation. Keywords: Prisoner's dilemma; cooperation; spatial 5-person game

cond-mat.stat-mech↗

arXiv2001

Statistical Mechanics of Canonical-Dissipative Systems and Applications to Swarm Dynamics

We develop the theory of canonical-dissipative systems, based on the assumption that both the conservative and the dissipative elements of the dynamics are determined by invariants of motion. In this case, known solutions for conservative systems can be used for an extension of the dynamics, which also includes elements such as the take-up/dissipation of energy. This way, a rather complex dynamics can be mapped to an analytically tractable model, while still covering important features of non-equilibrium systems. In our paper, this approach is used to derive a rather general swarm model that considers (a) the energetic conditions of swarming, i.e. for active motion, (b) interactions between the particles based on global couplings. We derive analytical expressions for the non-equilibrium velocity distribution and the mean squared displacement of the swarm. Further, we investigate the influence of different global couplings on the overall behavior of the swarm by means of particle-based computer simulations and compare them with the analytical estimations.

cond-mat.stat-mech↗

arXiv2001

Coordination of Decisions in a Spatial Agent Model

For a binary choice problem, the spatial coordination of decisions in an agent community is investigated both analytically and by means of stochastic computer simulations. The individual decisions are based on different local information generated by the agents with a finite lifetime and disseminated in the system with a finite velocity. We derive critical parameters for the emergence of minorities and majorities of agents making opposite decisions and investigate their spatial organization. We find that dependent on two essential parameters describing the local impact and the spatial dissemination of information, either a definite stable minority/majority relation (single-attractor regime) or a broad range of possible values (multi-attractor regime) occurs. In the latter case, the outcome of the decision process becomes rather diverse and hard to predict, both with respect to the share of the majority and their spatial distribution. We further investigate how a dissemination of information on different time scales affects the outcome of the decision process. We find that a more ``efficient'' information exchange within a subpopulation provides a suitable way to stabilize their majority status and to reduce ``diversity'' and uncertainty in the decision process.

cond-mat.stat-mech↗

arXiv2000

Phase transitions in social impact models of opinion formation

We study phase transitions in models of opinion formation which are based on the social impact theory. Two different models are discussed: (i) a cellular--automata based model of a finite group with a strong leader where persons can change their opinions but not their spatial positions, and (ii) a model with persons treated as active Brownian particles interacting via a communication field. In the first model, two stable phases are possible: a cluster around the leader, and a state of social unification. The transition into the second state occurs for a large leader strength and/or for a high level of social noise. In the second model, we find three stable phases, which correspond either to a ``paramagnetic'' phase (for high noise and strong diffusion), a ``ferromagnetic'' phase (for small nose and weak diffusion), or a phase with spatially separated ``domains'' (for intermediate conditions).

cond-mat.stat-mech↗