Daniele De Martino

Congestion phenomena on complex networks.

We define a minimal model of traffic flows in complex networks in order to study the trade-off between topological-based and traffic-based routing strategies. The resulting collective behavior is obtained analytically for an ensemble of uncorrelated networks and summarized in a rich phase diagram presenting second-order as well as first-order phase transitions between a free-flow phase and a congested phase. We find that traffic control improves global performance, enlarging the free-flow region in parameter space only in heterogeneous networks. Traffic control introduces nonlinear effects and, beyond a critical strength, may trigger the appearance of a congested phase in a discontinuous manner. The model also reproduces the crossover in the scaling of traffic fluctuations empirically observed on the Internet.

Uniform Sampling of Steady States in Metabolic Networks: Heterogeneous Scales and Rounding

The uniform sampling of convex polytopes is an interesting computational problem with many applications in inference from linear constraints, but the performances of sampling algorithms can be affected by ill-conditioning. This is the case of inferring the feasible steady states in models of metabolic networks, since they can show heterogeneous time scales. In this work we focus on rounding procedures based on building an ellipsoid that closely matches the sampling space, that can be used to define an efficient hit-and-run (HR) Markov Chain Monte Carlo. In this way the uniformity of the sampling of the convex space of interest is rigorously guaranteed, at odds with non markovian methods. We analyze and compare three rounding methods in order to sample the feasible steady states of metabolic networks of three models of growing size up to genomic scale. The first is based on principal component analysis (PCA), the second on linear programming (LP) and finally we employ the Lovazs ellipsoid method (LEM). Our results show that a rounding procedure dramatically improves the performances of the HR in these inference problems and suggest that a combination of LEM or LP with a subsequent PCA perform the best. We finally compare the distributions of the HR with that of two heuristics based on the Artificially Centered hit-and-run (ACHR), gpSampler and optGpSampler. They show a good agreement with the results of the HR for the small network, while on genome scale models present inconsistencies.

A Scalable Algorithm to Explore the Gibbs Energy Landscape of Genome-Scale Metabolic Networks

The integration of various types of genomic data into predictive models of biological networks is one of the main challenges currently faced by computational biology. Constraint-based models in particular play a key role in the attempt to obtain a quantitative understanding of cellular metabolism at genome scale. In essence, their goal is to frame the metabolic capabilities of an organism based on minimal assumptions that describe the steady states of the underlying reaction network via suitable stoichiometric constraints, specifically mass balance and energy balance (i.e. thermodynamic feasibility). The implementation of these requirements to generate viable configurations of reaction fluxes and/or to test given flux profiles for thermodynamic feasibility can however prove to be computationally intensive. We propose here a fast and scalable stoichiometry-based method to explore the Gibbs energy landscape of a biochemical network at steady state. The method is applied to the problem of reconstructing the Gibbs energy landscape underlying metabolic activity in the human red blood cell, and to that of identifying and removing thermodynamically infeasible reaction cycles in the Escherichia coli metabolic network (iAF1260). In the former case, we produce consistent predictions for chemical potentials (or log-concentrations) of intracellular metabolites; in the latter, we identify a restricted set of loops (23 in total) in the periplasmic and cytoplasmic core as the origin of thermodynamic infeasibility in a large sample () of flux configurations generated randomly and compatibly with the prior information available on reaction reversibility.

Counting and correcting thermodynamically infeasible flux cycles in genome-scale metabolic networks.

Thermodynamics constrains the flow of matter in a reaction network to occur through routes along which the Gibbs energy decreases, implying that viable steady-state flux patterns should be void of closed reaction cycles. Identifying and removing cycles in large reaction networks can unfortunately be a highly challenging task from a computational viewpoint. We propose here a method that accomplishes it by combining a relaxation algorithm and a Monte Carlo procedure to detect loops, with ad hoc rules (discussed in detail) to eliminate them. As test cases, we tackle (a) the problem of identifying infeasible cycles in the E. coli metabolic network and (b) the problem of correcting thermodynamic infeasibilities in the Flux-Balance-Analysis solutions for 15 human cell-type-specific metabolic networks. Results for (a) are compared with previous analyses of the same issue, while results for (b) are weighed against alternative methods to retrieve thermodynamically viable flux patterns based on minimizing specific global quantities. Our method, on the one hand, outperforms previous techniques and, on the other, corrects loopy solutions to Flux Balance Analysis. As a byproduct, it also turns out to be able to reveal possible inconsistencies in model reconstructions.

A minimal model for congestion phenomena on complex networks

We study a minimal model of traffic flows in complex networks, simple enough for getting analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase and a congested phase, critical points and different behaviors of scaling with the system size. It consists of random walkers on a queuing network with one-range repulsion, where particles can be destroyed only if they can move. We focus on the dependence on the topology as well as on the level of traffic control. We are able to obtain transition curves and phase diagrams at an analytical level for the ensemble of uncorrelated networks and numerically for single instances. We find that traffic control improves global performance, enlarging the free-flow region in parameter space only in heterogeneous networks. Traffic control introduces non-linear effects and, beyond a critical strength, may trigger the appearance of a congested phase in a discontinuous manner. The model also reproduces the crossover in the scaling of traffic fluctuations empirically observed in the Internet, and moreover, a conserved version can reproduce qualitatively some stylized facts of traffic in transportation networks.

Dynamic Facilitation Picture of a Higher-Order Glass Singularity

We show that facilitated spin mixtures with a tunable facilitation reproduce, on a Bethe lattice, the simplest higher-order singularity scenario predicted by the mode-coupling theory (MCT) of liquid-glass transition. Depending on the facilitation strength, they yield either a discontinuous glass transition or a continuous one, with no underlying thermodynamic singularity. Similar results are obtained for facilitated spin models on a diluted Bethe lattice. The mechanism of dynamical arrest in these systems can be interpreted in terms of bootstrap and standard percolation and corresponds to a crossover from a compact to a fractal structure of the incipient spanning cluster of frozen spins. Theoretical and numerical simulation results are fully consistent with MCT predictions.

Phase transitions in crowd dynamics of resource allocation.

We define and study a class of resource allocation processes where gN agents, by repeatedly visiting N resources, try to converge to an optimal configuration where each resource is occupied by at most one agent. The process exhibits a phase transition, as the density g of agents grows, from an absorbing to an active phase. In the latter, even if the number of resources is in principle enough for all agents (g<1), the system never settles to a frozen configuration. We recast these processes in terms of zero-range interacting particles, studying analytically the mean field dynamics and investigating numerically the phase transition in finite dimensions. We find a good agreement with the critical exponents of the stochastic fixed-energy sandpile. The lack of coordination in the active phase also leads to a nontrivial faster-is-slower effect.

Reaction Networks as Systems for Resource Allocation: A Variational Principle for Their Non-Equilibrium Steady States

Within a fully microscopic setting, we derive a variational principle for the non-equilibrium steady states of chemical reaction networks, valid for time-scales over which chemical potentials can be taken to be slowly varying: at stationarity the system minimizes a global function of the reaction fluxes with the form of a Hopfield Hamiltonian with Hebbian couplings, that is explicitly seen to correspond to the rate of decay of entropy production over time. Guided by this analogy, we show that reaction networks can be formally re-cast as systems of interacting reactions that optimize the use of the available compounds by competing for substrates, akin to agents competing for a limited resource in an optimal allocation problem. As an illustration, we analyze the scenario that emerges in two simple cases: that of toy (random) reaction networks and that of a metabolic network model of the human red blood cell.

Shear- and vibration-induced order-disorder transitions in granular media

Abstract.By molecular dynamics simulations we investigate the order-disorder transitions induced in granular media by an applied drive combining vibrations and shear. As the steady state is attained, the pack is found in disordered configurations for comparatively high intensities of the drive; conversely, ordering and packing fractions exceeding the random close packing are found when vibrations and shear are weak. As forcing amplitudes get smaller, we find diverging time scales in the dynamics, as the system enters a jamming region. Under this perspective, our picture supports the intuition that externally applied forcing has, in driven granular media, a role similar to temperature in thermal systems.

Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes

In this work maximum entropy distributions in the space of steady states of metabolic networks are considered upon constraining the first and second moments of the growth rate. Coexistence of fast and slow phenotypes, with bimodal flux distributions, emerges upon considering control on the average growth (optimization) and its fluctuations (heterogeneity). This is applied to the carbon catabolic core of Escherichia coli where it quantifies the metabolic activity of slow growing phenotypes and it provides a quantitative map with metabolic fluxes, opening the possibility to detect coexistence from flux data. A preliminary analysis on data for E. coli cultures in standard conditions shows degeneracy for the inferred parameters that extend in the coexistence region.In this work maximum entropy distributions in the space of steady states of metabolic networks are defined upon constraining the first and second moment of the growth rate. Inherent bistability of fast and slow phenotypes, akin to a Van-Der Waals picture, emerges upon considering control on the average growth (optimization/repression) and its fluctuations (heterogeneity). This is applied to the carbon catabolic core of E.coli where it agrees with some stylized facts on the persisters phenotype and it provides a quantitative map with metabolic fluxes, opening for the possibility to detect coexistence from flux data. Preliminary analysis on data for E.Coli cultures in standard conditions shows, on the other hand, degeneracy for the inferred parameters that extend in the coexistence region.