Scalable diffusion-aware optimization of network topology

By Elias Boutros Khalil, Bistra N. Dilkina, Le Song. 2014

153 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics, Optimization & Training, Network Science & Complex Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Stephan Günnemann
2. Aleksandar Bojchevski
3. Hanjun Dai
4. Yuyu Zhang
5. Bistra N. Dilkina
6. Le Song
7. Elias Boutros Khalil
8. Andreas Loukas

In Statistical and Nonlinear Physics

1. Stephan Günnemann
2. Aleksandar Bojchevski
3. Hanjun Dai
4. Elias Boutros Khalil
5. Bistra N. Dilkina
6. Yuyu Zhang
7. Le Song
8. Daniel Zügner

In Optimization & Training

1. Stephan Günnemann
2. Aleksandar Bojchevski
3. Le Song
4. Bistra N. Dilkina
5. Yuyu Zhang
6. Hanjun Dai
7. Elias Boutros Khalil

In Network Science & Complex Systems

1. Aleksandar Bojchevski
2. Stephan Günnemann
3. Bistra N. Dilkina
4. Elias Boutros Khalil
5. Hanjun Dai
6. Yuyu Zhang
7. Le Song

Citations in the corpus

• Learning Combinatorial Optimization Algorithms over Graphs (2017, methodology): “As done in [21], we use these average transmission times to compute a diffusion probability P ( u, v ) on the edge, such , where α is a parameter of the diffusion model.”
• Adversarial Attacks on Node Embeddings via Graph Poisoning (2018, methodology): “There is an extensive literature on optimizing the graph structure to manipulate: information spread in a network (Khalil et al., 2014; Chen et al., 2016), user opinions (Chaoji et al.”