• Corpus ID: 203593985

Changing the tune: mixtures of network models that vary in time

  title={Changing the tune: mixtures of network models that vary in time},
  author={Naomi A. Arnold and Ra{\'u}l J. Mondrag{\'o}n and Richard G. Clegg},
Many of the complex systems we study in their representation as networks are growing objects, evolving by the addition of nodes and links over time. The rules governing this growth are attributed to mechanisms such as preferential attachment and triangle closure. We demonstrate a method for estimating the relative roles of these mechanisms, and further, investigating how they change as the network evolves. We show that a rich class of network evolution models can be built from a weighted… 
1 Citations

Figures and Tables from this paper

Identifying time dependence in network growth

The k2 model, an adaptation of the Barab{\'a}si-Albert model, is introduced, which results in time dependent degree distributions and attachment kernels, despite initially appearing to grow as linear preferential attachment, and without the need to include explicit time dependence in key network parameters (such as the average out-degree).



Choosing to Grow a Graph: Modeling Network Formation as Discrete Choice

We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a

Multiscale mixing patterns in networks

This work designs a method to characterize the heterogeneity and local variations of assortativity within a network and exhibit, in a variety of empirical data, rich mixing patterns that would be obscured by summarizingAssortativity with a single statistic.

Detecting Change Points in the Large-Scale Structure of Evolving Networks

This paper formalizes for the first time the network change-point detection problem within an online probabilistic learning framework and introduces a method that can reliably solve it and analyzes the detectability of this method using synthetic data with known change points of different types and magnitudes.

Motifs in Temporal Networks

A notion of a temporal network motif as an elementary unit of temporal networks is developed and a general methodology for counting such motifs is provided and it is found that measuring motif counts at various time scales reveals different behavior.

Scale-free networks are rare

A severe test of their empirical prevalence using state-of-the-art statistical tools applied to nearly 1000 social, biological, technological, transportation, and information networks finds robust evidence that strongly scale-free structure is empirically rare, while for most networks, log-normal distributions fit the data as well or better than power laws.

Uncovering the role of elementary processes in network evolution

This work formulated and solved a model that incorporates the minimal processes governing network evolution, distinguishing between node and edge addition, vertex fitness and the deletion of nodes and edges.

Meeting Strangers and Friends of Friends: How Random are Social Networks?

It is shown that as the random/network-based meeting ratio varies, the resulting degree distributions can be ordered in the sense of stochastic dominance, which allows us to infer how the formation process affects average utility in the network.

Likelihood-based assessment of dynamic networks

The solution developed in this paper gives a rigorous way to calculate the likelihood of the observed graph evolution having arisen from a wide variety of hypothesized models encompassing many already present in the literature.

Topology of evolving networks: local events and universality

A continuum theory is proposed that predicts the connectivity distribution of the network describing the professional links between movie actors as well as the scaling function and the exponents, in good agreement with numerical results.

Competition and multiscaling in evolving networks

This work finds that competition for links translates into multiscaling, i.e. a fitness- dependent dynamic exponent, allowing fitter nodes to overcome the more connected but less fit ones.