arXiv subjects

José F. Fontanari

Publications and source records attributed to José F. Fontanari.

At least 55 records · Page 3Linked to original sources

arXiv2017

The collapse of ecosystem engineer populations

Humans are the ultimate ecosystem engineers who have profoundly transformed the world's landscapes in order to enhance their survival. Somewhat paradoxically, however, sometimes the unforeseen effect of this ecosystem engineering is the very collapse of the population it intended to protect. Here we use a spatial version of a standard population dynamics model of ecosystem engineers to study the colonization of unexplored virgin territories by a small settlement of engineers. We find that during the expansion phase the population density reaches values much higher than those the environment can support in the equilibrium situation. When the colonization front reaches the boundary of the available space, the population density plunges sharply and attains its equilibrium value. The collapse takes place without warning and happens just after the population reaches its peak number. We conclude that overpopulation and the consequent collapse of an expanding population of ecosystem engineers is a natural consequence of the nonlinear feedback between the population and environment variables.

q-bio.PE↗

arXiv2017

The spatial dynamics of ecosystem engineers

The changes on abiotic features of ecosystems have rarely been taken into account by population dynamics models, which typically focus on trophic and competitive interactions between species. However, understanding the population dynamics of organisms that must modify their habitats in order to survive, the so-called ecosystem engineers, requires the explicit incorporation of abiotic interactions in the models. Here we study a model of ecosystem engineers that is discrete both in space and time, and where the engineers and their habitats are arranged in patches fixed to the sites of regular lattices. The growth of the engineer population is modeled by Ricker equation with a density-dependent carrying capacity that is given by the number of modified habitats. A diffusive dispersal stage ensures that a fraction of the engineers move from their birth patches to neighboring patches. We find that dispersal influences the metapopulation dynamics only in the case that the local or single-patch dynamics exhibits chaotic behavior. In that case, it can suppress the chaotic behavior and avoid extinctions in the regime of large intrinsic growth rate of the population.

q-bio.PE↗

arXiv2017

The revival of the Baldwin Effect

The idea that a genetically fixed behavior evolved from the once differential learning ability of individuals that performed the behavior is known as the Baldwin effect. A highly influential paper [Hinton G.E., Nowlan S.J., 1987. How learning can guide evolution. Complex Syst. 1, 495-502] claimed that this effect can be observed in silico, but here we argue that what was actually shown is that the learning ability is easily selected for. Then we demonstrate the Baldwin effect to happen in the in silico scenario by estimating the probability and waiting times for the learned behavior to become innate. Depending on parameter values, we find that learning can increase the chance of fixation of the learned behavior by several orders of magnitude compared with the non-learning situation.

q-bio.PE↗

arXiv2017

Reputation blackboard systems

Blackboard systems are motivated by the popular view of task forces as brainstorming groups in which specialists write promising ideas to solve a problem in a central blackboard. Here we study a minimal model of blackboard system designed to solve cryptarithmetic puzzles, where hints are posted anonymously on a public display (standard blackboard) or are posted together with information about the reputations of the agents that posted them (reputation blackboard). We find that the reputation blackboard always outperforms the standard blackboard, which, in turn, always outperforms the independent search. The asymptotic distribution of the computational cost of the search, which is proportional to the total number of agent updates required to find the solution of the puzzle, is an exponential distribution for those three search heuristics. Only for the reputation blackboard we find a nontrivial dependence of the mean computational cost on the system size and, in that case, the optimal performance is achieved by a single agent working alone, indicating that, though the blackboard organization can produce impressive performance gains when compared with the independent search, it is not very supportive of cooperative work.

cs.DC↗

arXiv2017

Awareness improves problem-solving performance

The brain's self-monitoring of activities, including internal activities -- a functionality that we refer to as awareness -- has been suggested as a key element of consciousness. Here we investigate whether the presence of an inner-eye-like process (monitor) that supervises the activities of a number of subsystems (operative agents) engaged in the solution of a problem can improve the problem-solving efficiency of the system. The problem is to find the global maximum of a NK fitness landscape and the performance is measured by the time required to find that maximum. The operative agents explore blindly the fitness landscape and the monitor provides them with feedback on the quality (fitness) of the proposed solutions. This feedback is then used by the operative agents to bias their searches towards the fittest regions of the landscape. We find that a weak feedback between the monitor and the operative agents improves the performance of the system, regardless of the difficulty of the problem, which is gauged by the number of local maxima in the landscape. For easy problems (i.e., landscapes without local maxima), the performance improves monotonically as the feedback strength increases, but for difficult problems, there is an optimal value of the feedback strength beyond which the system performance degrades very rapidly.

cs.AI↗

arXiv2017

Impact of centrality on cooperative processes

The solution of today's complex problems requires the grouping of task forces whose members are usually connected remotely over long physical distances and different time zones. Hence, understanding the effects of imposed communication patterns (i.e., who can communicate with whom) on group performance is important. Here, we use an agent-based model to explore the influence of the betweenness centrality of the nodes on the time the group requires to find the global maxima of NK-fitness landscapes. The agents cooperate by broadcasting messages, informing on their fitness to their neighbors, and use this information to copy the more successful agents in their neighborhood. We find that for easy tasks (smooth landscapes), the topology of the communication network has no effect on the performance of the group, and that the more central nodes are the most likely to find the global maximum first. For difficult tasks (rugged landscapes), however, we find a positive correlation between the variance of the betweenness among the network nodes and the group performance. For these tasks, the performances of individual nodes are strongly influenced by the agents dispositions to cooperate and by the particular realizations of the rugged landscapes.

physics.soc-ph↗

arXiv2016

Effect of long-range interactions on the phase transition of Axelrod's model

Axelrod's model with $F=2$ cultural features, where each feature can assume $k$ states drawn from a Poisson distribution of parameter $q$, exhibits a continuous nonequilibrium phase transition in the square lattice. Here we use extensive Monte Carlo simulations and finite size scaling to study the critical behavior of the order parameter $ρ$, which is the fraction of sites that belong to the largest domain of an absorbing configuration averaged over many runs. We find that it vanishes as $ρ\sim \left (q_c^0 - q \right)^β$ with $β\approx 0.25$ at the critical point $q_c^0 \approx 3.10$ and that the exponent that measures the width of the critical region is $ν^0 \approx 2.1$. In addition, we find that introduction of long-range links by rewiring the nearest-neighbors links of the square lattice with probability $p$ turns the transition discontinuous, with the critical point $q_c^p$ increasing from $3.1$ to $27.17$, approximately, as $p$ increases from $0$ to $1$. The sharpness of the threshold, as measured by the exponent $ν^p \approx 1$ for $p>0$, increases with the square root of the number of nodes of the resulting small-world network.

cond-mat.stat-mech↗

arXiv2016

Effect of group organization on the performance of cooperative processes

Problem-solving competence at group level is influenced by the structure of the social networks and so it may shed light on the organization patterns of gregarious animals. Here we use an agent-based model to investigate whether the ubiquity of hierarchical networks in nature could be explained as the result of a selection pressure favoring problem-solving efficiency. The task of the agents is to find the global maxima of NK fitness landscapes and the agents cooperate by broadcasting messages informing on their fitness to the group. This information is then used to imitate, with a certain probability, the fittest agent in their influence networks. For rugged landscapes, we find that the modular organization of the hierarchical network with its high degree of clustering eases the escape from the local maxima, resulting in a superior performance as compared with the scale-free and the random networks. The optimal performance in a rugged landscape is achieved by letting the main hub to be only slightly more propense to imitate the other agents than vice versa. The performance is greatly harmed when the main hub carries out the search independently of the rest of the group as well as when it compulsively imitates the other agents.

cs.SI↗

arXiv2016

When more of the same is better

Problem solving (e.g., drug design, traffic engineering, software development) by task forces represents a substantial portion of the economy of developed countries. Here we use an agent-based model of cooperative problem solving systems to study the influence of diversity on the performance of a task force. We assume that agents cooperate by exchanging information on their partial success and use that information to imitate the more successful agent in the system -- the model. The agents differ only in their propensities to copy the model. We find that, for easy tasks, the optimal organization is a homogeneous system composed of agents with the highest possible copy propensities. For difficult tasks, we find that diversity can prevent the system from being trapped in sub-optimal solutions. However, when the system size is adjusted to maximize performance the homogeneous systems outperform the heterogeneous systems, i.e., for optimal performance, sameness should be preferred to diversity.

cs.MA↗

arXiv2015

Influence of network topology on cooperative problem-solving systems

The idea of a collective intelligence behind the complex natural structures built by organisms suggests that the organization of social networks is selected so as to optimize problem-solving competence at the group-level. Here we study the influence of the social network topology on the performance of a group of agents whose task is to locate the global maxima of NK fitness landscapes. Agents cooperate by broadcasting messages informing on their fitness and use this information to imitate the fittest agent in their influence networks. In the case those messages convey accurate information on the proximity of the solution (i.e., for smooth fitness landscapes) we find that high connectivity as well as centralization boost the group performance. For rugged landscapes, however, these characteristics are beneficial for small groups only. For large groups, it is advantageous to slow down the information transmission through the network to avoid local maximum traps. Long-range links and modularity have marginal effects on the performance of the group, except for a very narrow region of the model parameters.

cs.SI↗

arXiv2015

Diffusion of innovations in Axelrod's model

Axelrod's model for the dissemination of culture contains two key factors required to model the process of diffusion of innovations, namely, social influence (i.e., individuals become more similar when they interact) and homophily (i.e., individuals interact preferentially with similar others). The strength of these social influences are controlled by two parameters: $F$, the number of features that characterizes the cultures and $q$, the common number of states each feature can assume. Here we assume that the innovation is a new state of a cultural feature of a single individual -- the innovator -- and study how the innovation spreads through the networks among the individuals. For infinite regular lattices in one (1D) and two dimensions (2D), we find that initially the successful innovation spreads linearly with the time $t$, but in the long-time limit it spreads diffusively ($\sim t^{1/2}$) in 1D and sub-diffusively ($\sim t/\ln t$) in 2D. For finite lattices, the growth curves for the number of adopters are typically concave functions of $t$. For random graphs with a finite number of nodes $N$, we argue that the classical S-shaped growth curves result from a trade-off between the average connectivity $K$ of the graph and the per feature diversity $q$. A large $q$ is needed to reduce the pace of the initial spreading of the innovation and thus delimit the early-adopters stage, whereas a large $K$ is necessary to ensure the onset of the take-off stage at which the number of adopters grows superlinearly with $t$. In an infinite random graph we find that the number of adopters of a successful innovation scales with $t^γ$ with $γ=1$ for $K> 2$ and $1/2 < γ< 1$ for $K=2$. We suggest that the exponent $γ$ may be a useful index to characterize the process of diffusion of successful innovations in diverse scenarios.

physics.soc-ph↗

arXiv2015

Exploring NK Fitness Landscapes Using Imitative Learning

The idea that a group of cooperating agents can solve problems more efficiently than when those agents work independently is hardly controversial, despite our obliviousness of the conditions that make cooperation a successful problem solving strategy. Here we investigate the performance of a group of agents in locating the global maxima of NK fitness landscapes with varying degrees of ruggedness. Cooperation is taken into account through imitative learning and the broadcasting of messages informing on the fitness of each agent. We find a trade-off between the group size and the frequency of imitation: for rugged landscapes, too much imitation or too large a group yield a performance poorer than that of independent agents. By decreasing the diversity of the group, imitative learning may lead to duplication of work and hence to a decrease of its effective size. However, when the parameters are set to optimal values the cooperative group substantially outperforms the independent agents.

cs.MA↗

arXiv2015

The nature of the continuous nonequilibrium phase transition of Axelrod's model

Axelrod's model in the square lattice with nearest-neighbors interactions exhibits culturally homogeneous as well as culturally fragmented absorbing configurations. In the case the agents are characterized by $F=2$ cultural features and each feature assumes $k$ states drawn from a Poisson distribution of parameter $q$ these regimes are separated by a continuous transition at $q_c = 3.10 \pm 0.02$. Using Monte Carlo simulations and finite size scaling we show that the mean density of cultural domains $μ$ is an order parameter of the model that vanishes as $μ\sim \left ( q - q_c \right)^β$ with $β= 0.67 \pm 0.01$ at the critical point. In addition, for the correlation length critical exponent we find $ν= 1.63 \pm 0.04$ and for Fisher's exponent, $τ= 1.76 \pm 0.01$. This set of critical exponents places the continuous phase transition of Axelrod's model apart from the known universality classes of nonequilibrium lattice models.

physics.soc-ph↗

arXiv2015

The consensus in the two-feature two-state one-dimensional Axelrod model revisited

The Axelrod model for the dissemination of culture exhibits a rich spatial distribution of cultural domains, which depends on the values of the two model parameters: $F$, the number of cultural features and $q$, the common number of states each feature can assume. In the one-dimensional model with $F=q=2$, which is closely related to the constrained voter model, Monte Carlo simulations indicate the existence of multicultural absorbing configurations in which at least one macroscopic domain coexist with a multitude of microscopic ones in the thermodynamic limit. However, rigorous analytical results for the infinite system starting from the configuration where all cultures are equally likely show convergence to only monocultural or consensus configurations. Here we show that this disagreement is due simply to the order that the time-asymptotic limit and the thermodynamic limit are taken in the simulations. In addition, we show how the consensus-only result can be derived using Monte Carlo simulations of finite chains.

physics.soc-ph↗

arXiv2014

Phenotypic Plasticity, the Baldwin Effect, and the Speeding up of Evolution: the Computational Roots of an Illusion

An increasing number of dissident voices claim that the standard neo-Darwinian view of genes as 'leaders' and phenotypes as 'followers' during the process of adaptive evolution should be turned on its head. This idea is older than the rediscovery of Mendel's laws of inheritance and has been given several names before its final 'Baldwin effect' label. A condition for this effect is that environmentally induced variation such as phenotypic plasticity or learning is crucial for the initial establishment of a population. This gives the necessary time for natural selection to act on genetic variation and the adaptive trait can be eventually encoded in the genotype. An influential paper published in the late 1980s showed the Baldwin effect to happen in computer simulations, and claimed that it was crucial to solve a difficult adaptive task. This generated much excitement among scholars in various disciplines that regard neo-Darwinian accounts to explain the evolutionary emergence of high-order phenotypic traits such as consciousness or language almost hopeless. Here, we use analytical and computational approaches to show that a standard population genetics treatment can easily crack what the scientific community has granted as an unsolvable adaptive problem without learning. The Baldwin effect is once again in need of convincing theoretical foundations.

q-bio.PE↗

arXiv2014

Imitative learning as a connector of collective brains

The notion that cooperation can aid a group of agents to solve problems more efficiently than if those agents worked in isolation is prevalent, despite the little quantitative groundwork to support it. Here we consider a primordial form of cooperation -- imitative learning -- that allows an effective exchange of information between agents, which are viewed as the processing units of a social intelligence system or collective brain. In particular, we use agent-based simulations to study the performance of a group of agents in solving a cryptarithmetic problem. An agent can either perform local random moves to explore the solution space of the problem or imitate a model agent -- the best performing agent in its influence network. There is a complex trade-off between the number of agents N and the imitation probability p, and for the optimal balance between these parameters we observe a thirtyfold diminution in the computational cost to find the solution of the cryptarithmetic problem as compared with the independent search. If those parameters are chosen far from the optimal setting, however, then imitative learning can impair greatly the performance of the group. The observed maladaptation of imitative learning for large N offers an alternative explanation for the group size of social animals.

nlin.AO↗

arXiv2011

The media effect in Axelrod's model explained

We revisit the problem of introducing an external global field -- the mass media -- in Axelrod's model of social dynamics, where in addition to their nearest neighbors, the agents can interact with a virtual neighbor whose cultural features are fixed from the outset. The finding that this apparently homogenizing field actually increases the cultural diversity has been considered a puzzle since the phenomenon was first reported more than a decade ago. Here we offer a simple explanation for it, which is based on the pedestrian observation that Axelrod's model exhibits more cultural diversity, i.e., more distinct cultural domains, when the agents are allowed to interact solely with the media field than when they can interact with their neighbors as well. In this perspective, it is the local homogenizing interactions that work towards making the absorbing configurations less fragmented as compared with the extreme situation in which the agents interact with the media only.

physics.soc-ph↗

arXiv2009

Cross-situational and supervised learning in the emergence of communication

Scenarios for the emergence or bootstrap of a lexicon involve the repeated interaction between at least two agents who must reach a consensus on how to name N objects using H words. Here we consider minimal models of two types of learning algorithms: cross-situational learning, in which the individuals determine the meaning of a word by looking for something in common across all observed uses of that word, and supervised operant conditioning learning, in which there is strong feedback between individuals about the intended meaning of the words. Despite the stark differences between these learning schemes, we show that they yield the same communication accuracy in the realistic limits of large N and H, which coincides with the result of the classical occupancy problem of randomly assigning N objects to H words.

cs.LG↗