Understanding the emergence of extreme opinions and in what kind of environment they might become less extreme is a central theme in our modern globalized society. A model combining continu 8c5 ous opinions and observed discrete actions (CODA) capable of addressing the important issue of measuring how extreme opinions might be has been recently proposed. In this paper I show extreme opinions to arise in a ubiquitous manner in the CODA model for a multitude of social network structures. Depending on network details reducing extremism seems to be possible. However, a large number agents with extreme opinions is always observed. A significant decrease in the number of extremists can be observed by allowing agents to change their positions in the network.

In this paper, we investigate the self-affirmation effect on formation of p 823 ublic opinion in a directed small-world social network. The system presents a non-equilibrium phase transition from a consensus state to a disordered state with coexistence of opinions. The dynamical behaviors are very sensitive to the density of long-range interactions and the strength of self-affirmation. When the long-range interactions are sparse and individual generally does not insist on his/her opinion, the system will display a continuous phase transition, in the opposite case with high self-affirmation strength and dense long-range interactions, the system does not display a phase transition. Between those two extreme cases, the system undergoes a discontinuous phase transition.

This article presents a study that compares detected structural communities in a coauthorship network to the socioacademic characteristics of the scholars that compose the network. The coauthorship network was created from the bibliographic record of a multi-institution, interdisciplinary research group focused on the study of sensor networks and wireless communication. Four different community detection algorithms were employed to assign a structural community to each scholar in the network: leading eigenvector, walktrap, edge betweenness and spinglass. Socioacademic characteristics were gathered from the scholars and include such information as their academic department, academic affiliation, country of origin, and academic position. A Pearson's $\chi^2$ test, with a simulated Monte Carlo, revealed that structural communities best represent groupings of individuals working in the same academic department and at the same institution. A generalization of this result suggests that, even in interdisciplinary, multi-institutional research groups, coauthorship is primarily driven by departmental and institutional affiliation.

We have performed detailed multifractal analysis on the minutely volatility of two indexes and 1139 stocks in the Chinese stock markets based on the partition function approach. The partition function $\chi_q(s)$ scales as a power law with respect to box size $s$. The scaling exponents $\tau(q)$ form a nonlinear function of $q$. Statistical tests based on bootstrapping show that the extracted multifractal nature is significant at the 1% significance level. The individual securities can be well modeled by the $p$-model in turbulence with $p = 0.40 \pm 0.02$. Based on the idea of ensemble averaging (including quenched and annealed average), we treat each stock exchange as a whole and confirm the existence of multifractal nature in the Chinese stock markets.

Complex networks topologies present interesting and surprising properties, such as community structures, which can be exploited to optimize communication, to find new efficient and context-aware routing algorithms or simply to understand the dynamics and meaning of relationships among nodes. Complex networks are gaining more and more importance as a reference model and are a powerful interpretation tool for many different kinds of natural, biological and social networks, where directed relationships and contextual belonging of nodes to many different communities is a matter of fact. This paper starts from the definition of modularity function, given by M. Newman to evaluate the goodness of network community decompositions, and extends it to the more general case of directed graphs with overlapping community structures. Interesting properties of the proposed extension are discussed, a method for finding overlapping communities is proposed and results of its application to benchmark case-studies are reported. We also propose a new dataset which could be used as a reference benchmark for overlapping community structures identification.