Split energy cascade in turbulent thin fluid layers

We discuss the phenomenology of the split energy cascade in a three-dimensional thin fluid layer by mean of high resolution numerical simulations of the Navier-Stokes equations. We observe the presence of both an inverse energy cascade at large scales, as predicted for two-dimensional turbu- lence, and of a direct energy cascade at small scales, as in three-dimensional turbulence. The inverse energy cascade is associated with a direct cascade of enstrophy in the intermediate range of scales. Notably, we find that the inverse cascade of energy in this system is not a pure 2D phenomenon, as the coupling with the 3D velocity field is necessary to guarantee the constancy of fluxes

Condensate in quasi two-dimensional turbulence

We investigate the process of formation of large-scale structures in a turbulent flow confined in a thin layer. By means of direct numerical simulations of the Navier-Stokes equations, forced at an intermediate scale, we obtain a split of the energy cascade in which one fraction of the input goes to small scales generating the three-dimensional direct cascade. The remaining energy flows to large scales producing the inverse cascade which eventually causes the formation of a quasi two-dimensional condensed state at the largest horizontal scale. Our results shows that the connection between the two actors of the split energy cascade in thin layers is tighter than what was established before: the small scale three-dimensional turbulence acts as an effective viscosity and dissipates the large-scale energy thus providing a viscosity-independent mechanism for arresting the growth of the condensate. This scenario is supported by quantitative predictions of the saturation energy in the condensate

On positivity of parton distributions

We discuss the bounds on polarized parton distributions which follow from their definition in terms of cross section asymmetries. We spell out how the bounds obtained in the naive parton model can be derived within perturbative QCD at leading order when all quark and gluon distributions are defined in terms of suitable physical processes. We specify a convenient physical definition for the polarized and unpolarized gluon distributions in terms of Higgs production from gluon fusion. We show that these bounds are modified by subleading corrections, and we determine them up to NLO. We examine the ensuing phenomenological implications, in particular in view of the determination of the polarized gluon distribution.Comment: 20 pages, 8 figures included by epsf, plain tex with harvma

Singlet parton evolution at small x: a theoretical update

This is an extended and pedagogically oriented version of our recent work, in which we proposed an improvement of the splitting functions at small x which overcomes the apparent problems encountered by the BFKL approach.Comment: 30 pages, 8 figures, latex with sprocl.sty and epsfi

An Improved Splitting Function for Small x Evolution

We summarize our recent result for a splitting function for small x evolution which includes resummed small x logarithms deduced from the leading order BFKL equation with the inclusion of running coupling effects. We compare this improved splitting function with alternative approaches.Comment: 5 pages, 2 figures, presented by G.A.at DIS200

Concurrent enhancement of percolation and synchronization in adaptive networks

Co-evolutionary adaptive mechanisms are not only ubiquitous in nature, but also beneficial for the functioning of a variety of systems. We here consider an adaptive network of oscillators with a stochastic, fitness-based, rule of connectivity, and show that it self-organizes from fragmented and incoherent states to connected and synchronized ones. The synchronization and percolation are associated to abrupt transitions, and they are concurrently (and significantly) enhanced as compared to the non-adaptive case. Finally we provide evidence that only partial adaptation is sufficient to determine these enhancements. Our study, therefore, indicates that inclusion of simple adaptive mechanisms can efficiently describe some emergent features of networked systems' collective behaviors, and suggests also self-organized ways to control synchronization and percolation in natural and social systems.Comment: Published in Scientific Report

Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game

Let be given a graph $G=(V,E)$ whose edge set is partitioned into a set $R$ of \emph{red} edges and a set $B$ of \emph{blue} edges, and assume that red edges are weighted and form a spanning tree of $G$. Then, the \emph{Stackelberg Minimum Spanning Tree} (\stack) problem is that of pricing (i.e., weighting) the blue edges in such a way that the total weight of the blue edges selected in a minimum spanning tree of the resulting graph is maximized. \stack \ is known to be \apx-hard already when the number of distinct red weights is 2. In this paper we analyze some meaningful specializations and generalizations of \stack, which shed some more light on the computational complexity of the problem. More precisely, we first show that if $G$ is restricted to be \emph{complete}, then the following holds: (i) if there are only 2 distinct red weights, then the problem can be solved optimally (this contrasts with the corresponding \apx-hardness of the general problem); (ii) otherwise, the problem can be approximated within $7/4 + \epsilon$, for any $\epsilon > 0$. Afterwards, we define a natural extension of \stack, namely that in which blue edges have a non-negative \emph{activation cost} associated, and it is given a global \emph{activation budget} that must not be exceeded when pricing blue edges. Here, after showing that the very same approximation ratio as that of the original problem can be achieved, we prove that if the spanning tree of red edges can be rooted so as that any root-leaf path contains at most $h$ edges, then the problem admits a $(2h+\epsilon)$-approximation algorithm, for any $\epsilon > 0$.Comment: 22 pages, 7 figure

The Max-Distance Network Creation Game on General Host Graphs

In this paper we study a generalization of the classic \emph{network creation game} in the scenario in which the $n$ players sit on a given arbitrary \emph{host graph}, which constrains the set of edges a player can activate at a cost of $\alpha \geq 0$ each. This finds its motivations in the physical limitations one can have in constructing links in practice, and it has been studied in the past only when the routing cost component of a player is given by the sum of distances to all the other nodes. Here, we focus on another popular routing cost, namely that which takes into account for each player its \emph{maximum} distance to any other player. For this version of the game, we first analyze some of its computational and dynamic aspects, and then we address the problem of understanding the structure of associated pure Nash equilibria. In this respect, we show that the corresponding price of anarchy (PoA) is fairly bad, even for several basic classes of host graphs. More precisely, we first exhibit a lower bound of $\Omega (\sqrt{ n / (1+\alpha)})$ for any $\alpha = o(n)$. Notice that this implies a counter-intuitive lower bound of $\Omega(\sqrt{n})$ for very small values of $\alpha$ (i.e., edges can be activated almost for free). Then, we show that when the host graph is restricted to be either $k$-regular (for any constant $k \geq 3$), or a 2-dimensional grid, the PoA is still $\Omega(1+\min\{\alpha, \frac{n}{\alpha}\})$, which is proven to be tight for $\alpha=\Omega(\sqrt{n})$. On the positive side, if $\alpha \geq n$, we show the PoA is $O(1)$. Finally, in the case in which the host graph is very sparse (i.e., $|E(H)|=n-1+k$, with $k=O(1)$), we prove that the PoA is $O(1)$, for any $\alpha$.Comment: 17 pages, 4 figure