Homophily, Cultural Drift and the Co-Evolution of Cultural Groups

In studies of cultural differentiation, the joint mechanisms of homophily and influence have been able to explain how distinct cultural groups can form. While these mechanisms normally lead to cultural convergence, increased levels of heterogeneity can allow them to produce global diversity. However, this emergent cultural diversity has proven to be unstable in the face of "cultural drift"- small errors or innovations that allow cultures to change from within. We develop a model of cultural differentiation that combines the traditional mechanisms of homophily and influence with a third mechanism of 2network homophily", in which network structure co-evolves with cultural interaction. We show that if social ties are allowed to change with cultural influence, a complex relationship between heterogeneity and cultural diversity is revealed, in which increased heterogeneity can reduce cultural group formation while simultaneously increasing social connectedness. Our results show that in certain regions of the parameter space these co-evolutionary dynamics can lead to patterns of cultural diversity that are stable in the presence of cultural drift.Comment: (8 pages, 8 figures

Generic Absorbing Transition in Coevolution Dynamics

We study a coevolution voter model on a network that evolves according to the state of the nodes. In a single update, a link between opposite-state nodes is rewired with probability $p$, while with probability $1-p$ one of the nodes takes its neighbor's state. A mean-field approximation reveals an absorbing transition from an active to a frozen phase at a critical value $p_c=\frac{\mu-2}{\mu-1}$ that only depends on the average degree $\mu$ of the network. The approach to the final state is characterized by a time scale that diverges at the critical point as $\tau \sim |p_c-p|^{-1}$. We find that the active and frozen phases correspond to a connected and a fragmented network respectively. We show that the transition in finite-size systems can be seen as the sudden change in the trajectory of an equivalent random walk at the critical rewiring rate $p_c$, highlighting the fact that the mechanism behind the transition is a competition between the rates at which the network and the state of the nodes evolve.Comment: 5 pages, 4 figure

High-Throughput Microfluidic Platform for 3D Cultures of Mesenchymal Stem Cells, Towards Engineering Developmental Processes

The development of in vitro models to screen the effect of different concentrations, combinations and temporal sequences of morpho-regulatory factors on stem/progenitor cells is crucial to investigate and possibly recapitulate developmental processes with adult cells. Here, we designed and validated a microfluidic platform to (i) allow cellular condensation, (ii) culture 3D micromasses of human bone marrow-derived mesenchymal stromal cells (hBM-MSCs) under continuous flow perfusion, and (ii) deliver defined concentrations of morphogens to specific culture units. Condensation of hBM-MSCs was obtained within 3 hours, generating micromasses in uniform sizes (56.2 ± 3.9 μm). As compared to traditional macromass pellet cultures, exposure to morphogens involved in the first phases of embryonic limb development (i.e. Wnt and FGF pathways) yielded more uniform cell response throughout the 3D structures of perfused micromasses (PMMs), and a 34-fold higher percentage of proliferating cells at day 7. The use of a logarithmic serial dilution generator allowed to identify an unexpected concentration of TGFβ3 (0.1 ng/ml) permissive to hBM-MSCs proliferation and inductive to chondrogenesis. This proof-of-principle study supports the described microfluidic system as a tool to investigate processes involved in mesenchymal progenitor cells differentiation, towards a ‘developmental engineering’ approach for skeletal tissue regeneration

Influence Diffusion in Social Networks under Time Window Constraints

We study a combinatorial model of the spread of influence in networks that generalizes existing schemata recently proposed in the literature. In our model, agents change behaviors/opinions on the basis of information collected from their neighbors in a time interval of bounded size whereas agents are assumed to have unbounded memory in previously studied scenarios. In our mathematical framework, one is given a network $G=(V,E)$, an integer value $t(v)$ for each node $v\in V$, and a time window size $\lambda$. The goal is to determine a small set of nodes (target set) that influences the whole graph. The spread of influence proceeds in rounds as follows: initially all nodes in the target set are influenced; subsequently, in each round, any uninfluenced node $v$ becomes influenced if the number of its neighbors that have been influenced in the previous $\lambda$ rounds is greater than or equal to $t(v)$. We prove that the problem of finding a minimum cardinality target set that influences the whole network $G$ is hard to approximate within a polylogarithmic factor. On the positive side, we design exact polynomial time algorithms for paths, rings, trees, and complete graphs.Comment: An extended abstract of a preliminary version of this paper appeared in: Proceedings of 20th International Colloquium on Structural Information and Communication Complexity (Sirocco 2013), Lectures Notes in Computer Science vol. 8179, T. Moscibroda and A.A. Rescigno (Eds.), pp. 141-152, 201

Reinforcement-Driven Spread of Innovations and Fads

We propose kinetic models for the spread of permanent innovations and transient fads by the mechanism of social reinforcement. Each individual can be in one of M+1 states of awareness 0,1,2,...,M, with state M corresponding to adopting an innovation. An individual with awareness k<M increases to k+1 by interacting with an adopter. Starting with a single adopter, the time for an initially unaware population of size N to adopt a permanent innovation grows as ln(N) for M=1, and as N^{1-1/M} for M>1. The fraction of the population that remains clueless about a transient fad after it has come and gone changes discontinuously as a function of the fad abandonment rate lambda for M>1. The fad dies out completely in a time that varies non-monotonically with lambda.Comment: 4 pages, 2 columns, 5 figures, revtex 4-1 format; revised version has been expanded and put into iop format, with one figure adde

Cascade Dynamics of Multiplex Propagation

Random links between otherwise distant nodes can greatly facilitate the propagation of disease or information, provided contagion can be transmitted by a single active node. However we show that when the propagation requires simultaneous exposure to multiple sources of activation, called multiplex propagation, the effect of random links is just the opposite: it makes the propagation more difficult to achieve. We calculate analytical and numerically critical points for a threshold model in several classes of complex networks, including an empirical social network.Comment: 4 pages, 5 figures, for similar work visit http://hsd.soc.cornell.edu and http://www.imedea.uib.es/physdep

The Routing of Complex Contagion in Kleinberg's Small-World Networks

In Kleinberg's small-world network model, strong ties are modeled as deterministic edges in the underlying base grid and weak ties are modeled as random edges connecting remote nodes. The probability of connecting a node $u$ with node $v$ through a weak tie is proportional to $1/|uv|^\alpha$, where $|uv|$ is the grid distance between $u$ and $v$ and $\alpha\ge 0$ is the parameter of the model. Complex contagion refers to the propagation mechanism in a network where each node is activated only after $k \ge 2$ neighbors of the node are activated. In this paper, we propose the concept of routing of complex contagion (or complex routing), where we can activate one node at one time step with the goal of activating the targeted node in the end. We consider decentralized routing scheme where only the weak ties from the activated nodes are revealed. We study the routing time of complex contagion and compare the result with simple routing and complex diffusion (the diffusion of complex contagion, where all nodes that could be activated are activated immediately in the same step with the goal of activating all nodes in the end). We show that for decentralized complex routing, the routing time is lower bounded by a polynomial in $n$ (the number of nodes in the network) for all range of $\alpha$ both in expectation and with high probability (in particular, $\Omega(n^{\frac{1}{\alpha+2}})$ for $\alpha \le 2$ and $\Omega(n^{\frac{\alpha}{2(\alpha+2)}})$ for $\alpha > 2$ in expectation), while the routing time of simple contagion has polylogarithmic upper bound when $\alpha = 2$. Our results indicate that complex routing is harder than complex diffusion and the routing time of complex contagion differs exponentially compared to simple contagion at sweetspot.Comment: Conference version will appear in COCOON 201

Dynamics in online social networks

An increasing number of today's social interactions occurs using online social media as communication channels. Some online social networks have become extremely popular in the last decade. They differ among themselves in the character of the service they provide to online users. For instance, Facebook can be seen mainly as a platform for keeping in touch with close friends and relatives, Twitter is used to propagate and receive news, LinkedIn facilitates the maintenance of professional contacts, Flickr gathers amateurs and professionals of photography, etc. Albeit different, all these online platforms share an ingredient that pervades all their applications. There exists an underlying social network that allows their users to keep in touch with each other and helps to engage them in common activities or interactions leading to a better fulfillment of the service's purposes. This is the reason why these platforms share a good number of functionalities, e.g., personal communication channels, broadcasted status updates, easy one-step information sharing, news feeds exposing broadcasted content, etc. As a result, online social networks are an interesting field to study an online social behavior that seems to be generic among the different online services. Since at the bottom of these services lays a network of declared relations and the basic interactions in these platforms tend to be pairwise, a natural methodology for studying these systems is provided by network science. In this chapter we describe some of the results of research studies on the structure, dynamics and social activity in online social networks. We present them in the interdisciplinary context of network science, sociological studies and computer science.Comment: 17 pages, 4 figures, book chapte

Chest pain and a left parasternal soft tissue swelling in an immunocompetent refugee with disseminated tuberculosis

An immunocompetent migrant with chest pain was admitted to an Italian hospital. CT scan showed a left pectoral abscess and osteomyelitis of the sternum. The infection spread into the anterior mediastinum near to the pericardium and the heart, where an atrial mass was confirmed by echocardiography. Disseminated tuberculosis was diagnosed

A Protocol Guide for the N. crassa Yeast Artificial Chromosome Library

A yeast artificial chromosome (YAC) library of Neurospora crassa strain 74-OR23-1A has been constructed. This library has been used to clone 750 kb of contiguous DNA sequences from the centromere region of linkage group VII (M. Centola and J. Carbon. 1994. Mol. Cell. Biol. 14:1510-1519). The purpose of this article is explicitly to outline procedures that have been developed for library screening and chromosome walking