-
Notifications
You must be signed in to change notification settings - Fork 0
/
journal_club.html
226 lines (220 loc) · 15.2 KB
/
journal_club.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<meta name="generator" content="pandoc">
<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes">
<title>NetSI Journal Club</title>
<style type="text/css">code{white-space: pre;}</style>
<link rel="stylesheet" href="css/tufte.css">
<link rel="stylesheet" href="css/latex.css">
<link rel="stylesheet" href="css/pandoc.css">
<link rel="stylesheet" href="css/pandoc-solarized.css">
<link rel="stylesheet" href="css/tufte-extra.css">
<!--[if lt IE 9]>
<script src="//cdnjs.cloudflare.com/ajax/libs/html5shiv/3.7.3/html5shiv-printshiv.min.js"></script>
<![endif]-->
</head>
<body>
<article>
<header>
<h1 class="title">NetSI Journal Club</h1>
<h2 class="author">Network Science Institute</h2>
<p class="affilation"><em></em></p>
</header>
<section id="fall-2020" class="level1">
<h1>Fall 2020</h1>
<p>Organizer: <a href="http://sdmccabe.github.io">Stefan McCabe</a></p>
<p>Time: Every other Friday, 2:00–3:00</p>
<p>Candidate Papers: <a href="https://docs.google.com/spreadsheets/d/1FLcFZIe3hWUjqh16UaG0FNilcZV4n7X1YjUBCoBzsJU/edit?usp=sharing">Link</a></p>
<section id="october-23-a-detour-into-the-social-sciences" class="level2">
<h2>October 23: A detour into the social sciences</h2>
<ul>
<li>Zhao, Kino. Forthcoming. “Sample Representation in the Social Sciences.” <em>Synthese</em>. <a href="https://doi.org/10.1007/s11229-020-02621-3" class="uri">https://doi.org/10.1007/s11229-020-02621-3</a>.</li>
</ul>
</section>
<section id="october-9-hierarchical-community-structure" class="level2">
<h2>October 9: Hierarchical community structure</h2>
<ul>
<li>Schaub, Michael T., and Leto Peel. 2020. “Hierarchical Community Structure in Networks.” arXiv:2009.07196 [cs.SI]. <a href="http://arxiv.org/abs/2009.07196" class="uri">http://arxiv.org/abs/2009.07196</a>.</li>
<li>Peel, Leto, and Michael T. Schaub. 2020. “Detectability of Hierarchical Communities in Networks.” arXiv:2009.07525 [cs.SI]. <a href="http://arxiv.org/abs/2009.07525" class="uri">http://arxiv.org/abs/2009.07525</a>.</li>
</ul>
</section>
<section id="september-25-the-scale-free-networks-debate-re-reconsidered" class="level2">
<h2>September 25: The scale-free networks debate, re-reconsidered</h2>
<ul>
<li>Jacomy, Mathieu. 2020. “Epistemic Clashes in Network Science: Mapping the Tensions between Idiographic and Nomothetic Subcultures.” <em>Big Data & Society</em> 7 (2). <a href="https://doi.org/10.1177/2053951720949577" class="uri">https://doi.org/10.1177/2053951720949577</a>.</li>
</ul>
</section>
</section>
<section id="fall-2019" class="level1">
<h1>Fall 2019</h1>
<p>Organizer: <a href="http://sdmccabe.github.io">Stefan McCabe</a></p>
<p>Time: Every other Thursday, 2:00–3:00</p>
<section id="november-14-network-topology" class="level2">
<h2>November 14: Network topology</h2>
<ul>
<li>Aktas, Mehmet E., Esra Akbas, and Ahmed El Fatmaoui. 2019. “Persistence Homology of Networks: Methods and Applications.” <em>Applied Network Science</em> 4 (1): 61. <a href="https://doi.org/10.1007/s41109-019-0179-3" class="uri">https://doi.org/10.1007/s41109-019-0179-3</a>.</li>
</ul>
</section>
<section id="october-31-transsortativity-in-networks" class="level2">
<h2>October 31: Transsortativity in networks</h2>
<ul>
<li>Wu, Xin-Zeng, Allon G. Percus, Keith Burghardt, and Kristina Lerman. 2019. “The Transsortative Structure of Networks.” arXiv:1910.09538 [physics.soc-ph]. <a href="http://arxiv.org/abs/1910.09538" class="uri">http://arxiv.org/abs/1910.09538</a>.</li>
<li>Altenburger, Kristen M., and Johan Ugander. 2018. “Monophily in Social Networks Introduces Similarity Among Friends-of-Friends.” <em>Nature Human Behaviour</em> 2 (4): 284–90. <a href="https://doi.org/10.1038/s41562-018-0321-8" class="uri">https://doi.org/10.1038/s41562-018-0321-8</a>. (optional)</li>
</ul>
</section>
<section id="october-17-machine-learning-and-network-science" class="level2">
<h2>October 17: Machine learning and network science</h2>
<ul>
<li>Rodrigues, Francisco A., Thomas Peron, Colm Connaughton, Jurgen Kurths, and Yamir Moreno. 2019. “A Machine Learning Approach to Predicting Dynamical Observables from Network Structure.” arXiv:1910.00544 [physics.soc-ph]. <a href="http://arxiv.org/abs/1910.00544" class="uri">http://arxiv.org/abs/1910.00544</a>.</li>
</ul>
</section>
<section id="october-3-non-normal-networks" class="level2">
<h2>October 3: Non-normal networks</h2>
<ul>
<li>Asllani, Malbor, Renaud Lambiotte, and Timoteo Carletti. 2018. “Structure and Dynamical Behavior of Non-Normal Networks.” <em>Science Advances</em> 4 (12): eaau9403. <a href="https://doi.org/10.1126/sciadv.aau9403" class="uri">https://doi.org/10.1126/sciadv.aau9403</a>.</li>
</ul>
</section>
<section id="september-19-message-passing" class="level2">
<h2>September 19: Message passing</h2>
<ul>
<li>Cantwell, George T., and M. E. J. Newman. 2019. “Message Passing on Networks with Loops.” arXiv:1907.08252 [cs.SI]. <a href="http://arxiv.org/abs/1907.08252" class="uri">http://arxiv.org/abs/1907.08252</a>.</li>
</ul>
</section>
</section>
<section id="summer-2019" class="level1">
<h1>Summer 2019</h1>
<p>Organizer: <a href="http://sdmccabe.github.io">Stefan McCabe</a></p>
<p>Time: Every other Friday, 3:00–4:00</p>
<section id="may-17-statistics-of-complex-systems" class="level2">
<h2>May 17: Statistics of complex systems</h2>
<ul>
<li>Gerlach, Martin, and Eduardo G. Altmann. 2019. “Testing Statistical Laws in Complex Systems.” <em>Physical Review Letters</em> 122 (16): 168301. <a href="https://doi.org/10.1103/PhysRevLett.122.168301" class="uri">https://doi.org/10.1103/PhysRevLett.122.168301</a>.</li>
</ul>
</section>
<section id="may-3-temporal-validity" class="level2">
<h2>May 3: Temporal validity</h2>
<ul>
<li>Munger, Kevin. 2019. “Knowledge Decays: Temporal Validity in Online Social Science.” Working Paper. <a href="https://osf.io/bka9z/" class="uri">https://osf.io/bka9z/</a>.</li>
</ul>
</section>
</section>
<section id="spring-2019" class="level1">
<h1>Spring 2019</h1>
<p>Organizer: <a href="http://sdmccabe.github.io">Stefan McCabe</a></p>
<p>Time: Every other Friday, 3:00–4:00.</p>
<section id="april-19-information-spreading" class="level2">
<h2>April 19: Information spreading</h2>
<ul>
<li>Canright, Geoffrey S., and Kenth Engø-Monsen. 2005. “Epidemic Spreading Over Networks – A View from Neighbourhoods.” <em>Telektronikk</em> 101 (1): 65–85.</li>
<li>Martin, Travis, Xiao Zhang, and M. E. J. Newman. 2014. “Localization and Centrality in Networks.” <em>Physical Review E</em> 90 (5): 052808. <a href="https://doi.org/10.1103/PhysRevE.90.052808" class="uri">https://doi.org/10.1103/PhysRevE.90.052808</a>.</li>
<li>Kitsak, Maksim, Lazaros K. Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H. Eugene Stanley, and Hernán A. Makse. 2010. “Identification of Influential Spreaders in Complex Networks.” <em>Nature Physics</em> 6 (11): 888–93. <a href="https://doi.org/10.1038/nphys1746" class="uri">https://doi.org/10.1038/nphys1746</a>.</li>
</ul>
</section>
<section id="april-5-the-path-not-taken-in-community-detection" class="level2">
<h2>April 5: The path not taken in community detection?</h2>
<ul>
<li>Canright, Geoffrey S., and Kenth Engø-Monsen. 2005. “Epidemic Spreading Over Networks – A View from Neighbourhoods.” <em>Telektronikk</em> 101 (1): 65–85.</li>
<li>Fortunato, Santo. 2010. “Community Detection in Graphs.” <em>Physics Reports</em> 486 (3–5): 75–174. <a href="https://doi.org/10.1016/j.physrep.2009.11.002" class="uri">https://doi.org/10.1016/j.physrep.2009.11.002</a>.</li>
</ul>
</section>
<section id="march-15-threshold-models-of-network-contagion" class="level2">
<h2>March 15: Threshold models of network contagion</h2>
<ul>
<li>Eckles, Dean, Elchanan Mossel, M. Amin Rahimian, and Subhabrata Sen. 2018. “Long Ties Accelerate Noisy Threshold-Based Contagions.” arXiv:1810.03579v2 [cs.SI]. <a href="http://arxiv.org/abs/1810.03579v2" class="uri">http://arxiv.org/abs/1810.03579v2</a>.</li>
<li>Juul, Jonas S., and Mason A. Porter. 2019. “Hipsters on Networks: How a Minority Group of Individuals Can Lead to an Antiestablishment Majority.” <em>Physical Review E</em> 99 (2). <a href="https://doi.org/10.1103/PhysRevE.99.022313" class="uri">https://doi.org/10.1103/PhysRevE.99.022313</a>.</li>
</ul>
</section>
<section id="march-1-growing-networks" class="level2">
<h2>March 1: Growing networks</h2>
<p>(with <a href="https://www.cs.cornell.edu/~arb/">Austin Benson</a>)</p>
<p>Note: this session will meet 3:30–4:30 to accommodate <a href="https://www.networkscienceinstitute.org/events/thomas-w-malone">Thomas Malone’s talk at NetSI</a>.</p>
<ul>
<li>Overgoor, Jan, Austin R. Benson, and Johan Ugander. 2018. “Choosing to Grow a Graph: Modeling Network Formation as Discrete Choice.” arXiv:1811.05008 [cs.SI]. <a href="http://arxiv.org/abs/1811.05008" class="uri">http://arxiv.org/abs/1811.05008</a>.</li>
</ul>
</section>
<section id="february-15-information-theoretic-network-comparison" class="level2">
<h2>February 15: Information-theoretic network comparison</h2>
<ul>
<li>De Domenico, Manlio, and Jacob Biamonte. 2016. “Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison.” <em>Physical Review X</em> 6 (4). <a href="https://doi.org/10.1103/PhysRevX.6.041062" class="uri">https://doi.org/10.1103/PhysRevX.6.041062</a>.</li>
<li>Masuda, Naoki, and Petter Holme. 2019. “Detecting Sequences of System States in Temporal Networks.” <em>Scientific Reports</em> 9 (1). <a href="https://doi.org/10.1038/s41598-018-37534-2" class="uri">https://doi.org/10.1038/s41598-018-37534-2</a>.</li>
</ul>
</section>
</section>
<section id="fall-2018" class="level1">
<h1>Fall 2018</h1>
<p>Organizer: <a href="https://ryanjgallagher.github.io">Ryan J. Gallagher</a></p>
<section id="november-16-the-scale-free-networks-debate-reconsidered" class="level2">
<h2>November 16: The scale-free networks debate, reconsidered</h2>
<p>(with <a href="https://www.mobs-lab.org/jclub18.html">NETS 8941</a>)</p>
<ul>
<li>Voitalov, Ivan, Pim van der Hoorn, Remco van der Hofstad, and Dmitri Krioukov. 2018. “Scale-Free Networks Well Done.” arXiv:1811.02071 [physics.soc-ph]. <a href="http://arxiv.org/abs/1811.02071" class="uri">http://arxiv.org/abs/1811.02071</a>.</li>
</ul>
</section>
<section id="october-25-the-moving-target-of-computational-social-science" class="level2">
<h2>October 25: The moving target of computational social science</h2>
<ul>
<li>Chaney, Allison J. B., Brandon M. Stewart, and Barbara E. Engelhardt. 2018. “How Algorithmic Confounding in Recommendation Systems Increases Homogeneity and Decreases Utility.” In <em>Proceedings of the 12th ACM Conference on Recommender Systems</em>, 224–32. New York: ACM Press. <a href="https://doi.org/10.1145/3240323.3240370" class="uri">https://doi.org/10.1145/3240323.3240370</a>.</li>
<li>Healy, Kieran. 2015. “The Performativity of Networks.” <em>European Journal of Sociology</em> 56 (2): 175–205. <a href="https://doi.org/10.1017/S0003975615000107" class="uri">https://doi.org/10.1017/S0003975615000107</a>.</li>
</ul>
</section>
<section id="october-24-do-we-need-to-infer-network-structure" class="level2">
<h2>October 24: Do we need to infer network structure?</h2>
<p>(Part 2, with <a href="https://scarpino.github.io/">Emergent Epidemics Lab</a>)</p>
<ul>
<li>Young, Jean-Gabriel, Guillaume St-Onge, Patrick Desrosiers, and Louis J. Dubé. 2018. “Universality of the Stochastic Block Model.” <em>Physical Review E</em> 98 (3). <a href="https://doi.org/10.1103/PhysRevE.98.032309" class="uri">https://doi.org/10.1103/PhysRevE.98.032309</a>.</li>
</ul>
</section>
<section id="october-17-do-we-need-to-infer-network-structure" class="level2">
<h2>October 17: Do we need to infer network structure?</h2>
<p>(Part 1, with <a href="https://scarpino.github.io/">Emergent Epidemics Lab</a>)</p>
<ul>
<li>Hoffmann, Till, Leto Peel, Renaud Lambiotte, and Nick S. Jones. 2018. “Community Detection in Networks with Unobserved Edges.” arXiv:1808.06079 [physics.soc-ph]. <a href="http://arxiv.org/abs/1808.06079" class="uri">http://arxiv.org/abs/1808.06079</a>.</li>
</ul>
</section>
<section id="october-11-noisy-networks" class="level2">
<h2>October 11: Noisy networks</h2>
<ul>
<li>Newman, Mark E. J. 2018. “Network Structure from Rich but Noisy Data.” <em>Nature Physics</em> 14 (6): 542–45. <a href="https://doi.org/10.1038/s41567-018-0076-1" class="uri">https://doi.org/10.1038/s41567-018-0076-1</a>.</li>
<li>Young, Jean-Gabriel, Laurent Hébert-Dufresne, Edward Laurence, Charles Murphy, Guillaume St-Onge, and Patrick Desrosiers. 2018. “Network Archaeology: Phase Transition in the Recoverability of Network History.” arXiv:1803.09191 [physics.soc-ph]. <a href="http://arxiv.org/abs/1803.09191" class="uri">http://arxiv.org/abs/1803.09191</a>.</li>
</ul>
</section>
</section>
<section id="summer-2018" class="level1">
<h1>Summer 2018</h1>
<p>Organizer: <a href="https://ryanjgallagher.github.io">Ryan J. Gallagher</a></p>
<section id="may-25-multiscale-structure-of-complex-networks" class="level2">
<h2>May 25: Multiscale structure of complex networks</h2>
<ul>
<li>Bagrow, James P., and Erik M. Bollt. 2018. “An Information-Theoretic, All-Scales Approach to Comparing Networks.” arXiv:1804.03665 [cs.SI]. <a href="http://arxiv.org/abs/1804.03665" class="uri">http://arxiv.org/abs/1804.03665</a>.</li>
<li>Hébert-Dufresne, Laurent, Joshua A. Grochow, and Antoine Allard. 2016. “Multi-Scale Structure and Topological Anomaly Detection via a New Network Statistic: The Onion Decomposition.” <em>Scientific Reports</em> 6 (1). <a href="https://doi.org/10.1038/srep31708" class="uri">https://doi.org/10.1038/srep31708</a>.</li>
</ul>
</section>
<section id="may-4-homophily-and-assortativity" class="level2">
<h2>May 4: Homophily and assortativity</h2>
<ul>
<li>Altenburger, Kristen M., and Johan Ugander. 2018. “Monophily in Social Networks Introduces Similarity Among Friends-of-Friends.” <em>Nature Human Behaviour</em> 2 (4): 284–90. <a href="https://doi.org/10.1038/s41562-018-0321-8" class="uri">https://doi.org/10.1038/s41562-018-0321-8</a>.</li>
<li>Peel, Leto, Jean-Charles Delvenne, and Renaud Lambiotte. 2018. “Multiscale Mixing Patterns in Networks.” <em>Proceedings of the National Academy of Sciences</em> 115 (16): 4057–62. <a href="https://doi.org/10.1073/pnas.1713019115" class="uri">https://doi.org/10.1073/pnas.1713019115</a>.</li>
</ul>
</section>
</section>
<section id="spring-2018" class="level1">
<h1>Spring 2018</h1>
<p>Organizer: <a href="https://ryanjgallagher.github.io">Ryan J. Gallagher</a></p>
<section id="april-24-twitter-cascades" class="level2">
<h2>April 24: Twitter cascades</h2>
<ul>
<li>Goel, Sharad, Ashton Anderson, Jake Hofman, and Duncan J. Watts. 2015. “The Structural Virality of Online Diffusion.” <em>Management Science</em> 62 (1), 180–96. <a href="https://doi.org/10.1287/mnsc.2015.2158" class="uri">https://doi.org/10.1287/mnsc.2015.2158</a>.</li>
</ul>
</section>
<section id="january-26-the-scale-free-networks-debate" class="level2">
<h2>January 26: The scale-free networks debate</h2>
<ul>
<li>Broido, Anna D., and Aaron Clauset. 2018. “Scale-Free Networks Are Rare.” arXiv:1801.03400 [physics.soc-ph]. <a href="http://arxiv.org/abs/1801.03400" class="uri">http://arxiv.org/abs/1801.03400</a>.</li>
</ul>
</section>
</section>
</article>
</body>
</html>