• Corpus ID: 12901792

Uncovering the Temporal Dynamics of Diffusion Networks

@article{GomezRodriguez2011UncoveringTT,
  title={Uncovering the Temporal Dynamics of Diffusion Networks},
  author={Manuel Gomez-Rodriguez and David Balduzzi and Bernhard Sch{\"o}lkopf},
  journal={ArXiv},
  year={2011},
  volume={abs/1105.0697}
}
Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision or becomes infected – but the connectivity, transmission rates between nodes and transmission sources are unknown. Inferring the underlying dynamics is of outstanding interest since it enables forecasting, influencing and retarding infections, broadly construed. To this end, we model diffusion processes as discrete… 

Figures and Tables from this paper

Inferring Networks of Diffusion and Influence

This work develops an efficient approximation algorithm that scales to large datasets and finds provably near-optimal networks for tracing paths of diffusion and influence through networks and inferring the networks over which contagions propagate.

Structure and dynamics of information pathways in online media

An on-line algorithm that relies on stochastic convex optimization to efficiently solve the dynamic network inference problem and studies the evolution of information pathways in the online media space.

Information diffusion network inferring and pathway tracking

A novel probabilistic model called Network Inferring from Multidimensional Features of Cascades (NIMFC) is proposed which takes into account heterogeneous features, including temporal and topological features of cascades, node attributes, and information content, to infer the latent network structure and transmission rates of edges.

Influence Maximization in Continuous Time Diffusion Networks

It is shown that selecting the set of most influential source nodes in the continuous time influence maximization problem is NP-hard and an efficient approximation algorithm with provable near-optimal performance is developed.

Cluster cascades: Infer multiple underlying networks using diffusion data

  • Ming YangC. ChouMing-Syan Chen
  • Computer Science
    2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)
  • 2014
A problem of K-network inference, inferring K underlying diffusion networks, based on a proposed probabilistic generative mixture model that models the generation of cascades is formulated and an algorithm that could cluster similar cascades and infer the corresponding underlying network for each cluster in the Expectation-Maximization framework is proposed.

STAND: a spatio-temporal algorithm for network diffusion simulation

A probabilistic spatiotemporal algorithm for network diffusion simulation (STAND) is developed based on the survival model in this research to provide a more detailed measure of how different contagions are transmitted through various networks where nodes denote geographic locations at a large scale.

Pareto cascade modeling of diffusion networks

This paper infer the transmission rates among nodes by Pareto distributions with explicit solutions for the optimization problem that maximizes time-dependent pairwise transmission likelihoods between all pairs of nodes.

Uncover Topic-Sensitive Information Diffusion Networks

This paper proposes a continuous time model, TOPICCASCADE, for topicsensitive information diffusion networks, and infer the hidden diffusion networks and the topic dependent transmission rates from the observed time stamps and contents of cascades.

Online Bayesian Inference of Diffusion Networks

This work formulates a model to describe the contagion, and selects appropriate prior distributions, and exploits Monte Carlo Markov Chain, sequential Monte Carlo, and time series analysis techniques to develop batch and online inference algorithms.

Statistical Inference of Diffusion Networks

A probabilistic generative model of the final infection statuses is designed to quantitatively measure the likelihood of potential structures of the objective diffusion network, taking into account network complexity.
...

References

SHOWING 1-10 OF 21 REFERENCES

Inferring Networks of Diffusion and Influence

This work develops an efficient approximation algorithm that scales to large datasets and finds provably near-optimal networks for tracing paths of diffusion and influence through networks and inferring the networks over which contagions propagate.

On the Convexity of Latent Social Network Inference

This work considers contagions propagating over the edges of an unobserved social network, and presents a maximum likelihood approach based on convex programming with a l1-like penalty term that encourages sparsity to identify the optimal network that best explains the observed data.

Maximizing the spread of influence through a social network

An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.

Statistical properties of community structure in large social and information networks

It is found that a generative model, in which new edges are added via an iterative "forest fire" burning process, is able to produce graphs exhibiting a network community structure similar to that observed in nearly every network dataset examined.

Finding effectors in social networks

It is shown that for arbitrary graphs the problem of selecting a set of k active nodes that best explain the observed activation state, under a given information-propagation model, is not only NP-hard to solve optimally, but also NP- hard to approximate.

Kronecker Graphs: An Approach to Modeling Networks

Kronecker graphs naturally obey common network properties and it is rigorously proved that they do so, and KRONFIT, a fast and scalable algorithm for fitting the Kronecker graph generation model to large real networks, is presented.

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Influentials, Networks, and Public Opinion Formation

A central idea in marketing and diffusion research is that influentials—a minority of individuals who influence an exceptional number of their peers—are important to the formation of public opinion.

Different Epidemic Curves for Severe Acute Respiratory Syndrome Reveal Similar Impacts of Control Measures

A likelihood-based estimation procedure that infers the temporal pattern of effective reproduction numbers from an observed epidemic curve for SARS revealed that epidemics in the various affected regions were characterized by markedly similar disease transmission potentials and similar levels of effectiveness of control measures.

Tracking information epidemics in blogspace

  • Eytan AdarLada A. Adamic
  • Computer Science
    The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)
  • 2005
This paper describes a novel inference scheme that takes advantage of data describing historical, repeating patterns of "infection" to track information flow in blogspace, as well as a visualization system that allows for the graphical tracking of information flow.