Skip to main content
We study a lattice model of a prey–predator system. Mean-field approximation predicts that the active phase, i.e., one with a finite fraction of preys and predators, is a generic phase of this model. Moreover, within this approximation... more
    • by 
    • Prey-Predator Simulations
    • by 
    •   3  
      Language EvolutionBaldwin EffectNaming Game
We examine an evolutionary naming-game model where communicating agents are equipped with an evolutionarily selected learning ability. Such a coupling of biological and linguistic ingredients results in an abrupt transition: upon a small... more
    • by 
    •   3  
      Language EvolutionBaldwin EffectNaming Game
Computational modelling with multi-agent systems is becoming an important technique of studying language evolution. We present a brief introduction into this rapidly developing field, as well as our own contributions that include an... more
    • by 
    •   2  
      Language evolution and developmentNaming Game
    • by 
    • by 
    •   9  
      Cognitive ScienceStatistical MechanicsGame TheoryArtificial Life
    • by 
    •   5  
      Mathematical PhysicsQuantum PhysicsComplex NetworksGenetic Algorithm
    • by 
    •   9  
      EngineeringNumerical SimulationMathematical SciencesPower Law
    • by 
    •   5  
      EngineeringKinetic TheoryMathematical SciencesPhysical sciences
    • by 
    •   9  
      EngineeringSimulated AnnealingScience and TechnologyMathematical Sciences
    • by 
    •   4  
      EngineeringMathematical SciencesPhysical sciencesHeat Conduction
    • by 
    •   11  
      EngineeringStatistical MechanicsHumansComputer Simulation
    • by 
    •   10  
      EngineeringMonte Carlo SimulationRandom WalkMathematical Sciences
    • by 
    •   12  
      EngineeringCommunicationLinguisticsLanguage
    • by 
    •   18  
      PaleontologyCoevolutionEcologyMagnetic field
We examine a weighted-network multiagent model with preferential selection such that agents choose partners with probability p(w), where w is the number of their past selections. When p(w) increases sublinearly with the number of past... more
    • by 
    •   8  
      EngineeringProbabilitySocial behaviorComputer Simulation
    • by 
    • Natural language
    • by 
    •   6  
      Monte Carlo SimulationRandom WalkTraveling Salesman ProblemSearch Space
    • by 
We examine a community structure in random graphs of size n and link probability p/n determined with the Newman greedy optimization of modularity. Calculations show that for p<1 communities are nearly identical with clusters. For p=1... more
    • by 
    •   8  
      EngineeringProbabilityHumansMathematical Sciences