12,246 research outputs found
A motif-based approach to network epidemics
Networks have become an indispensable tool in modelling infectious diseases, with the structure of epidemiologically relevant contacts known to affect both the dynamics of the infection process and the efficacy of intervention strategies. One of the key reasons for this is the presence of clustering in contact networks, which is typically analysed in terms of prevalence of triangles in the network. We present a more general approach, based on the prevalence of different four-motifs, in the context of ODE approximations to network dynamics. This is shown to outperform existing models for a range of small world networks
Visual Dynamics: Probabilistic Future Frame Synthesis via Cross Convolutional Networks
We study the problem of synthesizing a number of likely future frames from a
single input image. In contrast to traditional methods, which have tackled this
problem in a deterministic or non-parametric way, we propose a novel approach
that models future frames in a probabilistic manner. Our probabilistic model
makes it possible for us to sample and synthesize many possible future frames
from a single input image. Future frame synthesis is challenging, as it
involves low- and high-level image and motion understanding. We propose a novel
network structure, namely a Cross Convolutional Network to aid in synthesizing
future frames; this network structure encodes image and motion information as
feature maps and convolutional kernels, respectively. In experiments, our model
performs well on synthetic data, such as 2D shapes and animated game sprites,
as well as on real-wold videos. We also show that our model can be applied to
tasks such as visual analogy-making, and present an analysis of the learned
network representations.Comment: The first two authors contributed equally to this wor
Visual Dynamics: Stochastic Future Generation via Layered Cross Convolutional Networks
We study the problem of synthesizing a number of likely future frames from a
single input image. In contrast to traditional methods that have tackled this
problem in a deterministic or non-parametric way, we propose to model future
frames in a probabilistic manner. Our probabilistic model makes it possible for
us to sample and synthesize many possible future frames from a single input
image. To synthesize realistic movement of objects, we propose a novel network
structure, namely a Cross Convolutional Network; this network encodes image and
motion information as feature maps and convolutional kernels, respectively. In
experiments, our model performs well on synthetic data, such as 2D shapes and
animated game sprites, and on real-world video frames. We present analyses of
the learned network representations, showing it is implicitly learning a
compact encoding of object appearance and motion. We also demonstrate a few of
its applications, including visual analogy-making and video extrapolation.Comment: Journal preprint of arXiv:1607.02586 (IEEE TPAMI, 2019). The first
two authors contributed equally to this work. Project page:
http://visualdynamics.csail.mit.ed
Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
In this paper, firstly, we study analytically the topological features of a
family of hierarchical lattices (HLs) from the view point of complex networks.
We derive some basic properties of HLs controlled by a parameter . Our
results show that scale-free networks are not always small-world, and support
the conjecture that self-similar scale-free networks are not assortative.
Secondly, we define a deterministic family of graphs called small-world
hierarchical lattices (SWHLs). Our construction preserves the structure of
hierarchical lattices, while the small-world phenomenon arises. Finally, the
dynamical processes of intentional attacks and collective synchronization are
studied and the comparisons between HLs and Barab{\'asi}-Albert (BA) networks
as well as SWHLs are shown. We show that degree distribution of scale-free
networks does not suffice to characterize their synchronizability, and that
networks with smaller average path length are not always easier to synchronize.Comment: 26 pages, 8 figure
Local-world evolving networks with tunable clustering
We propose an extended local-world evolving network model including a triad
formation step. In the process of network evolution, random fluctuation in the
number of new edges is involved. We derive analytical expressions for degree
distribution, clustering coefficient and average path length. Our model can
unify the generic properties of real-life networks: scale-free degree
distribution, high clustering and small inter-node separation. Moreover, in our
model, the clustering coefficient is tunable simply by changing the expected
number of triad formation steps after a single local preferential attachment
step.Comment: 18 pages, 6 figures. Accepted for publication in Physica
HetHetNets: Heterogeneous Traffic Distribution in Heterogeneous Wireless Cellular Networks
A recent approach in modeling and analysis of the supply and demand in
heterogeneous wireless cellular networks has been the use of two independent
Poisson point processes (PPPs) for the locations of base stations (BSs) and
user equipments (UEs). This popular approach has two major shortcomings. First,
although the PPP model may be a fitting one for the BS locations, it is less
adequate for the UE locations mainly due to the fact that the model is not
adjustable (tunable) to represent the severity of the heterogeneity
(non-uniformity) in the UE locations. Besides, the independence assumption
between the two PPPs does not capture the often-observed correlation between
the UE and BS locations.
This paper presents a novel heterogeneous spatial traffic modeling which
allows statistical adjustment. Simple and non-parameterized, yet sufficiently
accurate, measures for capturing the traffic characteristics in space are
introduced. Only two statistical parameters related to the UE distribution,
namely, the coefficient of variation (the normalized second-moment), of an
appropriately defined inter-UE distance measure, and correlation coefficient
(the normalized cross-moment) between UE and BS locations, are adjusted to
control the degree of heterogeneity and the bias towards the BS locations,
respectively. This model is used in heterogeneous wireless cellular networks
(HetNets) to demonstrate the impact of heterogeneous and BS-correlated traffic
on the network performance. This network is called HetHetNet since it has two
types of heterogeneity: heterogeneity in the infrastructure (supply), and
heterogeneity in the spatial traffic distribution (demand).Comment: JSA
Evolutionary games on graphs
Game theory is one of the key paradigms behind many scientific disciplines
from biology to behavioral sciences to economics. In its evolutionary form and
especially when the interacting agents are linked in a specific social network
the underlying solution concepts and methods are very similar to those applied
in non-equilibrium statistical physics. This review gives a tutorial-type
overview of the field for physicists. The first three sections introduce the
necessary background in classical and evolutionary game theory from the basic
definitions to the most important results. The fourth section surveys the
topological complications implied by non-mean-field-type social network
structures in general. The last three sections discuss in detail the dynamic
behavior of three prominent classes of models: the Prisoner's Dilemma, the
Rock-Scissors-Paper game, and Competing Associations. The major theme of the
review is in what sense and how the graph structure of interactions can modify
and enrich the picture of long term behavioral patterns emerging in
evolutionary games.Comment: Review, final version, 133 pages, 65 figure
- …