PubMed Health⌕ Search

Biomedical subjects

M Argollo de Menezes

Publications and source records attributed to M Argollo de Menezes.

4 recordsLinked to original sources

Separating internal and external dynamics of complex systems.

The observable behavior of a complex system reflects the mechanisms governing the internal interactions between the system's components and the effect of external perturbations. Here we show that by capturing the simultaneous activity of several of the system's components we can separate the internal dynamics from the external fluctuations. The method allows us to systematically determine the origin of fluctuations in various real systems, finding that while the Internet and the computer chip have robust internal dynamics, highway and Web traffic are driven by external demand. As multichannel measurements are becoming the norm in most fields, the method could help uncover the collective dynamics of a wide array of complex systems.

Computer Simulation↗

Fluctuations in network dynamics.

Most complex networks serve as conduits for various dynamical processes, ranging from mass transfer by chemical reactions in the cell to packet transfer on the Internet. We collected data on the time dependent activity of five natural and technological networks, finding that for each the coupling of the flux fluctuations with the total flux on individual nodes obeys a unique scaling law. We show that the observed scaling can explain the competition between the system's internal collective dynamics and changes in the external environment, allowing us to predict the relevant scaling exponents.

Internet↗

Shortest paths on systems with power-law distributed long-range connections.

We discuss shortest-path lengths l(r) on periodic rings of size L supplemented with an average of pL randomly located long-range links whose lengths are distributed according to P(l) approximately l(-mu). Using rescaling arguments and numerical simulation on systems of up to 10(7) sites, we show that a characteristic length xi exists such that l(r) approximately r for r >xi. For small p we find that the shortest-path length satisfies the scaling relation l(r,mu,p)/xi=f(mu,r/xi). Three regions with different asymptotic behaviors are found, respectively: (a) mu>2 where theta(s)=1, (b) 1<mu<2 where 0<theta(s)(mu)<1/2, and (c) mu<1 where l(r) behaves logarithmically, i.e., theta(s)=0. The characteristic length xi is of the form xi approximately p(-nu) with nu=1/(2-mu) in region (b), but depends on L as well in region (c). A directed model of shortest paths is solved and compared with numerical results.

Journal Article↗

Entropy-based analysis of the number partitioning problem.

In this paper we apply the multicanonical method of statistical physics on the number partitioning problem (NPP). This problem is a basic NP-hard problem from computer science, and can be formulated as a spin-glass problem. We compute the spectral degeneracy, which gives us information about the number of solutions for a given cost E and cardinality difference m. We also study an extension of this problem for Q partitions. We show that a fundamental difference on the spectral degeneracy of the generalized (Q>2) NPP exists, which could explain why it is so difficult to find good solutions for this case.

Journal Article↗