|
|  |
|
 |
Research Highlights
|
|
Epidemic Networks |
|
Nature 429, 180 (2004).
pdf
|
|
Most mathematical models for the spread of disease use differential equations based on uniform
mixing assumptions or ad hoc models for the contact process. Here we explore the use of
dynamic bipartite graphs to model the physical contact patterns
that result from movements of individuals between specific
locations. The graphs are generated by large-scale individual-based urban traffic simulations built
on actual census, land-use and population-mobility data. We find that the contact network
among people is a strongly connected small-world-like graph
with a well-defined scale for the degree distribution. However,
the locations graph is scale-free, which allows highly efficient
outbreak detection by placing sensors in the hubs of the locations
network. Within this large-scale simulation framework, we then
analyse the relative merits of several proposed mitigation strategies for smallpox spread. Our
results suggest that outbreaks can be contained by a strategy of targeted vaccination combined with
early detection without resorting to mass vaccination of a
population.
|
|
|
Gradient Networks |
|
Nature 428, 716 (2004).
pdf
|
|
We define gradient networks as directed graphs formed by local gradients of a
scalar field distributed on the nodes of a substrate network G. We derive an
exact expression for the in-degree distribution of the gradient network when
the substrate is a binomial (Erdős-Rényi) random graph, G(N,p).
Using this
expression we show that the in-degree distribution R(l) of gradient graphs on
G(N,p) obeys the power law R(l)~1/l for arbitrary,
i.i.d. random scalar fields.
We then relate gradient graphs to congestion tendency in network flows and show
that while random graphs become maximally congested in the large network size
limit, scale-free networks are not, forming fairly efficient substrates for
transport. Combining this with other constraints, such as uniform edge cost,
we obtain a plausible argument in form of a selection principle, for why a number
of spontaneously evolved massive networks are scale-free.
|
|
|
Parallel Computing |
|
Science 299, 677 (2003).
pdf
|
|
In a parallel discrete-event simulation (PDES) scheme, tasks are distributed among processing
elements (PEs), whose progress is controlled by a synchronization scheme. For lattice systems with
short-range interactions, the progress of the conservative PDES scheme is governed by the
Kardar-Parisi-Zhang equation from the theory of non-equilibrium surface growth. Although the
simulated (virtual) times of the PEs progress at a nonzero rate, their standard deviation (spread)
diverges with the number of PEs, hindering efficient data collection. We show that weak random
interactions among the PEs can make this spread nondivergent. The PEs then progress at a nonzero,
near-uniform rate without requiring global synchronizations.
|
|
We investigate the effects of finite size and inertia of a small spherical particle immersed in an
open unsteady flow which, for ideal tracers, generates transiently chaotic trajectories. The inertia
effects may strongly modify the chaotic motion to the point that attractors may appear in the
configuration space. These studies are performed in a model of the two-dimensional flow past a
cylindrical obstacle. The relevance to modeling efforts of biological pathogen transport in
large-scale flows is discussed. Since the tracer dynamics is sensitive to the particle inertia and
size, simple geometric setups in such flows could be used as a particle mixture segregator separating
and trapping particles.
|
|
|
Chaotic Flow: The Physics of Species Coexistence |
|
Proc. Natl. Acad. Sci. USA
97, 13661 (2000).
pdf
|
|
Hydrodynamical phenomena play a keystone role in the population dynamics of passively advected
species such as phytoplankton and replicating macromolecules. Recent developments in the field of
chaotic advection in hydrodynamical flows encourage us to revisit the population dynamics of species
competing for the same resource in an open aquatic system. If this aquatic environment is homogeneous
and well-mixed then classical studies predict competitive exclusion of all but the most perfectly
adapted species. In fact, this homogeneity is very rare, and the species of the community (at least
on an ecological observation time scale) are in nonequilibrium coexistence. We argue that a peculiar
small-scale, spatial heterogeneity generated by chaotic advection can lead to coexistence. In open
flows this imperfect mixing lets the populations accumulate along fractal filaments, where competition
is governed by an "advantage of rarity" principle. The possibility of this generic coexistence sheds
light on the enrichment of phytoplankton and the information integration in early macromolecule evolution.
|
|
|
Nanoscale Fluctuations at Solid Surfaces |
|
Physics Today
52, 24 (1999).
|
|