Dynamics on spatial networks and the effect of distance coarse graining

We conclude that the coarse grained multicomputer model (CGM) is well suited to design competitive algorithms, and that it is thereby now possible to aim to develop

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

In this paper, the different steps of the model will be presented and a few key points like the importance of the factor segmentation and the op- timization of cluster

The density profiles agree with previous work in the self-similar infall phase, but we have reduced the noise in the simulation by the device of including a central point mass

Finally, a classic ParCeL6 application code includes three main parts: the sequen- tial master routine controlling the cell net installation and running cellular computation steps,

We then compute the corresponding memory function from molecular simulations, in the case of cesium ions confined in the interlayer porosity of montmorillonite clays, with a very

When dealing with small clusters of atoms or with the 76-residue-long protein Ubiquitin, the approach based on the homogeneous deformation hypothesis results robust only when

Given a tree S, we write ∂S for the set of its free output sites; given a sequence of N complete trees, T , including possibly empty ones, and a tree S with | ∂S | = N, we write S ◦