The Sznajd Consensus Model with Continuous Opinions

In the consensus model of Sznajd, opinions are integers and a randomly chosen pair of neighbouring agents with the same opinion forces all their neighbours to share that opinion. We propose a simple extension of the model to continuous opinions, based on the criterion of bounded confidence which is at the basis of other popular consensus models. Here the opinion s is a real number between 0 and 1, and a parameter \epsilon is introduced such that two agents are compatible if their opinions differ from each other by less than \epsilon. If two neighbouring agents are compatible, they take the mean s_m of their opinions and try to impose this value to their neighbours. We find that if all neighbours take the average opinion s_m the system reaches complete consensus for any value of the confidence bound \epsilon. We propose as well a weaker prescription for the dynamics and discuss the corresponding results.Comment: 11 pages, 4 figures. To appear in International Journal of Modern Physics

Universality of the Threshold for Complete Consensus for the Opinion Dynamics of Deffuant et al

In the compromise model of Deffuant et al., opinions are real numbers between 0 and 1 and two agents are compatible if the difference of their opinions is smaller than the confidence bound parameter \epsilon. The opinions of a randomly chosen pair of compatible agents get closer to each other. We provide strong numerical evidence that the threshold value of \epsilon above which all agents share the same opinion in the final configuration is 1/2, independently of the underlying social topology.Comment: 8 pages, 4 figures, to appear in Int. J. Mod. Phys. C 15, issue

Dynamics of Majority Rule

We introduce a 2-state opinion dynamics model where agents evolve by majority rule. In each update, a group of agents is specified whose members then all adopt the local majority state. In the mean-field limit, where a group consists of randomly-selected agents, consensus is reached in a time that scales ln N, where N is the number of agents. On finite-dimensional lattices, where a group is a contiguous cluster, the consensus time fluctuates strongly between realizations and grows as a dimension-dependent power of N. The upper critical dimension appears to be larger than 4. The final opinion always equals that of the initial majority except in one dimension.Comment: 4 pages, 3 figures, 2-column revtex4 format; annoying typo fixed in Eq.(1); a similar typo fixed in Eq.(6) and some references update

Microscopic activity patterns in the Naming Game

The models of statistical physics used to study collective phenomena in some interdisciplinary contexts, such as social dynamics and opinion spreading, do not consider the effects of the memory on individual decision processes. On the contrary, in the Naming Game, a recently proposed model of Language formation, each agent chooses a particular state, or opinion, by means of a memory-based negotiation process, during which a variable number of states is collected and kept in memory. In this perspective, the statistical features of the number of states collected by the agents becomes a relevant quantity to understand the dynamics of the model, and the influence of topological properties on memory-based models. By means of a master equation approach, we analyze the internal agent dynamics of Naming Game in populations embedded on networks, finding that it strongly depends on very general topological properties of the system (e.g. average and fluctuations of the degree). However, the influence of topological properties on the microscopic individual dynamics is a general phenomenon that should characterize all those social interactions that can be modeled by memory-based negotiation processes.Comment: submitted to J. Phys.

Similarity solutions of Fokker-Planck equation with time-dependent coefficients

In this work, we consider the solvability of the Fokker-Planck equation with both time-dependent drift and diffusion coefficients by means of the similarity method. By the introduction of the similarity variable, the Fokker-Planck equation is reduced to an ordinary differential equation. Adopting the natural requirement that the probability current density vanishes at the boundary, the resulted ordinary differential equation turns out to be integrable, and the probability density function can be given in closed form. New examples of exactly solvable Fokker-Planck equations are presented, and their properties analyzed.Comment: 13 pages, 8 figures. Version to appear in Ann. Phys. Presentation improved. Discussions and figures of easy examples remove

Conformance checking and performance improvement in scheduled processes: A queueing-network perspective

Service processes, for example in transportation, telecommunications or the health sector, are the backbone of today's economies. Conceptual models of service processes enable operational analysis that supports, e.g., resource provisioning or delay prediction. In the presence of event logs containing recorded traces of process execution, such operational models can be mined automatically.In this work, we target the analysis of resource-driven, scheduled processes based on event logs. We focus on processes for which there exists a pre-defined assignment of activity instances to resources that execute activities. Specifically, we approach the questions of conformance checking (how to assess the conformance of the schedule and the actual process execution) and performance improvement (how to improve the operational process performance). The first question is addressed based on a queueing network for both the schedule and the actual process execution. Based on these models, we detect operational deviations and then apply statistical inference and similarity measures to validate the scheduling assumptions, thereby identifying root-causes for these deviations. These results are the starting point for our technique to improve the operational performance. It suggests adaptations of the scheduling policy of the service process to decrease the tardiness (non-punctuality) and lower the flow time. We demonstrate the value of our approach based on a real-world dataset comprising clinical pathways of an outpatient clinic that have been recorded by a real-time location system (RTLS). Our results indicate that the presented technique enables localization of operational bottlenecks along with their root-causes, while our improvement technique yields a decrease in median tardiness and flow time by more than 20%

Consensus formation on adaptive networks

The structure of a network can significantly influence the properties of the dynamical processes which take place on them. While many studies have been devoted to this influence, much less attention has been devoted to the interplay and feedback mechanisms between dynamical processes and network topology on adaptive networks. Adaptive rewiring of links can happen in real life systems such as acquaintance networks where people are more likely to maintain a social connection if their views and values are similar. In our study, we consider different variants of a model for consensus formation. Our investigations reveal that the adaptation of the network topology fosters cluster formation by enhancing communication between agents of similar opinion, though it also promotes the division of these clusters. The temporal behavior is also strongly affected by adaptivity: while, on static networks, it is influenced by percolation properties, on adaptive networks, both the early and late time evolution of the system are determined by the rewiring process. The investigation of a variant of the model reveals that the scenarios of transitions between consensus and polarized states are more robust on adaptive networks.Comment: 11 pages, 14 figure

Incised-valley morphologies and sedimentary-fills within the inner shelf of the northern Bay of Biscay

This study is a first synthesis focused on incised-valleys located within the inner shelf of the Bay of Biscay. It is based on previously published results obtained during recent seismic surveys and coring campaigns. The morphology of the valleys appears to be strongly controlled by tectonics and lithology. The Pleistocene sedimentary cover of the shelf is very thin and discontinuous with a maximum thickness ranging between 30 and 40 m in incised-valley fills. Thus the incised bedrock morphology plays a key-role by controlling hydrodynamics and related sediment transport and deposition that explains some variations of those incised-valley fills with respect to the previously published general models

Consensus formation on coevolving networks: groups' formation and structure

We study the effect of adaptivity on a social model of opinion dynamics and consensus formation. We analyze how the adaptivity of the network of contacts between agents to the underlying social dynamics affects the size and topological properties of groups and the convergence time to the stable final state. We find that, while on static networks these properties are determined by percolation phenomena, on adaptive networks the rewiring process leads to different behaviors: Adaptive rewiring fosters group formation by enhancing communication between agents of similar opinion, though it also makes possible the division of clusters. We show how the convergence time is determined by the characteristic time of link rearrangement. We finally investigate how the adaptivity yields nontrivial correlations between the internal topology and the size of the groups of agreeing agents.Comment: 10 pages, 3 figures,to appear in a special proceedings issue of J. Phys. A covering the "Complex Networks: from Biology to Information Technology" conference (Pula, Italy, 2007