698 research outputs found
Analysis of complex contagions in random multiplex networks
We study the diffusion of influence in random multiplex networks where links
can be of different types, and for a given content (e.g., rumor, product,
political view), each link type is associated with a content dependent
parameter in that measures the relative bias type- links
have in spreading this content. In this setting, we propose a linear threshold
model of contagion where nodes switch state if their "perceived" proportion of
active neighbors exceeds a threshold \tau. Namely, a node connected to
active neighbors and inactive neighbors via type- links will turn
active if exceeds its threshold \tau. Under this
model, we obtain the condition, probability and expected size of global
spreading events. Our results extend the existing work on complex contagions in
several directions by i) providing solutions for coupled random networks whose
vertices are neither identical nor disjoint, (ii) highlighting the effect of
content on the dynamics of complex contagions, and (iii) showing that
content-dependent propagation over a multiplex network leads to a subtle
relation between the giant vulnerable component of the graph and the global
cascade condition that is not seen in the existing models in the literature.Comment: Revised 06/08/12. 11 Pages, 3 figure
Evolution of scale-free random graphs: Potts model formulation
We study the bond percolation problem in random graphs of weighted
vertices, where each vertex has a prescribed weight and an edge can
connect vertices and with rate . The problem is solved by the
limit of the -state Potts model with inhomogeneous interactions for
all pairs of spins. We apply this approach to the static model having
so that the resulting graph is scale-free with
the degree exponent . The number of loops as well as the giant
cluster size and the mean cluster size are obtained in the thermodynamic limit
as a function of the edge density, and their associated critical exponents are
also obtained. Finite-size scaling behaviors are derived using the largest
cluster size in the critical regime, which is calculated from the cluster size
distribution, and checked against numerical simulation results. We find that
the process of forming the giant cluster is qualitatively different between the
cases of and . While for the former, the giant
cluster forms abruptly at the percolation transition, for the latter, however,
the formation of the giant cluster is gradual and the mean cluster size for
finite shows double peaks.Comment: 34 pages, 9 figures, elsart.cls, final version appeared in NP
Complex Probabilities on R^N as Real Probabilities on C^N and an Application to Path Integrals
We establish a necessary and sufficient condition for averages over complex
valued weight functions on R^N to be represented as statistical averages over
real, non-negative probability weights on C^N. Using this result, we show that
many path-integrals for time-ordered expectation values of bosonic degrees of
freedom in real-valued time can be expressed as statistical averages over
ensembles of paths with complex-valued coordinates, and then speculate on
possible consequences of this result for the relation between quantum and
classical mechanics.Comment: 4 pages, 0 figure
Self-organized network evolution coupled to extremal dynamics
The interplay between topology and dynamics in complex networks is a
fundamental but widely unexplored problem. Here, we study this phenomenon on a
prototype model in which the network is shaped by a dynamical variable. We
couple the dynamics of the Bak-Sneppen evolution model with the rules of the
so-called fitness network model for establishing the topology of a network;
each vertex is assigned a fitness, and the vertex with minimum fitness and its
neighbours are updated in each iteration. At the same time, the links between
the updated vertices and all other vertices are drawn anew with a
fitness-dependent connection probability. We show analytically and numerically
that the system self-organizes to a non-trivial state that differs from what is
obtained when the two processes are decoupled. A power-law decay of dynamical
and topological quantities above a threshold emerges spontaneously, as well as
a feedback between different dynamical regimes and the underlying correlation
and percolation properties of the network.Comment: Accepted version. Supplementary information at
http://www.nature.com/nphys/journal/v3/n11/suppinfo/nphys729_S1.htm
Hacking events: project development practices and technology use at hackathons
Hackathons are techno-creative events during which participants get together in a physical location. They may be hosted by civic communities, corporations or public institutions. Working individually or in teams, usually for several days, participants develop projects such as hardware or software prototypes. Based on a digital ethnography of two events in the Netherlands and Denmark, this article investigates project development practices at hackathons. In particular, it analyses how participants organized their project work and which technologies were used in support of their creative endeavours. Hackathons are increasingly competitive rather than collaborative events, involving time pressure, inducements such as prizes, and requiring efficient skills utilization. I argue that this facilitates the following tendencies: Firstly, strategic effort is put into final presentations. Projects need to be convincingly presented, and persuasively pitching an idea becomes crucial. Secondly, there is only limited time for personal learning, since participants’ existing skills need to be efficiently applied if a team wants to stay competitive. This encourages division of labour within groups: a tendency which seems especially problematic given that IT skills biases are often expressed in terms of gender. Thirdly, participants are more inclined to use technologies that are proprietary but appear ‘open enough’. In light of this observation and by drawing on the concept of technology as resource and opportunity, I discuss the techno-political implications of utilized technologies. With this analysis, I aim at contributing to the critical debate on hackathons as productive but likewise ideologically significant fields of ‘hacking cultures’
E-cadherin can limit the transforming properties of activating β-catenin mutations
Wnt pathway deregulation is a common characteristic of many cancers. But only Colorectal Cancer predominantly harbours mutations in APC, whereas other cancer types (hepatocellular carcinoma, solid pseudopapillary tumours of pancreas) have activating mutations in β-catenin (CTNNB1). We have compared the dynamics and the potency of β-catenin mutations in vivo. Within the murine small intestine (SI), an activating mutation of β-catenin took much longer to achieve a Wnt deregulation and acquire a crypt-progenitor-cell (CPC) phenotype than Apc or Gsk3 loss. Within the colon, a single activating mutation of β-catenin was unable to drive Wnt deregulation or induce the CPC phenotype. This ability of β-catenin mutation to differentially transform the SI versus the colon correlated with significantly higher expression of the β-catenin binding partner E-cadherin. This increased expression is associated with a higher number of E-cadherin:β-catenin complexes at the membrane. Reduction of E-cadherin synergised with an activating mutation of β-catenin so there was now a rapid CPC phenotype within the colon and SI. Thus there is a threshold of β-catenin that is required to drive transformation and E-cadherin can act as a buffer to prevent β-catenin accumulation
Complex Langevin Equation and the Many-Fermion Problem
We study the utility of a complex Langevin (CL) equation as an alternative
for the Monte Carlo (MC) procedure in the evaluation of expectation values
occurring in fermionic many-body problems. We find that a CL approach is
natural in cases where non-positive definite probability measures occur, and
remains accurate even when the corresponding MC calculation develops a severe
``sign problem''. While the convergence of CL averages cannot be guaranteed in
principle, we show how convergent results can be obtained in three examples
ranging from simple one-dimensional integrals over quantum mechanical models to
a schematic shell model path integral.Comment: 19 pages, 10 PS figures embedded in tex
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
Swedish social insurance officers' experiences of difficulties in assessing applications for disability pensions – an interview study
<p>Abstract</p> <p>Background</p> <p>In this study the focus is on social insurance officers judging applications for disability pensions. The number of applications for disability pension increased during the late 1990s, which has resulted in an increasing number of disability pensions in Sweden. A more restrictive attitude towards the clients has however evolved, as societal costs have increased and governmental guidelines now focus on reducing costs. As a consequence, the quantitative and qualitative demands on social insurance officers when handling applications for disability pensions may have increased. The aim of this study was therefore to describe the social insurance officers' experiences of assessing applications for disability pensions after the government's introduction of stricter regulations.</p> <p>Methods</p> <p>Qualitative methodology was employed and a total of ten social insurance officers representing different experiences and ages were chosen. Open-ended interviews were performed with the ten social insurance officers. Data was analysed with inductive content analysis.</p> <p>Results</p> <p>Three themes could be identified as problematic in the social insurance officers' descriptions of dealing with the applications in order to reach a decision on whether the issue qualified applicants for a disability pension or not: 1. Clients are heterogeneous. 2. Ineffective and time consuming waiting for medical certificates impede the decision process. 3. Perspectives on the issue of work capacity differed among different stakeholders. The backgrounds of the clients differ considerably, leading to variation in the quality and content of applications. Social insurance officers had to make rapid decisions within a limited time frame, based on limited information, mainly on the basis of medical certificates that were often insufficient to judge work capacity. The role as coordinating actor with other stakeholders in the welfare system was perceived as frustrating, since different stakeholders have different goals and demands. The social insurance officers experience lack of control over the decision process, as regulations and other stakeholders restrict their work.</p> <p>Conclusion</p> <p>A picture emerges of difficulties due to disharmonized systems, stakeholder-bound goals causing some clients to fall between two stools, or leading to unnecessary waiting times, which may limit the clients' ability to take an active part in a constructive process. Increased communication with physicians about how to elaborate the medical certificates might improve the quality of certificates and thereby reduce the clients waiting time.</p
- …