How Much is the Whole Really More than the Sum of its Parts? 1 + 1 = 2.5: Superlinear Productivity in Collective Group Actions

In a variety of open source software projects, we document a superlinear growth of production ($R \sim c^\beta$) as a function of the number of active developers $c$, with $\beta \simeq 4/3$ with large dispersions. For a typical project in this class, doubling of the group size multiplies typically the output by a factor $2^\beta=2.5$, explaining the title. This superlinear law is found to hold for group sizes ranging from 5 to a few hundred developers. We propose two classes of mechanisms, {\it interaction-based} and {\it large deviation}, along with a cascade model of productive activity, which unifies them. In this common framework, superlinear productivity requires that the involved social groups function at or close to criticality, in the sense of a subtle balance between order and disorder. We report the first empirical test of the renormalization of the exponent of the distribution of the sizes of first generation events into the renormalized exponent of the distribution of clusters resulting from the cascade of triggering over all generation in a critical branching process in the non-meanfield regime. Finally, we document a size effect in the strength and variability of the superlinear effect, with smaller groups exhibiting widely distributed superlinear exponents, some of them characterizing highly productive teams. In contrast, large groups tend to have a smaller superlinearity and less variability.Comment: 29 pages, 8 figure

Multiple positive solutions to elliptic boundary blow-up problems

We prove the existence of multiple positive radial solutions to the sign-indefinite elliptic boundary blow-up problem $$\left\{\begin{array}{ll} \Delta u + \bigl(a^+(\vert x \vert) - \mu a^-(\vert x \vert)\bigr) g(u) = 0, & \; \vert x \vert < 1, \\ u(x) \to \infty, & \; \vert x \vert \to 1, \end{array} \right.$$ where $g$ is a function superlinear at zero and at infinity, $a^+$ and $a^-$ are the positive/negative part, respectively, of a sign-changing function $a$ and $\mu > 0$ is a large parameter. In particular, we show how the number of solutions is affected by the nodal behavior of the weight function $a$. The proof is based on a careful shooting-type argument for the equivalent singular ODE problem. As a further application of this technique, the existence of multiple positive radial homoclinic solutions to $$\Delta u + \bigl(a^+(\vert x \vert) - \mu a^-(\vert x \vert)\bigr) g(u) = 0, \qquad x \in \mathbb{R}^N,$$ is also considered

Gradient bounds for nonlinear degenerate parabolic equations and application to large time behavior of systems

We obtain new oscillation and gradient bounds for the viscosity solutions of fully nonlinear degenerate elliptic equations where the Hamiltonian is a sum of a sublinear and a superlinear part in the sense of Barles and Souganidis (2001). We use these bounds to study the asymptotic behavior of weakly coupled systems of fully nonlinear parabolic equations. Our results apply to some "asymmetric systems" where some equations contain a sublinear Hamiltonian whereas the others contain a superlinear one. Moreover, we can deal with some particular case of systems containing some degenerate equations using a generalization of the strong maximum principle for systems

Metrics for generalized persistence modules

We consider the question of defining interleaving metrics on generalized persistence modules over arbitrary preordered sets. Our constructions are functorial, which implies a form of stability for these metrics. We describe a large class of examples, inverse-image persistence modules, which occur whenever a topological space is mapped to a metric space. Several standard theories of persistence and their stability can be described in this framework. This includes the classical case of sublevelset persistent homology. We introduce a distinction between `soft' and `hard' stability theorems. While our treatment is direct and elementary, the approach can be explained abstractly in terms of monoidal functors.Comment: Final version; no changes from previous version. Published online Oct 2014 in Foundations of Computational Mathematics. Print version to appea