Egocentric information abstraction for heterogeneous social networks.
In 2009 International Conference on Advances in Social Network
Analysis and Mining, pages 255–260. IEEE, 2009.

[Li et al., 2014]
Chun-Hsien Li, Chiung-Chiou Tsai, and Suh-Yuh Yang.
Analysis of epidemic spreading of an sirs model in complex
heterogeneous networks.
Communications in Nonlinear Science and Numerical Simulation,
190 (4):0 1042–1054, 2014.

[Li et al., 2011]
Geng Li, Murat Semerci, Bulent Yener, and Mohammed J Zaki.
Graph classification via topological and label attributes.
In Proceedings of the 9th international workshop on mining and
learning with graphs (MLG), San Diego, USA, volume 2, 2011.

[Li et al., 2019]
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, TK Satish Kumar, and Sven
Multi-agent path finding for large agents.
In Proceedings of the AAAI Conference on Artificial
Intelligence, volume 33, pages 7627–7634, 2019.

[Li et al., 2017]
Jundong Li, Harsh Dani, Xia Hu, Jiliang Tang, Yi Chang, and Huan Liu.
Attributed network embedding for learning in a dynamic environment.
In Proceedings of the 2017 ACM on Conference on Information and
Knowledge Management, pages 387–396, 2017a.

[Li et al., 2005]
Menghui Li, Ying Fan, Jiawei Chen, Liang Gao, Zengru Di, and Jinshan Wu.
Weighted networks of scientific communication: the measurement and
topological role of weight.
Physica A: Statistical Mechanics and its Applications,
3500 (2-4):0 643–656, 2005.

[Li and Muldowney, 1995]
Michael Y Li and James S Muldowney.
Global stability for the seir model in epidemiology.
Mathematical biosciences, 1250 (2):0 155–164,

[Li et al., 1999]
Michael Y Li, John R Graef, Liancheng Wang, and János Karsai.
Global dynamics of a seir model with varying total population size.
Mathematical biosciences, 1600 (2):0 191–213,

[Li et al., 2004]
Siming Li, Christopher M Armstrong, Nicolas Bertin, Hui Ge, Stuart Milstein,
Mike Boxem, Pierre-Olivier Vidalain, Jing-Dong J Han, Alban Chesneau, Tong
Hao, et al.
A map of the interactome network of the metazoan c. elegans.
Science, 3030 (5657):0 540–543, 2004.

[Li et al., 2017]
Yaguang Li, Rose Yu, Cyrus Shahabi, and Yan Liu.
Diffusion convolutional recurrent neural network: Data-driven traffic
arXiv preprint arXiv:1707.01926, 2017b.

[Li et al., 2018]
Yujia Li, Oriol Vinyals, Chris Dyer, Razvan Pascanu, and Peter Battaglia.
Learning deep generative models of graphs.
arXiv preprint arXiv:1803.03324, 2018.

[Liao et al., 2018]
Lizi Liao, Xiangnan He, Hanwang Zhang, and Tat-Seng Chua.
Attributed social network embedding.
IEEE Transactions on Knowledge and Data Engineering,
300 (12):0 2257–2270, 2018.

[Liben-Nowell and Kleinberg, 2007]
David Liben-Nowell and Jon Kleinberg.
The link-prediction problem for social networks.
Journal of the American society for information science and
technology, 580 (7):0 1019–1031, 2007.

[Liberty, 2013]
Edo Liberty.
Simple and deterministic matrix sketching.
In SIGKDD, pages 581–588, 2013.

[Lichtenwalter et al., 2010]
Ryan N Lichtenwalter, Jake T Lussier, and Nitesh V Chawla.
New perspectives and methods in link prediction.
In Proceedings of the 16th ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 243–252, 2010.

[Lichtnwalter and Chawla, 2012]
Ryan Lichtnwalter and Nitesh V Chawla.
Link prediction: fair and effective evaluation.
In 2012 IEEE/ACM International Conference on Advances in Social
Networks Analysis and Mining, pages 376–383. IEEE, 2012.

[Lin, 1976]
Nan Lin.
Foundations of social research.
McGraw-Hill Companies, 1976.

[Lin et al., 2015]
Yankai Lin, Zhiyuan Liu, Maosong Sun, Yang Liu, and Xuan Zhu.
Learning entity and relation embeddings for knowledge graph
In Twenty-ninth AAAI conference on artificial intelligence,

[Lin et al., 2017]
Zhouhan Lin, Minwei Feng, Cicero Nogueira dos Santos, Mo Yu, Bing Xiang, Bowen
Zhou, and Yoshua Bengio.
A structured self-attentive sentence embedding.
arXiv preprint arXiv:1703.03130, 2017.

[Liu and Terzi, 2008]
Kun Liu and Evimaria Terzi.
Towards identity anonymization on graphs.
In Proceedings of the 2008 ACM SIGMOD international conference
on Management of data, pages 93–106, 2008.

[Liu et al., 2018]
Lu Liu, Yang Wang, Roberta Sinatra, C Lee Giles, Chaoming Song, and Dashun
Hot streaks in artistic, cultural, and scientific careers.
Nature, 5590 (7714):0 396, 2018a.

[Liu et al., 2019]
Minghua Liu, Hang Ma, Jiaoyang Li, and Sven Koenig.
Task and path planning for multi-agent pickup and delivery.
In Int Conf on Autonomous Agents and MultiAgent Systems, pages
1152–1160. IFAAMAS, 2019.

[Liu and Lü, 2010]
Weiping Liu and Linyuan Lü.
Link prediction based on local random walk.
EPL (Europhysics Letters), 890 (5):0 58007,

[Liu and Murata, 2010]
Xin Liu and Tsuyoshi Murata.
Community detection in large-scale bipartite networks.
Transactions of the Japanese Society for Artificial
Intelligence, 250 (1):0 16–24, 2010.

[Liu and Heer, 2018]
Yang Liu and Jeffrey Heer.
Somewhere over the rainbow: An empirical assessment of quantitative
In Proceedings of the 2018 CHI Conference on Human Factors in
Computing Systems, pages 1–12, 2018.

[Liu et al., 2011]
Yang-Yu Liu, Jean-Jacques Slotine, and Albert-László Barabási.
Controllability of complex networks.
nature, 4730 (7346):0 167, 2011.

[Liu et al., 2018]
Yike Liu, Tara Safavi, Abhilash Dighe, and Danai Koutra.
Graph summarization methods and applications: A survey.
ACM Computing Surveys (CSUR), 510 (3):0 1–34,

[Liu et al., 2018]
Zhuang Liu, Mingjie Sun, Tinghui Zhou, Gao Huang, and Trevor Darrell.
Rethinking the value of network pruning.
arXiv preprint arXiv:1810.05270, 2018c.

[Lloyd, 1982]
Stuart Lloyd.
Least squares quantization in pcm.
IEEE transactions on information theory, 280
(2):0 129–137, 1982.

[Lott, 1979]
Dale F Lott.
Dominance relations and breeding rate in mature male american bison.
Zeitschrift für Tierpsychologie, 490 (4):0
418–432, 1979.

[Lovász et al., 1993]
László Lovász et al.
Random walks on graphs: A survey.
Combinatorics, Paul erdos is eighty, 20 (1):0
1–46, 1993.

[Lovelace, 1842]
Ada Lovelace.
Notes on menabrea's “sketch of the analytical engine invented by
charles babbage”, 1842.

[Lu et al., 2016]
Can Lu, Jeffrey Xu Yu, Rong-Hua Li, and Hao Wei.
Exploring hierarchies in online social networks.
IEEE Transactions on Knowledge and Data Engineering,
280 (8):0 2086–2100, 2016.

[Lü and Liu, 2011]
Linyuan Lü and Weiping Liu.
Information filtering via preferential diffusion.
Physical Review E, 830 (6):0 066119, 2011.

[Lü and Zhou, 2011]
Linyuan Lü and Tao Zhou.
Link prediction in complex networks: A survey.
Physica A: statistical mechanics and its applications,
3900 (6):0 1150–1170, 2011.

[Lu and Bressan, 2012]
Xuesong Lu and Stéphane Bressan.
Sampling connected induced subgraphs uniformly at random.
In International Conference on Scientific and Statistical
Database Management, pages 195–212. Springer, 2012.

[Luccio, 2007]
Flaminia L Luccio.
Intruder capture in sierpinski graphs.
In FUN, pages 249–261. Springer, 2007.

[Luo et al., 2008]
Feng Luo, James Z Wang, and Eric Promislow.
Exploring local community structures in large networks.
Web Intelligence and Agent Systems: An International Journal,
60 (4):0 387–400, 2008.

[Luo and Magee, 2011]
Jianxi Luo and Christopher L Magee.
Detecting evolving patterns of self-organizing networks by flow
hierarchy measurement.
Complexity, 160 (6):0 53–61, 2011.

[Ma and Mondragón, 2015]
Athen Ma and Raúl J Mondragón.
Rich-cores in networks.
PloS one, 100 (3):0 e0119678, 2015.

[Ma et al., 2017]
Hang Ma, TK Satish Kumar, and Sven Koenig.
Multi-agent path finding with delay probabilities.
In Thirty-First AAAI Conference on Artificial Intelligence,

[Ma et al., 2008]
Hao Ma, Haixuan Yang, Michael R Lyu, and Irwin King.
Mining social networks using heat diffusion processes for marketing
candidates selection.
In Proceedings of the 17th ACM conference on Information and
knowledge management, pages 233–242. ACM, 2008.

[Maas, 2011]
Jan Maas.
Gradient flows of the entropy for finite markov chains.
Journal of Functional Analysis, 2610 (8):0
2250–2292, 2011.

[Maaten and Hinton, 2008]
Laurens van der Maaten and Geoffrey Hinton.
Visualizing data using t-sne.
Journal of machine learning research, 90
(Nov):0 2579–2605, 2008.

[Mac Arthur and Wilson, 1967]
Robert H Mac Arthur and Edward Osbornecoaut Wilson.
The theory of island biogeography.
Technical report, 1967.

[MacQueen et al., 1967]
James MacQueen et al.
Some methods for classification and analysis of multivariate
In Berkeley symp on math statistics and probability, volume 1,
pages 281–297. Oakland, CA, USA, 1967.

[Magnani and Rossi, 2011]
Matteo Magnani and Luca Rossi.
The ml-model for multi-layer social networks.
In ASONAM, pages 5–12. IEEE, 2011.

[727]
Matteo Magnani, Luca Rossi, and Davide Vega.
Analysis of multiplex social networks with r.

[Maiya and Berger-Wolf, 2011]
Arun S Maiya and Tanya Y Berger-Wolf.
Benefits of bias: Towards better characterization of network
In Proceedings of the 17th ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 105–113. ACM, 2011.

[Mäkinen, 1990]
Erkki Mäkinen.
How to draw a hypergraph.
International Journal of Computer Mathematics, 340
(3-4):0 177–185, 1990.

[Malliaros and Vazirgiannis, 2013]
Fragkiskos D Malliaros and Michalis Vazirgiannis.
Clustering and community detection in directed networks: A survey.
Physics Reports, 5330 (4):0 95–142, 2013.

[Marcaccioli and Livan, 2019]
Riccardo Marcaccioli and Giacomo Livan.
A pólya urn approach to information filtering in complex
Nature Communications, 100 (1):0 745, 2019.

[Marchiori and Latora, 2000]
Massimo Marchiori and Vito Latora.
Harmony in the small-world.
Physica A: Statistical Mechanics and its Applications,
2850 (3-4):0 539–546, 2000.

[Marotta et al., 2015]
Luca Marotta, Salvatore Micciche, Yoshi Fujiwara, Hiroshi Iyetomi, Hideaki
Aoyama, Mauro Gallegati, and Rosario N Mantegna.
Bank-firm credit network in japan: an analysis of a bipartite
PloS one, 100 (5):0 e0123079, 2015.

[Martin et al., 2014]
Travis Martin, Xiao Zhang, and Mark EJ Newman.
Localization and centrality in networks.
Physical review E, 900 (5):0 052808, 2014.

[Martínez et al., 2017]
Víctor Martínez, Fernando Berzal, and Juan-Carlos Cubero.
A survey of link prediction in complex networks.
ACM Computing Surveys (CSUR), 490 (4):0 69,

[Massara et al., 2016]
Guido Previde Massara, Tiziana Di Matteo, and Tomaso Aste.
Network filtering for big data: Triangulated maximally filtered
Journal of complex Networks, 50 (2):0
161–178, 2016.

[Masuda and Lambiotte, 2016]
Naoki Masuda and Renaud Lambiotte.
A Guidance to Temporal Networks.
World Scientific, 2016.

[Mateti and Deo, 1976]
Prabhaker Mateti and Narsingh Deo.
On algorithms for enumerating all circuits of a graph.
SIAM Journal on Computing, 50 (1):0 90–99,

[Mathioudakis et al., 2011]
Michael Mathioudakis, Francesco Bonchi, Carlos Castillo, Aristides Gionis, and
Antti Ukkonen.
Sparsification of influence networks.
In Proceedings of the 17th ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 529–537, 2011.

[Matsuno and Murata, 2018]
Ryuta Matsuno and Tsuyoshi Murata.
Mell: effective embedding method for multiplex networks.
In Companion Proceedings of the The Web Conference 2018, pages
1261–1268, 2018.

[McClendon et al., 2012]
Christopher L McClendon, Lan Hua, Gabriela Barreiro, and Matthew P Jacobson.
Comparing conformational ensembles using the kullback–leibler
divergence expansion.
Journal of chemical theory and computation, 80
(6):0 2115–2126, 2012.

[McClintock, 2010]
Elizabeth Aura McClintock.
When does race matter? race, sex, and dating at an elite university.
Journal of Marriage and Family, 720 (1):0
45–72, 2010.

[McDaid et al., 2011]
Aaron F McDaid, Derek Greene, and Neil Hurley.
Normalized mutual information to evaluate overlapping community
finding algorithms.
arXiv preprint arXiv:1110.2515, 2011.

[McGee et al., 2019]
Fintan McGee, Mohammad Ghoniem, Guy Melançon, Benoît Otjacques, and
Bruno Pinaud.
The state of the art in multilayer network visualization.
In Computer Graphics Forum, volume 38, pages 125–149. Wiley
Online Library, 2019.

[McGregor and Stubbs, 2013]
Andrew McGregor and Daniel Stubbs.
Sketching earth-mover distance on graph metrics.
In Approximation, Randomization, and Combinatorial
Optimization. Algorithms and Techniques, pages 274–286. Springer, 2013.

[McKay et al., 1981]
Brendan D McKay et al.
Practical graph isomorphism.
Department of Computer Science, Vanderbilt University Tennessee, USA,

[McPherson et al., 2001]
Miller McPherson, Lynn Smith-Lovin, and James M Cook.
Birds of a feather: Homophily in social networks.
Annual review of sociology, 270 (1):0
415–444, 2001.

[Mehmood et al., 2013]
Yasir Mehmood, Nicola Barbieri, Francesco Bonchi, and Antti Ukkonen.
Csi: Community-level social influence analysis.
In Joint European Conference on Machine Learning and Knowledge
Discovery in Databases, pages 48–63. Springer, 2013.

[Meilă, 2007]
Marina Meilă.
Comparing clusterings—an information based distance.
Journal of multivariate analysis, 980 (5):0
873–895, 2007.

[Meirelles, 2013]
Isabel Meirelles.
Design for information: an introduction to the histories,
theories, and best practices behind effective information visualizations.
Rockport publishers, 2013.

[Mejia et al., 2019]
Victor Gabriel Lopez Mejia, Frank L Lewis, Yan Wan, Edgar N Sanchez, and
Lingling Fan.
Solutions for multiagent pursuit-evasion games on communication
graphs: Finite-time capture and asymptotic behaviors.
IEEE Transactions on Automatic Control, 2019.

[Melamed, 2014]
David Melamed.
Community structures in bipartite networks: A dual-projection
PloS one, 90 (5):0 e97823, 2014.

[Melnik et al., 2002]
Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm.
Similarity flooding: A versatile graph matching algorithm and its
application to schema matching.
In Proceedings 18th International Conference on Data
Engineering, pages 117–128. IEEE, 2002.

[Menczer et al., 2020]
Filippo Menczer, Santo Fortunato, and Clayton A Davis.
A First Course in Network Science.
Cambridge University Press, 2020.

[Merton, 1968]
Robert K Merton.
The matthew effect in science: The reward and communication systems
of science are considered.
Science, 1590 (3810):0 56–63, 1968.

[Meyer, 2000]
Carl D Meyer.
Matrix analysis and applied linear algebra, volume 71.
Siam, 2000.

[Micale et al., 2019]
Giovanni Micale, Alfredo Pulvirenti, Alfredo Ferro, Rosalba Giugno, and Dennis
Fast methods for finding significant motifs on labelled
multi-relational networks.
Journal of Complex Networks, 2019.

[Mikolov et al., 2013]
Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean.
Efficient estimation of word representations in vector space.
arXiv preprint arXiv:1301.3781, 2013a.

[Mikolov et al., 2013]
Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean.
Distributed representations of words and phrases and their
Advances in neural information processing systems,
26:0 3111–3119, 2013b.

[Milenković et al., 2010]
Tijana Milenković, Weng Leong Ng, Wayne Hayes, and Nataša
Optimal network alignment with graphlet degree vectors.
Cancer informatics, 9:0 CIN–S4744, 2010.

[Milgram, 1967]
Stanley Milgram.
The small world problem.
Psychology today, 20 (1):0 60–67, 1967.

[Miller, 2009]
Joel C Miller.
Percolation and epidemics in random clustered networks.
Physical Review E, 800 (2):0 020901, 2009.

[Miller and Eliassi-Rad, 2010]
K Miller and Tina Eliassi-Rad.
Continuous time group discovery in dynamic graphs.
Technical report, LLNL, 2010.

[Mills et al., 2013]
Barbara J Mills, Jeffery J Clark, Matthew A Peeples, W Randall Haas, John M
Roberts, J Brett Hill, Deborah L Huntley, Lewis Borck, Ronald L Breiger,
Aaron Clauset, et al.
Transformation of social networks in the late pre-hispanic us
Proceedings of the National Academy of Sciences, 1100
(15):0 5785–5790, 2013.

[Milo et al., 2002]
Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii,
and Uri Alon.
Network motifs: simple building blocks of complex networks.
Science, 2980 (5594):0 824–827, 2002.

[Milojević, 2010]
Staša Milojević.
Power law distributions in information science: Making the case for
logarithmic binning.
Journal of the American Society for Information Science and
Technology, 610 (12):0 2417–2425, 2010.

[Min et al., 2014]
Byungjoon Min, Su Do Yi, Kyu-Min Lee, and K-I Goh.
Network robustness of multiplex networks with interlayer degree
Physical Review E, 890 (4):0 042811, 2014.

[Mizuno et al., 2006]
Takayuki Mizuno, Hideki Takayasu, and Misako Takayasu.
Correlation networks among currencies.
Physica A: Statistical Mechanics and its Applications,
364:0 336–342, 2006.

[Molloy and Reed, 1995]
Michael Molloy and Bruce Reed.
A critical point for random graphs with a given degree sequence.
Random structures & algorithms, 60 (2-3):0
161–180, 1995.

[Molloy and Reed, 1998]
Michael Molloy and Bruce Reed.
The size of the giant component of a random graph with a given degree
Combinatorics, probability and computing, 70
(3):0 295–305, 1998.

[Mondragon et al., 2018]
Raul J Mondragon, Jacopo Iacovacci, and Ginestra Bianconi.
Multilink communities of multiplex networks.
PloS one, 130 (3):0 e0193821, 2018.

[Mones, 2013]
Enys Mones.
Hierarchy in directed random networks.
Physical Review E, 870 (2):0 022817, 2013.

[Mones et al., 2012]
Enys Mones, Lilla Vicsek, and Tamás Vicsek.
Hierarchy measure for complex networks.
PloS one, 70 (3):0 e33799, 2012.

[Monge, 1781]
Gaspard Monge.
Mémoire sur la théorie des déblais et des remblais.
Histoire de l'Académie Royale des Sciences de Paris, 1781.

[Mønsted et al., 2017]
Bjarke Mønsted, Piotr Sapieżyński, Emilio Ferrara, and Sune Lehmann.
Evidence of complex contagion of information in social media: An
experiment using twitter bots.
PloS one, 120 (9), 2017.

[Moon, 1996]
Todd K Moon.
The expectation-maximization algorithm.
IEEE Signal processing magazine, 130 (6):0
47–60, 1996.

[Moore, 1959]
Edward F Moore.
The shortest path through a maze.
In Proc. Int. Symp. Switching Theory, 1959, pages 285–292,

[Moreno et al., 1932]
Jacob Levy Moreno, Helen Hall Jennings, and Ernest Stagg Whitin.
Group method and group psychotherapy.
Number 5. Beacon House, 1932.

[Morini et al., 2017]
Matteo Morini, Patrick Flandrin, Eric Fleury, Tommaso Venturini, and Pablo
Revealing evolutions in dynamical networks.
arXiv preprint arXiv:1707.02114, 2017.

[Morris et al., 2019]
Christopher Morris, Martin Ritzert, Matthias Fey, William L Hamilton, Jan Eric
Lenssen, Gaurav Rattan, and Martin Grohe.
Weisfeiler and leman go neural: Higher-order graph neural networks.
In Proceedings of the AAAI Conference on Artificial
Intelligence, volume 33, pages 4602–4609, 2019.

[Morstatter et al., 2013]
Fred Morstatter, Jürgen Pfeffer, Huan Liu, and Kathleen M Carley.
Is the sample good enough? comparing data from twitter's streaming
api with twitter's firehose.
In Seventh international AAAI conference on weblogs and social
media, 2013.

[Morstatter et al., 2014]
Fred Morstatter, Jürgen Pfeffer, and Huan Liu.
When is it biased?: assessing the representativeness of twitter's
streaming api.
In Proceedings of the 23rd international conference on world
wide web, pages 555–556. ACM, 2014.

[Mucha et al., 2010]
Peter J Mucha, Thomas Richardson, Kevin Macon, Mason A Porter, and Jukka-Pekka
Community structure in time-dependent, multiscale, and multiplex
science, 3280 (5980):0 876–878, 2010.

[Muegge et al., 2011]
Brian D Muegge, Justin Kuczynski, Dan Knights, Jose C Clemente, Antonio
González, Luigi Fontana, Bernard Henrissat, Rob Knight, and Jeffrey I
Diet drives convergence in gut microbiome functions across mammalian
phylogeny and within humans.
Science, 3320 (6032):0 970–974, 2011.

[Muhammad and Egerstedt, 2006]
Abubakr Muhammad and Magnus Egerstedt.
Control using higher order laplacians in network topologies.
In Proc. of 17th International Symposium on Mathematical Theory
of Networks and Systems, pages 1024–1038. Citeseer, 2006.

[Munzner, 2014]
Tamara Munzner.
Visualization analysis and design.
AK Peters/CRC Press, 2014.

[Musolesi and Mascolo, 2006]
Mirco Musolesi and Cecilia Mascolo.
A community based mobility model for ad hoc network research.
In Proceedings of the 2nd international workshop on Multi-hop
ad hoc networks: from theory to reality, pages 31–38, 2006.

[Myers et al., 2000]
Richard Myers, RC Wison, and Edwin R Hancock.
Bayesian graph edit distance.
IEEE Transactions on Pattern Analysis and Machine
Intelligence, 220 (6):0 628–635, 2000.

[Najork et al., 2009]
Marc Najork, Sreenivas Gollapudi, and Rina Panigrahy.
Less is more: sampling the neighborhood graph makes salsa better and
In Proceedings of the Second ACM International Conference on
Web Search and Data Mining, pages 242–251, 2009.

[Narang et al., 2013]
Sunil K Narang, Akshay Gadde, Eduard Sanou, and Antonio Ortega.
Localized iterative methods for interpolation in graph structured
In Global Conference on Signal and Information Processing
(GlobalSIP), 2013 IEEE, pages 491–494. IEEE, 2013.

[Narasimhamurthy et al., 2008]
Anand Narasimhamurthy, Derek Greene, Neil Hurley, and Pádraig Cunningham.
Community finding in large social networks through problem
In Proc. 19th Irish Conference on Artificial Intelligence and
Cognitive Science, AICS, volume 8, 2008.

[Narayanan and Shmatikov, 2009]
Arvind Narayanan and Vitaly Shmatikov.
De-anonymizing social networks.
In 2009 30th IEEE symposium on security and privacy, pages
173–187. IEEE, 2009.

[Navlakha et al., 2008]
Saket Navlakha, Rajeev Rastogi, and Nisheeth Shrivastava.
Graph summarization with bounded error.
In Proceedings of the 2008 ACM SIGMOD international conference
on Management of data, pages 419–432, 2008.

[Nekovee et al., 2007]
Maziar Nekovee, Yamir Moreno, Ginestra Bianconi, and Matteo Marsili.
Theory of rumour spreading in complex social networks.
Physica A: Statistical Mechanics and its Applications,
3740 (1):0 457–470, 2007.

[Nematzadeh et al., 2014]
Azadeh Nematzadeh, Emilio Ferrara, Alessandro Flammini, and Yong-Yeol Ahn.
Optimal network modularity for information diffusion.
Physical review letters, 1130 (8):0 088701,

[Nepusz et al., 2008]
Tamás Nepusz, Andrea Petróczi, László Négyessy, and
Fülöp Bazsó.
Fuzzy communities and the concept of bridgeness in complex networks.
Physical Review E, 770 (1):0 016107, 2008.

[Neuwirth and Brewer, 2014]
Erich Neuwirth and R Color Brewer.
Colorbrewer palettes.
R package version, pages 1–1, 2014.

[Newman, 2018]
M Newman.
Network reconstruction and error estimation with noisy network data.
arXiv preprint arXiv:1803.02427, 2018a.

[Newman, 2018]
Mark Newman.
Oxford university press, 2018b.

[Newman, 2001]
Mark EJ Newman.
Clustering and preferential attachment in growing networks.
Physical review E, 640 (2):0 025102,

[Newman, 2001]
Mark EJ Newman.
Scientific collaboration networks. i. network construction and
fundamental results.
Physical review E, 640 (1):0 016131,

[Newman, 2001]
Mark EJ Newman.
Scientific collaboration networks. ii. shortest paths, weighted
networks, and centrality.
Physical review E, 640 (1):0 016132,

[Newman, 2002]
Mark EJ Newman.
Assortative mixing in networks.
Physical review letters, 890 (20):0 208701,

[Newman, 2003]
Mark EJ Newman.
Mixing patterns in networks.
Physical Review E, 670 (2):0 026126,

[Newman, 2003]
Mark EJ Newman.
The structure and function of complex networks.
SIAM review, 450 (2):0 167–256,

[Newman, 2004]
Mark EJ Newman.
Analysis of weighted networks.
Physical review E, 700 (5):0 056131,

[Newman, 2004]
Mark EJ Newman.
Detecting community structure in networks.
The European Physical Journal B, 380 (2):0
321–330, 2004b.

[Newman, 2004]
Mark EJ Newman.
Fast algorithm for detecting community structure in networks.
Physical review E, 690 (6):0 066133,

[Newman, 2005]
Mark EJ Newman.
A measure of betweenness centrality based on random walks.
Social networks, 270 (1):0 39–54,

[Newman, 2005]
Mark EJ Newman.
Power laws, pareto distributions and zipf's law.
Contemporary physics, 460 (5):0 323–351,

[Newman, 2006]
Mark EJ Newman.
Finding community structure in networks using the eigenvectors of
Physical review E, 740 (3):0 036104,

[Newman, 2006]
Mark EJ Newman.
Modularity and community structure in networks.
Proceedings of the national academy of sciences, 1030
(23):0 8577–8582, 2006b.

[Newman, 2009]
Mark EJ Newman.
Random graphs with clustering.
Physical review letters, 1030 (5):0 058701,

[Newman, 2016]
Mark EJ Newman.
Equivalence between modularity optimization and maximum likelihood
methods for community detection.
Physical Review E, 940 (5):0 052315,

[Newman, 2016]
Mark EJ Newman.
Mathematics of networks.
The new Palgrave dictionary of economics, pages 1–8,

[Newman and Girvan, 2004]
Mark EJ Newman and Michelle Girvan.
Finding and evaluating community structure in networks.
Physical review E, 690 (2):0 026113, 2004.

[Newman and Watts, 1999]
Mark EJ Newman and Duncan J Watts.
Renormalization group analysis of the small-world network model.
Physics Letters A, 2630 (4-6):0 341–346,

[Newman et al., 2001]
Mark EJ Newman, Steven H Strogatz, and Duncan J Watts.
Random graphs with arbitrary degree distributions and their
Physical review E, 640 (2):0 026118, 2001.

[Nickel et al., 2011]
Maximilian Nickel, Volker Tresp, and Hans-Peter Kriegel.
A three-way model for collective learning on multi-relational data.
In Icml, volume 11, pages 809–816, 2011.

[Nickel et al., 2015]
Maximilian Nickel, Kevin Murphy, Volker Tresp, and Evgeniy Gabrilovich.
A review of relational machine learning for knowledge graphs.
Proceedings of the IEEE, 1040 (1):0 11–33,

[Nicosia et al., 2009]
Vincenzo Nicosia, Giuseppe Mangioni, Vincenza Carchiolo, and Michele Malgeri.
Extending the definition of modularity to directed graphs with
overlapping communities.
Journal of Statistical Mechanics: Theory and Experiment,
20090 (03):0 P03024, 2009.

[Nicosia et al., 2013]
Vincenzo Nicosia, John Tang, Cecilia Mascolo, Mirco Musolesi, Giovanni Russo,
and Vito Latora.
Graph metrics for temporal networks.
In Temporal networks, pages 15–40. Springer, 2013.

[Niepert et al., 2016]
Mathias Niepert, Mathias Ahmed, and Konstantin Kutzkov.
Learning convolutional neural networks for graphs.
In ICML, pages 2014–2023, 2016.

[Nijssen and Kok, 2005]
Siegfried Nijssen and Joost N Kok.
The gaston tool for frequent subgraph mining.
Electronic Notes in Theoretical Computer Science, 1270
(1):0 77–87, 2005.

[Nilizadeh et al., 2014]
Shirin Nilizadeh, Apu Kapadia, and Yong-Yeol Ahn.
Community-enhanced de-anonymization of online social networks.
In Proceedings of the 2014 acm sigsac conference on computer
and communications security, pages 537–548, 2014.

[Noh et al., 2005]
Jae Dong Noh, Hyeong-Chai Jeong, Yong-Yeol Ahn, and Hawoong Jeong.
Growing network model for community with group structure.
Physical Review E, 710 (3):0 036131, 2005.

[Northway, 1940]
Mary L Northway.
A method for depicting social relationships obtained by sociometric
Sociometry, pages 144–150, 1940.

[Noulas et al., 2012]
Anastasios Noulas, Salvatore Scellato, Renaud Lambiotte, Massimiliano Pontil,
and Cecilia Mascolo.
A tale of many cities: universal patterns in human urban mobility.
PloS one, 70 (5), 2012.

[Nuutila and Soisalon-Soininen, 1994]
Esko Nuutila and Eljas Soisalon-Soininen.
On finding the strongly connected components in a directed graph.
Inf. Process. Lett., 490 (1):0 9–14, 1994.

[Omran, 2005]
Abdel R Omran.
The epidemiologic transition: a theory of the epidemiology of
population change.
The Milbank Quarterly, 830 (4):0 731–757,

[Onnela et al., 2005]
Jukka-Pekka Onnela, Jari Saramäki, János Kertész, and Kimmo Kaski.
Intensity and coherence of motifs in weighted complex networks.
Physical Review E, 710 (6):0 065103, 2005.

[Onnela et al., 2011]
Jukka-Pekka Onnela, Samuel Arbesman, Marta C González,
Albert-László Barabási, and Nicholas A Christakis.
Geographic constraints on social network groups.
PLoS one, 60 (4):0 e16939, 2011.

[Opsahl et al., 2010]
Tore Opsahl, Filip Agneessens, and John Skvoretz.
Node centrality in weighted networks: Generalizing degree and
shortest paths.
Social networks, 320 (3):0 245–251, 2010.

[Orman and Labatut, 2009]
Günce Keziban Orman and Vincent Labatut.
A comparison of community detection algorithms on artificial
In DS, pages 242–256. Springer, 2009.

[Ou et al., 2016]
Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, and Wenwu Zhu.
Asymmetric transitivity preserving graph embedding.
In SIGKDD, pages 1105–1114, 2016.

[Padgett and Ansell, 1993]
John F Padgett and Christopher K Ansell.
Robust action and the rise of the medici, 1400-1434.
American journal of sociology, 980 (6):0
1259–1319, 1993.

[Page et al., 1999]
Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd.
The pagerank citation ranking: Bringing order to the web.
Technical report, Stanford InfoLab, 1999.

[Palla et al., 2007]
Gergely Palla, Albert-László Barabási, and Tamás Vicsek.
Quantifying social group evolution.
Nature, 4460 (7136):0 664, 2007.

[Pan and Saramäki, 2011]
Raj Kumar Pan and Jari Saramäki.
Path lengths, correlations, and centrality in temporal networks.
Physical Review E, 840 (1):0 016105, 2011.

[Pan et al., 2016]
Shirui Pan, Jia Wu, Xingquan Zhu, Chengqi Zhang, and Yang Wang.
Tri-party deep network representation.
Network, 110 (9):0 12, 2016.

[Papadimitriou et al., 2010]
Panagiotis Papadimitriou, Ali Dasdan, and Hector Garcia-Molina.
Web graph similarity for anomaly detection.
Journal of Internet Services and Applications, 10
(1):0 19–30, 2010.

[Papadimitriou et al., 2008]
Spiros Papadimitriou, Jimeng Sun, Christos Faloutsos, and S Yu Philip.
Hierarchical, parameter-free community discovery.
In Joint European Conference on Machine Learning and Knowledge
Discovery in Databases, pages 170–187. Springer, 2008.

[Papadopoulos et al., 2012]
Fragkiskos Papadopoulos, Maksim Kitsak, M Ángeles Serrano, Marián
Boguná, and Dmitri Krioukov.
Popularity versus similarity in growing networks.
Nature, 4890 (7417):0 537–540, 2012.

[Papadopoulos et al., 2009]
Symeon Papadopoulos, Andre Skusa, Athena Vakali, Yiannis Kompatsiaris, and
Nadine Wagner.
Bridge bounding: A local approach for efficient community discovery
in complex networks.
arXiv preprint arXiv:0902.0871, 2009.

[Papagelis et al., 2013]
Manos Papagelis, Gautam Das, and Nick Koudas.
Sampling online social networks.
IEEE Transactions on knowledge and data engineering,
250 (3):0 662–676, 2013.

[Pappalardo et al., 2012]
Luca Pappalardo, Giulio Rossetti, and Dino Pedreschi.
" how well do we know each other?" detecting tie strength in
multidimensional social networks.
In 2012 IEEE/ACM International Conference on Advances in Social
Networks Analysis and Mining, pages 1040–1045. IEEE, 2012.

[Pappalardo et al., 2015]
Luca Pappalardo, Filippo Simini, Salvatore Rinzivillo, Dino Pedreschi, Fosca
Giannotti, and Albert-László Barabási.
Returners and explorers dichotomy in human mobility.
Nature communications, 6:0 8166, 2015.

[Paranjape et al., 2017]
Ashwin Paranjape, Austin R Benson, and Jure Leskovec.
Motifs in temporal networks.
In Proceedings of the Tenth ACM International Conference on Web
Search and Data Mining, pages 601–610. ACM, 2017.

[Pareto, 1919]
Vilfredo Pareto.
Manuale di economia politica con una introduzione alla scienza
sociale, volume 13.
Società editrice libraria, 1919.

[Park et al., 2019]
Namyong Park, Andrey Kan, Xin Luna Dong, Tong Zhao, and Christos Faloutsos.
Estimating node importance in knowledge graphs using graph neural
In Proceedings of the 25th ACM SIGKDD International Conference
on Knowledge Discovery & Data Mining, pages 596–606, 2019.

[Parshani et al., 2011]
Roni Parshani, Celine Rozenblat, Daniele Ietri, Cesar Ducruet, and Shlomo
Inter-similarity between coupled networks.
EPL (Europhysics Letters), 920 (6):0 68002,

[Parsons, 1978]
Torrence D Parsons.
Pursuit-evasion in a graph.
In Theory and applications of graphs, pages 426–441.
Springer, 1978.

[Parthasarathy et al., 2011]
Srinivasan Parthasarathy, Yiye Ruan, and Venu Satuluri.
Community discovery in social networks: Applications, methods and
emerging trends.
In Social network data analytics, pages 79–113. Springer,

[Parzen, 1962]
Emanuel Parzen.
On estimation of a probability density function and mode.
The annals of mathematical statistics, 330
(3):0 1065–1076, 1962.

[Pastor-Satorras and Vespignani, 2001]
Romualdo Pastor-Satorras and Alessandro Vespignani.
Epidemic dynamics and endemic states in complex networks.
Physical Review E, 630 (6):0 066117,

[Pastor-Satorras and Vespignani, 2001]
Romualdo Pastor-Satorras and Alessandro Vespignani.
Epidemic spreading in scale-free networks.
Physical review letters, 860 (14):0 3200,

[Pastor-Satorras et al., 2001]
Romualdo Pastor-Satorras, Alexei Vázquez, and Alessandro Vespignani.
Dynamical and correlation properties of the internet.
Physical review letters, 870 (25):0 258701,

[Pastor-Satorras et al., 2015]
Romualdo Pastor-Satorras, Claudio Castellano, Piet Van Mieghem, and Alessandro
Epidemic processes in complex networks.
Reviews of modern physics, 870 (3):0 925,

[Patro and Kingsford, 2012]
Rob Patro and Carl Kingsford.
Global network alignment using multiscale spectral signatures.
Bioinformatics, 280 (23):0 3105–3114, 2012.

[Patterson, 1987]
Bruce D Patterson.
The principle of nested subsets and its implications for biological
Conservation Biology, 10 (4):0 323–334, 1987.

[Pawlik and Augsten, 2011]
Mateusz Pawlik and Nikolaus Augsten.
Rted: a robust algorithm for the tree edit distance.
arXiv preprint arXiv:1201.0230, 2011.

[Payrató-Borras et al., 2019]
Claudia Payrató-Borras, Laura Hernández, and Yamir Moreno.
Breaking the spell of nestedness: The entropic origin of nestedness
in mutualistic systems.
Physical Review X, 90 (3):0 031024, 2019.

[Pearl and Mackenzie, 2018]
Judea Pearl and Dana Mackenzie.
The book of why: the new science of cause and effect.
Basic Books, 2018.

[Peel and Clauset, 2015]
Leto Peel and Aaron Clauset.
Detecting change points in the large-scale structure of evolving
In Twenty-Ninth AAAI Conference on Artificial Intelligence,

[Peel et al., 2017]
Leto Peel, Daniel B Larremore, and Aaron Clauset.
The ground truth about metadata and community detection in networks.
Science advances, 30 (5):0 e1602548, 2017.

[Pei et al., 2000]
Jian Pei, Jiawei Han, Runying Mao, et al.
Closet: An efficient algorithm for mining frequent closed itemsets.
In ACM SIGMOD workshop on research issues in data mining and
knowledge discovery, volume 4, pages 21–30, 2000.

[Peixoto, 2014]
Tiago P Peixoto.
Efficient monte carlo and greedy heuristic for the inference of
stochastic block models.
Physical Review E, 890 (1):0 012804,

[Peixoto, 2014]
Tiago P Peixoto.
The graph-tool python library.
figshare, 2014b.

[Peixoto, 2014]
Tiago P Peixoto.
Hierarchical block structures and high-resolution model selection in
large networks.
Physical Review X, 40 (1):0 011047,

[Peixoto, 2015]
Tiago P Peixoto.
Inferring the mesoscale structure of layered, edge-valued, and
time-varying networks.
Physical Review E, 920 (4):0 042807, 2015.

[Peixoto, 2018]
Tiago P Peixoto.
Reconstructing networks with unknown and heterogeneous errors.
Physical Review X, 80 (4):0 041011, 2018.

[Pele and Werman, 2008]
Ofir Pele and Michael Werman.
A linear time histogram metric for improved sift matching.
In European conference on computer vision, pages 495–508.
Springer, 2008.

[Pele and Werman, 2009]
Ofir Pele and Michael Werman.
Fast and robust earth mover's distances.
In Computer vision, 2009 IEEE 12th international conference
on, pages 460–467. IEEE, 2009.

[Peleg et al., 1989]
Shmuel Peleg, Michael Werman, and Hillel Rom.
A unified approach to the change of resolution: Space and gray-level.
IEEE Transactions on Pattern Analysis and Machine
Intelligence, 110 (7):0 739–742, 1989.

[Pennacchioli et al., 2013]
Diego Pennacchioli, Giulio Rossetti, Luca Pappalardo, Dino Pedreschi, Fosca
Giannotti, and Michele Coscia.
The three dimensions of social prominence.
In International Conference on Social Informatics, pages
319–332. Springer, 2013.

[Pennacchioli et al., 2014]
Diego Pennacchioli, Michele Coscia, Salvatore Rinzivillo, Fosca Giannotti, and
Dino Pedreschi.
The retail market as a complex system.
EPJ Data Science, 30 (1):0 33, 2014.

[Penrose et al., 2003]
Mathew Penrose et al.
Random geometric graphs, volume 5.
Oxford university press, 2003.

[Perozzi et al., 2014]
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena.
Deepwalk: Online learning of social representations.
In Proceedings of the 20th ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 701–710. ACM, 2014.

[Perozzi et al., 2016]
Bryan Perozzi, Vivek Kulkarni, and Steven Skiena.
Walklets: Multiscale graph embeddings for interpretable network
arXiv preprint arXiv:1605.02115, 2016.

[Piketty, 2014]
Thomas Piketty.
Capital in the 21st century.

[Pinar et al., 2017]
Ali Pinar, C Seshadhri, and Vaidyanathan Vishal.
Escape: Efficiently counting all 5-vertex subgraphs.
In Proceedings of the 26th International Conference on World
Wide Web, pages 1431–1440. International World Wide Web Conferences
Steering Committee, 2017.

[Pizzuti, 2008]
Clara Pizzuti.
Ga-net: A genetic algorithm for community detection in social
In International conference on parallel problem solving from
nature, pages 1081–1090. Springer, 2008.

[Pizzuti, 2012]
Clara Pizzuti.
A multiobjective genetic algorithm to find communities in complex
IEEE Transactions on Evolutionary Computation, 160
(3):0 418–430, 2012.

[Poincaré, 1913]
Henri Poincaré.
The foundations of science.

[Pons and Latapy, 2006]
Pascal Pons and Matthieu Latapy.
Computing communities in large networks using random walks.
J. Graph Algorithms Appl., 100 (2):0 191–218,

[Porter et al., 2009]
Mason A Porter, Jukka-Pekka Onnela, and Peter J Mucha.
Communities in networks.
Notices of the AMS, 560 (9):0 1082–1097,

[Pósfai et al., 2013]
Márton Pósfai, Yang-Yu Liu, Jean-Jacques Slotine, and
Albert-László Barabási.
Effect of correlations on network controllability.
Scientific reports, 3:0 1067, 2013.

[Power, 2017]
Eleanor A Power.
Discerning devotion: Testing the signaling theory of religion.
Evolution and Human Behavior, 380 (1):0
82–91, 2017.

[Power et al., 2011]
Jonathan D Power, Alexander L Cohen, Steven M Nelson, Gagan S Wig, Kelly Anne
Barnes, Jessica A Church, Alecia C Vogel, Timothy O Laumann, Fran M Miezin,
Bradley L Schlaggar, et al.
Functional network organization of the human brain.
Neuron, 720 (4):0 665–678, 2011.

[Powers, 2011]
David Martin Powers.
Evaluation: from precision, recall and f-measure to roc,
informedness, markedness and correlation.

[Press et al., 2007]
William H Press, Saul A Teukolsky, William T Vetterling, and Brian P Flannery.
Numerical recipes 3rd edition: The art of scientific
Cambridge university press, 2007.

[Price, 1976]
Derek de Solla Price.
A general theory of bibliometric and other cumulative advantage
Journal of the American society for Information science,
270 (5):0 292–306, 1976.

[Prim, 1957]
Robert Clay Prim.
Shortest connection networks and some generalizations.
Bell system technical journal, 360 (6):0
1389–1401, 1957.

[Pujari and Kanawati, 2015]
Manisha Pujari and Rushed Kanawati.
Link prediction in multiplex networks.
NHM, 100 (1):0 17–35, 2015.

[Punin and Krishnamoorthy, 2001]
John Punin and Mukkai Krishnamoorthy.
Xgmml (extensible graph markup and modeling language), 2001.

[Purohit et al., 2014]
Manish Purohit, B Aditya Prakash, Chanhyun Kang, Yao Zhang, and
VS Subrahmanian.
Fast influence-based coarsening for large networks.
In Proceedings of the 20th ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 1296–1305, 2014.

[Radicchi et al., 2004]
Filippo Radicchi, Claudio Castellano, Federico Cecconi, Vittorio Loreto, and
Domenico Parisi.
Defining and identifying communities in networks.
Proceedings of the National Academy of Sciences, 1010
(9):0 2658–2663, 2004.

[Radicchi et al., 2011]
Filippo Radicchi, José J Ramasco, and Santo Fortunato.
Information filtering in complex weighted networks.
Physical Review E, 830 (4):0 046101, 2011.

[Raghavan et al., 2007]
Usha Nandini Raghavan, Réka Albert, and Soundar Kumara.
Near linear time algorithm to detect community structures in
large-scale networks.
Physical review E, 760 (3):0 036106, 2007.

[Raley et al., 2015]
Kelly Raley, Megan Sweeney, and Danielle Wondra.
The growing racial and ethnic divide in us marriage patterns.
Future of children, 250 (2):0 89, 2015.

[Raman, 1997]
Rajeev Raman.
Recent results on the single-source shortest paths problem.
ACM SIGACT News, 280 (2):0 81–87, 1997.

[Rand, 1971]
William M Rand.
Objective criteria for the evaluation of clustering methods.
Journal of the American Statistical association, 660
(336):0 846–850, 1971.

[Rasti et al., 2008]
Amir H Rasti, Mojtaba Torkjazi, Reza Rejaie, D Stutzbach, N Duffield, and
W Willinger.
Evaluating sampling techniques for large dynamic graphs.
Univ. Oregon, Tech. Rep. CIS-TR-08, 1, 2008.

[Rasti et al., 2009]
Amir Hassan Rasti, Mojtaba Torkjazi, Reza Rejaie, Nick Duffield, Walter
Willinger, and Daniel Stutzbach.
Respondent-driven sampling for characterizing unstructured overlays.
In IEEE INFOCOM 2009, pages 2701–2705. IEEE, 2009.

[Ravasz and Barabási, 2003]
Erzsébet Ravasz and Albert-László Barabási.
Hierarchical organization in complex networks.
Physical review E, 670 (2):0 026112, 2003.

[Ravasz et al., 2002]
Erzsébet Ravasz, Anna Lisa Somera, Dale A Mongru, Zoltán N Oltvai, and
A-L Barabási.
Hierarchical organization of modularity in metabolic networks.
science, 2970 (5586):0 1551–1555, 2002.

[Raymond et al., 2002]
John W Raymond, Eleanor J Gardiner, and Peter Willett.
Rascal: Calculation of graph similarity using maximum common edge
The Computer Journal, 450 (6):0 631–644,

[Reichardt and Bornholdt, 2006]
Jörg Reichardt and Stefan Bornholdt.
Statistical mechanics of community detection.
Physical Review E, 740 (1):0 016110, 2006.

[Reid et al., 2012]
Fergal Reid, Aaron McDaid, and Neil Hurley.
Percolation computation in complex networks.
In 2012 IEEE/ACM International Conference on Advances in Social
Networks Analysis and Mining, pages 274–281. IEEE, 2012.

[Reis et al., 2004]
Davi de Castro Reis, Paulo Braz Golgher, Altigran Soares Silva, and AlbertoF
Automatic web news extraction using tree edit distance.
In Proceedings of the 13th international conference on World
Wide Web, pages 502–511, 2004.

[Reis et al., 2014]
Saulo DS Reis, Yanqing Hu, Andrés Babino, José S Andrade Jr, Santiago
Canals, Mariano Sigman, and Hernán A Makse.
Avoiding catastrophic failure in correlated networks of networks.
Nature Physics, 100 (10):0 762, 2014.

[Rhodes and Jones, 2015]
CJ Rhodes and P Jones.
Inferring missing links in partially observed social networks.
In OR, Defence and Security, pages 256–271. Springer, 2015.

[Ribeiro and Towsley, 2010]
Bruno Ribeiro and Don Towsley.
Estimating and sampling graphs with multidimensional random walks.
In Proceedings of the 10th ACM SIGCOMM conference on Internet
measurement, pages 390–403, 2010.

[Ribeiro et al., 2017]
Leonardo FR Ribeiro, Pedro HP Saverese, and Daniel R Figueiredo.
struc2vec: Learning node representations from structural identity.
In SIGKDD, pages 385–394, 2017.

[Riesen and Bunke, 2009]
Kaspar Riesen and Horst Bunke.
Approximate graph edit distance computation by means of bipartite
graph matching.
Image and Vision computing, 270 (7):0
950–959, 2009.

[Riondato et al., 2017]
Matteo Riondato, David García-Soriano, and Francesco Bonchi.
Graph summarization with quality guarantees.
Data mining and knowledge discovery, 310 (2):0
314–349, 2017.

[Robeva and Seigal, 2017]
Elina Robeva and Anna Seigal.
Singular vectors of orthogonally decomposable tensors.
Linear and Multilinear Algebra, 650 (12):0
2457–2471, 2017.

[Robins et al., 2007]
Garry Robins, Pip Pattison, Yuval Kalish, and Dean Lusher.
An introduction to exponential random graph (p*) models for social
Social networks, 290 (2):0 173–191, 2007.

[Rochat, 2009]
Yannick Rochat.
Closeness centrality extended to unconnected graphs: The harmonic
centrality index.
Technical report, 2009.

[Rombach et al., 2014]
M Puck Rombach, Mason A Porter, James H Fowler, and Peter J Mucha.
Core-periphery structure in networks.
SIAM Journal on Applied mathematics, 740 (1):0
167–190, 2014.

[Rosenblatt, 1956]
Murray Rosenblatt.
Remarks on some nonparametric estimates of a density function.
The Annals of Mathematical Statistics, pages 832–837, 1956.

[Rossetti and Cazabet, 2018]
Giulio Rossetti and Rémy Cazabet.
Community discovery in dynamic networks: a survey.
ACM Computing Surveys (CSUR), 510 (2):0 35,

[Rossetti et al., 2011]
Giulio Rossetti, Michele Berlingerio, and Fosca Giannotti.
Scalable link prediction on multidimensional networks.
In 2011 IEEE 11th International Conference on Data Mining
Workshops, pages 979–986. IEEE, 2011.

[Rossetti et al., 2017]
Giulio Rossetti, Luca Pappalardo, Dino Pedreschi, and Fosca Giannotti.
Tiles: an online algorithm for community discovery in dynamic social
Machine Learning, 1060 (8):0 1213–1241, 2017.

[Rossetti et al., 2018]
Giulio Rossetti, Letizia Milli, Salvatore Rinzivillo, Alina Sîrbu, Dino
Pedreschi, and Fosca Giannotti.
Ndlib: a python library to model and analyze diffusion processes over
complex networks.
International Journal of Data Science and Analytics,
50 (1):0 61–79, 2018.

[Rossetti et al., 2019]
Giulio Rossetti, Letizia Milli, and Rémy Cazabet.
Cdlib: a python library to extract, compare and evaluate communities
from complex networks.
Applied Network Science, 40 (1):0 52, 2019.

[Rosvall and Bergstrom, 2008]
Martin Rosvall and Carl T Bergstrom.
Maps of random walks on complex networks reveal community structure.
Proceedings of the National Academy of Sciences, 1050
(4):0 1118–1123, 2008.

[Rosvall and Bergstrom, 2011]
Martin Rosvall and Carl T Bergstrom.
Multilevel compression of random walks on networks reveals
hierarchical organization in large integrated systems.
PloS one, 60 (4):0 e18209, 2011.

[Rosvall et al., 2014]
Martin Rosvall, Alcides V Esquivel, Andrea Lancichinetti, Jevin D West, and
Renaud Lambiotte.
Memory in network flows and its effects on spreading dynamics and
community detection.
Nature communications, 5:0 4630, 2014.

[Roweis and Saul, 2000]
Sam T Roweis and Lawrence K Saul.
Nonlinear dimensionality reduction by locally linear embedding.
Science, 2900 (5500):0 2323–2326, 2000.

[Roxana Pamfil et al., 2019]
A. Roxana Pamfil, Sam D. Howison, and Mason A. Porter.
Edge correlations in multilayer networks.
arXiv preprint arXiv:1908.03875, 2019.

[Roy, 1959]
Bernard Roy.
Transitivité et connexité.
Comptes Rendus Hebdomadaires Des Seances De L Academie Des
Sciences, 2490 (2):0 216–218, 1959.

[Rubner et al., 2000]
Yossi Rubner, Carlo Tomasi, and Leonidas J Guibas.
The earth mover's distance as a metric for image retrieval.
International journal of computer vision, 400
(2):0 99–121, 2000.

[Runwal et al., 2012]
Neha Runwal, Richard M Low, and Mark Stamp.
Opcode graph similarity and metamorphic detection.
Journal in computer virology, 80 (1-2):0
37–52, 2012.

[Sailer and McCulloh, 2012]
Kerstin Sailer and Ian McCulloh.
Social networks and spatial configuration—how office layouts drive
social interaction.
Social networks, 340 (1):0 47–58, 2012.

[Sales-Pardo et al., 2007]
Marta Sales-Pardo, Roger Guimera, André A Moreira, and Luís A Nunes
Extracting the hierarchical organization of complex systems.
Proceedings of the National Academy of Sciences, 1040
(39):0 15224–15229, 2007.

[Salganik and Heckathorn, 2004]
Matthew J Salganik and Douglas D Heckathorn.
Sampling and estimation in hidden populations using respondent-driven
Sociological methodology, 340 (1):0 193–240,

[Salnikov et al., 2018]
Vsevolod Salnikov, Daniele Cassese, and Renaud Lambiotte.
Simplicial complexes and complex systems.
European Journal of Physics, 400 (1):0 014001,

[Sandryhaila and Moura, 2014]
Aliaksei Sandryhaila and Jose MF Moura.
Discrete signal processing on graphs: Frequency analysis.
IEEE Trans. Signal Processing, 620 (12):0
3042–3054, 2014.

[Saracco et al., 2017]
Fabio Saracco, Mika J Straka, Riccardo Di Clemente, Andrea Gabrielli, Guido
Caldarelli, and Tiziano Squartini.
Inferring monopartite projections of bipartite networks: an
entropy-based approach.
New Journal of Physics, 190 (5):0 053022,

[Saramäki et al., 2007]
Jari Saramäki, Mikko Kivelä, Jukka-Pekka Onnela, Kimmo Kaski, and Janos
Generalizations of the clustering coefficient to weighted complex
Physical Review E, 750 (2):0 027105, 2007.

[Saraph and Milenković, 2014]
Vikram Saraph and Tijana Milenković.
Magna: maximizing accuracy in global network alignment.
Bioinformatics, 300 (20):0 2931–2940, 2014.

[Satuluri and Parthasarathy, 2009]
Venu Satuluri and Srinivasan Parthasarathy.
Scalable graph clustering using stochastic flows: applications to
community discovery.
In SIGKDD conference, pages 737–746. ACM, 2009.

[Satuluri et al., 2011]
Venu Satuluri, Srinivasan Parthasarathy, and Yiye Ruan.
Local graph sparsification for scalable clustering.
In Proceedings of the 2011 ACM SIGMOD International Conference
on Management of data, pages 721–732, 2011.

[Scannell et al., 1999]
JW Scannell, GAPC Burns, CC Hilgetag, MA O'Neil, and Malcolm P Young.
The connectional organization of the cortico-thalamic system of the
Cerebral Cortex, 90 (3):0 277–299, 1999.

[Scarselli et al., 2008]
Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele
The graph neural network model.
IEEE Transactions on Neural Networks, 200
(1):0 61–80, 2008.

[Scellato et al., 2011]
Salvatore Scellato, Anastasios Noulas, Renaud Lambiotte, and Cecilia Mascolo.
Socio-spatial properties of online location-based social networks.
In ICWSM, 2011.

[Schaeffer, 2007]
Satu Elisa Schaeffer.
Graph clustering.
Computer science review, 10 (1):0 27–64,

[Schaub et al., 2012]
Michael T Schaub, Jean-Charles Delvenne, Sophia N Yaliraki, and Mauricio
Markov dynamics as a zooming lens for multiscale community detection:
non clique-like communities and the field-of-view limit.
PloS one, 70 (2):0 e32210, 2012a.

[Schaub et al., 2012]
Michael T Schaub, Renaud Lambiotte, and Mauricio Barahona.
Encoding dynamics for multiscale community detection: Markov time
sweeping for the map equation.
Physical Review E, 860 (2):0 026112,

[Schaub et al., 2019]
Michael T Schaub, Jean-Charles Delvenne, Renaud Lambiotte, and Mauricio
Structured networks and coarse-grained descriptions: A dynamical
Advances in Network Clustering and Blockmodeling, pages
333–361, 2019.

[Schein and Fohrman, 1955]
Martin W Schein and Milton H Fohrman.
Social dominance relationships in a herd of dairy cattle.
The British Journal of Animal Behaviour, 30
(2):0 45–55, 1955.

[Schelling, 1973]
Thomas C Schelling.
Hockey helmets, concealed weapons, and daylight saving: A study of
binary choices with externalities.
Journal of Conflict resolution, 170 (3):0
381–428, 1973.

[Schich, 2010]
Maximilian Schich.
Revealing matrices.

[Schich, 2019]
Maximilian Schich.
Cultural analysis situs.

[Schich et al., 2014]
Maximilian Schich, Chaoming Song, Yong-Yeol Ahn, Alexander Mirsky, Mauro
Martino, Albert-László Barabási, and Dirk Helbing.
A network framework of cultural history.
science, 3450 (6196):0 558–562, 2014.

[Schlichtkrull et al., 2018]
Michael Schlichtkrull, Thomas N Kipf, Peter Bloem, Rianne Van Den Berg, Ivan
Titov, and Max Welling.
Modeling relational data with graph convolutional networks.
In European Semantic Web Conference, pages 593–607. Springer,

[Schuetz and Caflisch, 2008]
Philipp Schuetz and Amedeo Caflisch.
Efficient modularity optimization by multistep greedy algorithm and
vertex mover refinement.
Physical Review E, 770 (4):0 046112, 2008.

[Schulz et al., 2016]
Christoph Schulz, Arlind Nocaj, Jochen Goertler, Oliver Deussen, Ulrik Brandes,
and Daniel Weiskopf.
Probabilistic graph layout for uncertain network visualization.
IEEE transactions on visualization and computer graphics,
230 (1):0 531–540, 2016.

[Seeley, 1949]
John R Seeley.
The net of reciprocal influence. a problem in treating sociometric
Canadian Journal of Experimental Psychology, 3:0 234,

[Seidman, 1983]
Stephen B Seidman.
Network structure and minimum degree.
Social networks, 50 (3):0 269–287, 1983.

[Sen et al., 2008]
Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Gallagher,
and Tina Eliassi-Rad.
Collective classification in network data.
AI magazine, 290 (3):0 93–93, 2008.

[Serrano et al., 2008]
M Angeles Serrano, Dmitri Krioukov, and Marián Boguná.
Self-similarity of complex networks and hidden metric spaces.
Physical review letters, 1000 (7):0 078701,

[Serrano et al., 2009]
M Ángeles Serrano, Marián Boguná, and Alessandro Vespignani.
Extracting the multiscale backbone of complex weighted networks.
Proceedings of the national academy of sciences, 1060
(16):0 6483–6488, 2009.

[Shah et al., 2015]
Neil Shah, Danai Koutra, Tianmin Zou, Brian Gallagher, and Christos Faloutsos.
Timecrunch: Interpretable dynamic graph summarization.
In Proceedings of the 21th ACM SIGKDD International Conference
on Knowledge Discovery and Data Mining, pages 1055–1064, 2015.

[Shang et al., 2010]
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu Yu, and Wei Wang.
Connected substructure similarity search.
In Proceedings of the 2010 ACM SIGMOD International Conference
on Management of data, pages 903–914, 2010.

[Shannon et al., 2003]
Paul Shannon, Andrew Markiel, Owen Ozier, Nitin S Baliga, Jonathan T Wang,
Daniel Ramage, Nada Amin, Benno Schwikowski, and Trey Ideker.
Cytoscape: a software environment for integrated models of
biomolecular interaction networks.
Genome research, 130 (11):0 2498–2504, 2003.

[Shao et al., 2017]
Chengcheng Shao, Giovanni Luca Ciampaglia, Onur Varol, Alessandro Flammini, and
Filippo Menczer.
The spread of fake news by social bots.
arXiv, pages 96–104, 2017.

[Shao et al., 2011]
Jia Shao, Sergey V Buldyrev, Shlomo Havlin, and H Eugene Stanley.
Cascade of failures in coupled network systems with multiple
support-dependence relations.
Phys. Rev. E, 83:0 036116, Mar 2011.

[Shen et al., 2009]
Hua-Wei Shen, Xue-Qi Cheng, and Jia-Feng Guo.
Quantifying and identifying the overlapping community structure in
Journal of Statistical Mechanics: Theory and Experiment,
20090 (07):0 P07042, 2009.

[Shen et al., 2006]
Zeqian Shen, Kwan-Liu Ma, and Tina Eliassi-Rad.
Visual analysis of large heterogeneous social networks by semantic
and structural abstraction.
IEEE transactions on visualization and computer graphics,
120 (6):0 1427–1439, 2006.

[Shen-Orr et al., 2002]
Shai S Shen-Orr, Ron Milo, Shmoolik Mangan, and Uri Alon.
Network motifs in the transcriptional regulation network of
escherichia coli.
Nature genetics, 310 (1):0 64, 2002.

[Shi and Malik, 2000]
Jianbo Shi and Jitendra Malik.
Normalized cuts and image segmentation.
Departmental Papers (CIS), page 107, 2000.

[Shi et al., 2018]
Yu Shi, Qi Zhu, Fang Guo, Chao Zhang, and Jiawei Han.
Easing embedding learning by comprehensive transcription of
heterogeneous information networks.
In Proceedings of the 24th ACM SIGKDD International Conference
on Knowledge Discovery & Data Mining, pages 2190–2199, 2018.

[Shneiderman, 1996]
Ben Shneiderman.
The eyes have it: A task by data type taxonomy for information
In Proceedings 1996 IEEE symposium on visual languages, pages
336–343. IEEE, 1996.

[Shuman et al., 2013]
David Shuman, Sunil Narang, Pascal Frossard, Antonio Ortega, and Pierre
The emerging field of signal processing on graphs: Extending
high-dimensional data analysis to networks and other irregular domains.
IEEE Signal Processing Magazine, 30 (30):0
83–98, 2013.

[Shuman et al., 2016]
David I Shuman, Benjamin Ricaud, and Pierre Vandergheynst.
Vertex-frequency analysis on graphs.
Applied and Computational Harmonic Analysis, 400
(2):0 260–291, 2016.

[Sierksma and Hoogeveen, 1991]
Gerard Sierksma and Han Hoogeveen.
Seven criteria for integer sequences being graphic.
Journal of Graph theory, 150 (2):0 223–231,

[Silva et al., 2012]
Arlei Silva, Wagner Meira Jr, and Mohammed J Zaki.
Mining attribute-structure correlated patterns in large attributed
Proceedings of the VLDB Endowment, 50 (5):0
466–477, 2012.

[Silva et al., 2011]
Samuel Silva, Beatriz Sousa Santos, and Joaquim Madeira.
Using color in visualization: A survey.
Computers & Graphics, 350 (2):0 320–333,

[Simini et al., 2012]
Filippo Simini, Marta C González, Amos Maritan, and Albert-László
A universal model for mobility and migration patterns.
Nature, 4840 (7392):0 96–100, 2012.

[Simon, 1957]
Herbert A Simon.
Models of man; social and rational.

[Sinatra et al., 2016]
Roberta Sinatra, Dashun Wang, Pierre Deville, Chaoming Song, and
Albert-László Barabási.
Quantifying the evolution of individual scientific impact.
Science, 3540 (6312):0 aaf5239, 2016.

[Sinkhorn, 1964]
Richard Sinkhorn.
A relationship between arbitrary positive matrices and doubly
stochastic matrices.
The annals of mathematical statistics, 350
(2):0 876–879, 1964.

[Sinkhorn and Knopp, 1967]
Richard Sinkhorn and Paul Knopp.
Concerning nonnegative matrices and doubly stochastic matrices.
Pacific Journal of Mathematics, 210 (2):0
343–348, 1967.

[Slater, 2009]
Paul B Slater.
A two-stage algorithm for extracting the multiscale backbone of
complex weighted networks.
Proceedings of the National Academy of Sciences, 1060
(26):0 E66–E66, 2009.

[Smirnov, 1948]
Nickolay Smirnov.
Table for estimating the goodness of fit of empirical distributions.
The annals of mathematical statistics, 190
(2):0 279–281, 1948.

[Smith, 1776]
Adam Smith.
The Wealth of Nations.

[Smith et al., 2016]
Laura M Smith, Linhong Zhu, Kristina Lerman, and Allon G Percus.
Partitioning networks with node attributes by compressing information
ACM Transactions on Knowledge Discovery from Data (TKDD),
110 (2):0 15, 2016.

[Snape et al., 2011]
Jamie Snape, Jur Van Den Berg, Stephen J Guy, and Dinesh Manocha.
The hybrid reciprocal velocity obstacle.
IEEE Transactions on Robotics, 270 (4):0
696–706, 2011.

[Snijders, 2002]
Tom AB Snijders.
Markov chain monte carlo estimation of exponential random graph
Journal of Social Structure, 30 (2):0 1–40,

[Snijders et al., 2006]
Tom AB Snijders, Philippa E Pattison, Garry L Robins, and Mark S Handcock.
New specifications for exponential random graph models.
Sociological methodology, 360 (1):0 99–153,

[Snijders et al., 2010]
Tom AB Snijders, Gerhard G Van de Bunt, and Christian EG Steglich.
Introduction to stochastic actor-based models for network dynamics.
Social networks, 320 (1):0 44–60, 2010.

[Solomon et al., 2016]
Justin Solomon, Raif Rustamov, Leonidas Guibas, and Adrian Butscher.
Continuous-flow graph transportation distances.
arXiv preprint arXiv:1603.06927, 2016.

[Song et al., 2005]
Chaoming Song, Shlomo Havlin, and Hernan A Makse.
Self-similarity of complex networks.
Nature, 4330 (7024):0 392–395, 2005.

[Song et al., 2010]
Chaoming Song, Zehui Qu, Nicholas Blumm, and Albert-László
Limits of predictability in human mobility.
Science, 3270 (5968):0 1018–1021, 2010.

[Sorlin and Solnon, 2005]
Sébastien Sorlin and Christine Solnon.
Reactive tabu search for measuring graph similarity.
In International Workshop on Graph-Based Representations in
Pattern Recognition, pages 172–182. Springer, 2005.

[Sorrentino et al., 2006]
F Sorrentino, M Di Bernardo, G Huerta Cuellar, and S Boccaletti.
Synchronization in weighted scale-free networks with degree–degree
Physica D: nonlinear phenomena, 2240 (1-2):0
123–129, 2006.

[Soundarajan et al., 2016]
Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher, and Ali Pinar.
Maxreach: Reducing network incompleteness through node probes.
In 2016 IEEE/ACM International Conference on Advances in Social
Networks Analysis and Mining (ASONAM), pages 152–157. IEEE, 2016.

[Soundarajan et al., 2017]
Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher, and Ali Pinar.
$\varepsilon$-wgx: Adaptive edge probing for enhancing incomplete
In Proceedings of the 2017 ACM on Web Science Conference,
pages 161–170. ACM, 2017.

[Spielman and Teng, 2004]
Daniel A Spielman and Shang-Hua Teng.
Nearly-linear time algorithms for graph partitioning, graph
sparsification, and solving linear systems.
In Proceedings of the thirty-sixth annual ACM symposium on
Theory of computing, pages 81–90, 2004.

[Sporns et al., 2005]
Olaf Sporns, Giulio Tononi, and Rolf Kötter.
The human connectome: a structural description of the human brain.
PLoS computational biology, 10 (4), 2005.

[Stanley et al., 2016]
Natalie Stanley, Saray Shai, Dane Taylor, and Peter J Mucha.
Clustering network layers with the strata multilayer stochastic block
IEEE transactions on network science and engineering,
30 (2):0 95–105, 2016.

[Stauffer and Aharony, 2014]
Dietrich Stauffer and Ammon Aharony.
Introduction to percolation theory.
Taylor & Francis, 2014.

[Stehlé et al., 2013]
Juliette Stehlé, François Charbonnier, Tristan Picard, Ciro Cattuto,
and Alain Barrat.
Gender homophily from spatial behavior in a primary school: a
sociometric study.
Social Networks, 350 (4):0 604–613, 2013.

[Stehman, 1997]
Stephen V Stehman.
Selecting and interpreting measures of thematic classification
Remote sensing of Environment, 620 (1):0
77–89, 1997.

[Steinhaus, 1956]
Hugo Steinhaus.
Sur la division des corp materiels en parties.
Bull. Acad. Polon. Sci, 10 (804):0 801, 1956.

[Stiffler and O'Kane, 2016]
Nicholas M Stiffler and Jason M O'Kane.
Pursuit-evasion with fixed beams.
In 2016 IEEE International Conference on Robotics and
Automation (ICRA), pages 4251–4258. IEEE, 2016.

[Strang, 1993]
Gilbert Strang.
Introduction to linear algebra.
Wellesley-Cambridge Press Wellesley, MA, 1993.

[Strehl and Ghosh, 2002]
Alexander Strehl and Joydeep Ghosh.
Cluster ensembles—a knowledge reuse framework for combining
multiple partitions.
Journal of machine learning research, 30
(Dec):0 583–617, 2002.

[Stumpf and Porter, 2012]
Michael PH Stumpf and Mason A Porter.
Critical truths about power laws.
Science, 3350 (6069):0 665–666, 2012.

[Stutzbach et al., 2006]
Daniel Stutzbach, Reza Rejaie, Nick Duffield, Subhabrata Sen, and Walter
Sampling techniques for large, dynamic graphs.
In Proceedings IEEE INFOCOM 2006. 25TH IEEE International
Conference on Computer Communications, pages 1–6. IEEE, 2006.

[Stutzbach et al., 2009]
Daniel Stutzbach, Reza Rejaie, Nick Duffield, Subhabrata Sen, and Walter
On unbiased sampling for unstructured peer-to-peer networks.
IEEE/ACM Transactions on Networking (TON), 170
(2):0 377–390, 2009.

[Šubelj, 2018]
Lovro Šubelj.
Convex skeletons of complex networks.
Journal of The Royal Society Interface, 150
(145):0 20180422, 2018.

[Šubelj and Bajec, 2011]
Lovro Šubelj and Marko Bajec.
Robust network community detection using balanced propagation.
The European Physical Journal B, 810 (3):0
353–362, 2011.

[Sun et al., 2017]
Jiankai Sun, Deepak Ajwani, Patrick K Nicholson, Alessandra Sala, and
Srinivasan Parthasarathy.
Breaking cycles in noisy hierarchies.
In Proceedings of the 2017 ACM on Web Science Conference,
pages 151–160. ACM, 2017.

[Sun et al., 2007]
Jimeng Sun, Christos Faloutsos, Spiros Papadimitriou, and Philip S Yu.
Graphscope: parameter-free mining of large time-evolving graphs.
In SIGKDD, pages 687–696. ACM, 2007a.

[Sun et al., 2007]
Jimeng Sun, Yinglian Xie, Hui Zhang, and Christos Faloutsos.
Less is more: Compact matrix decomposition for large sparse graphs.
In Proceedings of the 2007 SIAM International Conference on
Data Mining, pages 366–377. SIAM, 2007b.

[Sun and Han, 2013]
Yizhou Sun and Jiawei Han.
Mining heterogeneous information networks: a structural analysis
Acm Sigkdd Explorations Newsletter, 140 (2):0
20–28, 2013.

[Sun et al., 2010]
Yizhou Sun, Jie Tang, Jiawei Han, Manish Gupta, and Bo Zhao.
Community evolution detection in dynamic heterogeneous information
In MLGraphs, pages 137–146. ACM, 2010.

[Sun et al., 2011]
Yizhou Sun, Rick Barber, Manish Gupta, Charu C Aggarwal, and Jiawei Han.
Co-author relationship prediction in heterogeneous bibliographic
In 2011 International Conference on Advances in Social Networks
Analysis and Mining, pages 121–128. IEEE, 2011.

[Sun et al., 2012]
Yizhou Sun, Jiawei Han, Charu C Aggarwal, and Nitesh V Chawla.
When will it happen?: relationship prediction in heterogeneous
information networks.
In Proceedings of the fifth ACM international conference on Web
search and data mining, pages 663–672. ACM, 2012.

[Sundaresan et al., 2007]
Siva R Sundaresan, Ilya R Fischhoff, Jonathan Dushoff, and Daniel I Rubenstein.
Network metrics reveal differences in social organization between two
fission–fusion species, grevy’s zebra and onager.
Oecologia, 1510 (1):0 140–149, 2007.

[Sweeney, 2002]
Latanya Sweeney.
k-anonymity: A model for protecting privacy.
International Journal of Uncertainty, Fuzziness and
Knowledge-Based Systems, 100 (05):0 557–570, 2002.

[Sweet et al., 2014]
Tracy M Sweet, Andrew C Thomas, and Brian W Junker.
Hierarchical mixed membership stochastic blockmodels for multiple
networks and experimental interventions.
Handbook on mixed membership models and their applications,
pages 463–488, 2014.

[Szafir, 2017]
Danielle Albers Szafir.
Modeling color difference for visualization design.
IEEE transactions on visualization and computer graphics,
240 (1):0 392–401, 2017.

[Szekely and Rizzo, 2005]
Gabor J Szekely and Maria L Rizzo.
Hierarchical clustering via joint between-within distances: Extending
ward's minimum variance method.
Journal of classification, 220 (2):0 151–183,

[Szell et al., 2010]
Michael Szell, Renaud Lambiotte, and Stefan Thurner.
Multirelational organization of large-scale social networks in an
online world.
Proceedings of the National Academy of Sciences, 1070
(31):0 13636–13641, 2010.

[Tagarelli et al., 2017]
Andrea Tagarelli, Alessia Amelio, and Francesco Gullo.
Ensemble-based community detection in multilayer networks.
Data Mining and Knowledge Discovery, 310 (5):0
1506–1543, 2017.

[Taleb, 2007]
Nassim Nicholas Taleb.
The black swan: The impact of the highly improbable, volume 2.
Random house, 2007.

[Tan et al., 2014]
Fei Tan, Yongxiang Xia, and Boyao Zhu.
Link prediction in complex networks: a mutual information
PloS one, 90 (9):0 e107056, 2014.

[Tang et al., 2015]
Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei.
Line: Large-scale information network embedding.
In Proceedings of the 24th international conference on world
wide web, pages 1067–1077. International World Wide Web Conferences
Steering Committee, 2015a.

[Tang et al., 2016]
Jian Tang, Jingzhou Liu, Ming Zhang, and Qiaozhu Mei.
Visualizing large-scale and high-dimensional data.
In WWW, pages 287–297, 2016.

[Tang et al., 2015]
Jiliang Tang, Shiyu Chang, Charu Aggarwal, and Huan Liu.
Negative link prediction in social media.
In Proceedings of the eighth ACM international conference on
web search and data mining, pages 87–96. ACM, 2015b.

[Tang et al., 2008]
Lei Tang, Huan Liu, Jianping Zhang, and Zohreh Nazeri.
Community evolution in dynamic multi-mode networks.
In SIGKDD, pages 677–685. ACM, 2008.

[Tang et al., 2012]
Lei Tang, Xufei Wang, and Huan Liu.
Community detection via heterogeneous interaction analysis.
Data mining and knowledge discovery, 250 (1):0
1–33, 2012.

[Tao et al., 2017]
Jun Tao, Jian Xu, Chaoli Wang, and Nitesh V Chawla.
Honvis: Visualizing and exploring higher-order networks.
In 2017 IEEE Pacific Visualization Symposium (PacificVis),
pages 1–10. IEEE, 2017.

[Tarjan, 1972]
Robert Tarjan.
Depth-first search and linear graph algorithms.
SIAM journal on computing, 10 (2):0 146–160,

[Tarrés-Deulofeu et al., 2019]
Marc Tarrés-Deulofeu, Antonia Godoy-Lorite, Roger Guimera, and Marta
Tensorial and bipartite block models for link prediction in layered
networks and temporal networks.
Physical Review E, 990 (3):0 032307, 2019.

[Tatti, 2015]
Nikolaj Tatti.
Hierarchies in directed networks.
In 2015 IEEE international conference on data mining, pages
991–996. IEEE, 2015.

[Taylor et al., 2016]
Dane Taylor, Saray Shai, Natalie Stanley, and Peter J Mucha.
Enhanced detectability of community structure in multilayer networks
through layer aggregation.
Physical review letters, 1160 (22):0 228301,

[Thorup, 2000]
Mikkel Thorup.
On ram priority queues.
SIAM Journal on Computing, 300 (1):0 86–109,

[Tian et al., 2008]
Yuanyuan Tian, Richard A Hankins, and Jignesh M Patel.
Efficient aggregation for graph summarization.
In Proceedings of the 2008 ACM SIGMOD international conference
on Management of data, pages 567–580, 2008.

[Tisue and Wilensky, 2004]
Seth Tisue and Uri Wilensky.
Netlogo: A simple environment for modeling complexity.
In International conference on complex systems, volume 21,
pages 16–21. Boston, MA, 2004.

[Tizzoni et al., 2014]
Michele Tizzoni, Paolo Bajardi, Adeline Decuyper, Guillaume Kon Kam King,
Christian M Schneider, Vincent Blondel, Zbigniew Smoreda, Marta C
González, and Vittoria Colizza.
On the use of human mobility proxies for modeling epidemics.
PLoS computational biology, 100 (7), 2014.

[Toivonen et al., 2011]
Hannu Toivonen, Fang Zhou, Aleksi Hartikainen, and Atte Hinkka.
Compression of weighted graphs.
In Proceedings of the 17th ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 965–973, 2011.

[Tong et al., 2010]
Hanghang Tong, B Aditya Prakash, Charalampos Tsourakakis, Tina Eliassi-Rad,
Christos Faloutsos, and Duen Horng Chau.
On the vulnerability of large graphs.
In 2010 IEEE International Conference on Data Mining, pages
1091–1096. IEEE, 2010.

[Toole et al., 2015]
Jameson L Toole, Carlos Herrera-Yaqüe, Christian M Schneider, and Marta C
Coupling human mobility and social ties.
Royal Society Interface, 120 (105):0 20141128,

[Torres et al., 2019]
Leo Torres, Pablo Suárez-Serrato, and Tina Eliassi-Rad.
Non-backtracking cycles: length spectrum theory and graph mining
Applied Network Science, 40 (1):0 41, 2019.

[Traag and Bruggeman, 2009]
Vincent A Traag and Jeroen Bruggeman.
Community detection in networks with positive and negative links.
Physical Review E, 800 (3):0 036115, 2009.

[Trouillon et al., 2016]
Théo Trouillon, Johannes Welbl, Sebastian Riedel, Éric Gaussier, and
Guillaume Bouchard.
Complex embeddings for simple link prediction.
International Conference on Machine Learning (ICML), 2016.

[Trung et al., 2020]
Huynh Thanh Trung, Nguyen Thanh Toan, Tong Van Vinh, Hoang Thanh Dat, Duong Chi
Thang, Nguyen Quoc Viet Hung, and Abdul Sattar.
A comparative study on network alignment techniques.
Expert Systems with Applications, 140:0 112883, 2020.

[Tsugawa and Ohsaki, 2020]
Sho Tsugawa and Hiroyuki Ohsaki.
Benefits of bias in crawl-based network sampling for identifying key
node set.
IEEE Access, 8:0 75370–75380, 2020.

[Tucker, 1966]
Ledyard R Tucker.
Some mathematical notes on three-mode factor analysis.
Psychometrika, 310 (3):0 279–311, 1966.

[Tufte and Graves-Morris, 2014]
Edward Tufte and P Graves-Morris.
The visual display of quantitative information.; 1983, 2014.

[Tumminello et al., 2005]
Michele Tumminello, Tomaso Aste, Tiziana Di Matteo, and Rosario N Mantegna.
A tool for filtering information in complex systems.
Proceedings of the National Academy of Sciences, 1020
(30):0 10421–10426, 2005.

[Tumminello et al., 2011]
Michele Tumminello, Salvatore Micciche, Fabrizio Lillo, Jyrki Piilo, and
Rosario N Mantegna.
Statistically validated networks in bipartite complex systems.
PloS one, 60 (3):0 e17994, 2011.

[Uetz et al., 2000]
Peter Uetz, Loic Giot, Gerard Cagney, Traci A Mansfield, Richard S Judson,
James R Knight, Daniel Lockshon, Vaibhav Narayan, Maithreyan Srinivasan,
Pascale Pochart, et al.
A comprehensive analysis of protein–protein interactions in
saccharomyces cerevisiae.
Nature, 4030 (6770):0 623, 2000.

[Valdano et al., 2015]
Eugenio Valdano, Luca Ferreri, Chiara Poletto, and Vittoria Colizza.
Analytical computation of the epidemic threshold on temporal
Physical Review X, 50 (2):0 021005, 2015.

[Van de Bunt et al., 1999]
Gerhard G Van de Bunt, Marijtje AJ Van Duijn, and Tom AB Snijders.
Friendship networks through time: An actor-oriented dynamic
statistical network model.
Computational & Mathematical Organization Theory, 50
(2):0 167–192, 1999.

[Van Duijn et al., 2004]
Marijtje AJ Van Duijn, Tom AB Snijders, and Bonne JH Zijlstra.
p2: a random effects model with covariates for directed graphs.
Statistica Neerlandica, 580 (2):0 234–254,

[Vatn, 1992]
Jørn Vatn.
Finding minimal cut sets in a fault tree.
Reliability Engineering & System Safety, 360
(1):0 59–62, 1992.

[Vazquez et al., 2004]
A Vazquez, R Dobrin, D Sergi, J-P Eckmann, ZN Oltvai, and A-L Barabási.
The topological relationship between the large-scale attributes and
local interaction patterns of complex networks.
Proceedings of the National Academy of Sciences, 1010
(52):0 17940–17945, 2004.

[Vázquez and Moreno, 2003]
Alexei Vázquez and Yamir Moreno.
Resilience to damage of graphs with degree correlations.
Phys. Rev. E, 67:0 015101, Jan 2003.

[Veličković et al., 2018]
Petar Veličković, William Fedus, William L Hamilton, Pietro Liò,
Yoshua Bengio, and R Devon Hjelm.
Deep graph infomax.
arXiv preprint arXiv:1809.10341, 2018.

[Viard et al., 2016]
Tiphaine Viard, Matthieu Latapy, and Clémence Magnien.
Computing maximal cliques in link streams.
Theoretical Computer Science, 609:0 245–252, 2016.

[Vinh et al., 2010]
Nguyen Xuan Vinh, Julien Epps, and James Bailey.
Information theoretic measures for clusterings comparison: Variants,
properties, normalization and correction for chance.
J. Mach. Learn. Res, 110 (Oct):0 2837–2854,

[Virtanen et al., 2020]
Pauli Virtanen, Ralf Gommers, Travis E Oliphant, Matt Haberland, Tyler Reddy,
David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan
Bright, et al.
Scipy 1.0: fundamental algorithms for scientific computing in python.
Nature methods, pages 1–12, 2020.

[Vishwanathan et al., 2006]
SVN Vishwanathan, Karsten M Borgwardt, Nicol N Schraudolph, et al.
Fast computation of graph kernels.
In NIPS, volume 19, pages 131–138, 2006.

[Voitalov et al., 2018]
Ivan Voitalov, Pim van der Hoorn, Remco van der Hofstad, and Dmitri Krioukov.
Scale-free networks well done.
arXiv preprint arXiv:1811.02071, 2018.

[Voloshin, 2009]
Vitaly Ivanovich Voloshin.
Introduction to graph and hypergraph theory.
Nova Science Publishers Hauppauge, 2009.

[Von Luxburg, 2007]
Ulrike Von Luxburg.
A tutorial on spectral clustering.
Statistics and computing, 170 (4):0 395–416,

[von Neumann, 1945]
John von Neumann.
First draft of a report on the edvac.

[Vosoughi et al., 2018]
Soroush Vosoughi, Deb Roy, and Sinan Aral.
The spread of true and false news online.
Science, 3590 (6380):0 1146–1151, 2018.

[Wagner et al., 2015]
Claudia Wagner, David Garcia, Mohsen Jadidi, and Markus Strohmaier.
It's a man's wikipedia? assessing gender inequality in an online
In Ninth international AAAI conference on web and social
media, 2015.

[Wagner et al., 2016]
Claudia Wagner, Eduardo Graells-Garrido, David Garcia, and Filippo Menczer.
Women through the glass ceiling: gender asymmetries in wikipedia.
EPJ Data Science, 50 (1):0 5, 2016.

[Wagner and Choset, 2015]
Glenn Wagner and Howie Choset.
Subdimensional expansion for multirobot path planning.
Artificial Intelligence, 219:0 1–24, 2015.

[Walker et al., 2017]
Thayne T Walker, David M Chan, and Nathan R Sturtevant.
Using hierarchical constraints to avoid conflicts in multi-agent
In Int Conf on Automated Planning and Scheduling, 2017.

[Walker et al., 2018]
Thayne T Walker, Nathan R Sturtevant, and Ariel Felner.
Extended increasing cost tree search for non-unit cost domains.
In IJCAI, pages 534–540, 2018.

[Wallace, 1858]
AR Wallace.
On the tendency of varieties to depart indefinitely from the original
J. Linn. Soc. Lond. Zool., 3:0 53–62, 1858.

[Wang et al., 2014]
Bo Wang, Aziz M Mezlini, Feyyaz Demir, Marc Fiume, Zhuowen Tu, Michael Brudno,
Benjamin Haibe-Kains, and Anna Goldenberg.
Similarity network fusion for aggregating data types on a genomic
Nature methods, 110 (3):0 333,

[Wang et al., 2016]
Daixin Wang, Peng Cui, and Wenwu Zhu.
Structural deep network embedding.
In Proceedings of the 22nd ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 1225–1234,

[Wang et al., 2012]
Dan J Wang, Xiaolin Shi, Daniel A McFarland, and Jure Leskovec.
Measurement error in network data: A re-classification.
Social Networks, 340 (4):0 396–409,

[Wang et al., 2011]
Dashun Wang, Dino Pedreschi, Chaoming Song, Fosca Giannotti, and Albert-Laszlo
Human mobility, social ties, and link prediction.
In SIGKDD, pages 1100–1108. Acm, 2011a.

[Wang et al., 2011]
Dashun Wang, Zhen Wen, Hanghang Tong, Ching-Yung Lin, Chaoming Song, and
Albert-László Barabási.
Information spreading in context.
In Proceedings of the 20th international conference on World
wide web, pages 735–744. ACM, 2011b.

[Wang et al., 2013]
Dashun Wang, Chaoming Song, and Albert-László Barabási.
Quantifying long-term scientific impact.
Science, 3420 (6154):0 127–132, 2013.

[Wang et al., 2008]
Liping Wang, Qing Li, Na Li, Guozhu Dong, and Yu Yang.
Substructure similarity measurement in chinese recipes.
In Proceedings of the 17th international conference on World
Wide Web, pages 979–988, 2008a.

[Wang et al., 2015]
Peng Wang, BaoWen Xu, YuRong Wu, and XiaoYu Zhou.
Link prediction in social networks: the state-of-the-art.
Science China Information Sciences, 580 (1):0
1–38, 2015a.

[Wang et al., 2009]
Pu Wang, Marta C González, César A Hidalgo, and Albert-László
Understanding the spreading patterns of mobile phone viruses.
Science, 3240 (5930):0 1071–1076, 2009.

[Wang et al., 2017]
Quan Wang, Zhendong Mao, Bin Wang, and Li Guo.
Knowledge graph embedding: A survey of approaches and applications.
IEEE Transactions on Knowledge and Data Engineering,
290 (12):0 2724–2743, 2017a.

[Wang et al., 2012]
Quanxin Wang, Olaf Sporns, and Andreas Burkhalter.
Network analysis of corticocortical connections reveals ventral and
dorsal processing streams in mouse visual cortex.
Journal of Neuroscience, 320 (13):0
4386–4399, 2012b.

[Wang et al., 2017]
Suhang Wang, Jiliang Tang, Charu Aggarwal, Yi Chang, and Huan Liu.
Signed network embedding in social media.
In Proceedings of the 2017 SIAM international conference on
data mining, pages 327–335. SIAM, 2017b.

[Wang et al., 2012]
Xiaohong Wang, Jun Huan, Aaron Smalter, and Gerald H Lushington.
G-hash: towards fast kernel-based similarity search in large graph
In Graph Data Management: Techniques and Applications, pages
176–213. IGI Global, 2012c.

[Wang et al., 2003]
Yang Wang, Deepayan Chakrabarti, Chenxi Wang, and Christos Faloutsos.
Epidemic spreading in real networks: An eigenvalue viewpoint.
In 22nd International Symposium on Reliable Distributed
Systems, 2003. Proceedings., pages 25–34. IEEE, 2003.

[Wang et al., 2008]
Yi Wang, Bin Wu, and Xin Pei.
Commtracker: A core-based algorithm of tracking community evolution.
In ADMA, pages 229–240. Springer, 2008b.

[Wang et al., 2016]
Yu-Xiang Wang, James Sharpnack, Alex Smola, and Ryan J Tibshirani.
Trend filtering on graphs.
Journal of Machine Learning Research, 170
(105):0 1–41, 2016b.

[Wang et al., 2014]
Zhen Wang, Jianwen Zhang, Jianlin Feng, and Zheng Chen.
Knowledge graph embedding by translating on hyperplanes.
In Twenty-Eighth AAAI conference on artificial intelligence,

[Wang et al., 2015]
Zhen Wang, Lin Wang, Attila Szolnoki, and Matjaž Perc.
Evolutionary games on multilayer networks: a colloquium.
The European physical journal B, 880 (5):0
124, 2015b.

[Warshall, 1962]
Stephen Warshall.
A theorem on boolean matrices.
Journal of the ACM (JACM), 90 (1):0 11–12,

[Wasserman and Faust, 1994]
Stanley Wasserman and Katherine Faust.
Social network analysis: Methods and applications, volume 8.
Cambridge university press, 1994.

[Watts, 1999]
Duncan J Watts.
Networks, dynamics, and the small-world phenomenon.
American Journal of sociology, 1050 (2):0
493–527, 1999.

[Watts, 2002]
Duncan J Watts.
A simple model of global cascades on random networks.
Proceedings of the National Academy of Sciences, 990
(9):0 5766–5771, 2002.

[Watts, 2004]
Duncan J Watts.
Six degrees: The science of a connected age.
WW Norton & Company, 2004.

[Watts and Strogatz, 1998]
Duncan J Watts and Steven H Strogatz.
Collective dynamics of ‘small-world’networks.
nature, 3930 (6684):0 440, 1998.

[Waxman, 1988]
Bernard M Waxman.
Routing of multipoint connections.
IEEE journal on selected areas in communications, 60
(9):0 1617–1622, 1988.

[Way et al., 2019]
Samuel F Way, Allison C Morgan, Daniel B Larremore, and Aaron Clauset.
Productivity, prominence, and the effects of academic environment.
Proceedings of the National Academy of Sciences, 1160
(22):0 10729–10733, 2019.

[Wegner et al., 2013]
Jan D Wegner, Javier A Montoya-Zegarra, and Konrad Schindler.
A higher-order crf model for road network extraction.
In Proceedings of the IEEE Conference on Computer Vision and
Pattern Recognition, pages 1698–1705, 2013.

[Weinan et al., 2008]
E Weinan, Tiejun Li, and Eric Vanden-Eijnden.
Optimal partition and effective dynamics of complex networks.
Proceedings of the National Academy of Sciences, 1050
(23):0 7907–7912, 2008.

[Weng et al., 2012]
Lilian Weng, Alessandro Flammini, Alessandro Vespignani, and Fillipo Menczer.
Competition among memes in a world with limited attention.
Scientific reports, 2:0 335, 2012.

[Weng et al., 2013]
Lilian Weng, Filippo Menczer, and Yong-Yeol Ahn.
Virality prediction and community structure in social networks.
Scientific reports, 3:0 2522, 2013.

[Weng et al., 2014]
Lilian Weng, Filippo Menczer, and Yong-Yeol Ahn.
Predicting successful memes using network and community structure.
In ICWSM, 2014.

[West et al., 2001]
Douglas Brent West et al.
Introduction to graph theory, volume 2.
Prentice hall Upper Saddle River, 2001.

[Whitney, 1932]
Hassler Whitney.
Congruent graphs and the connectivity of graphs.
American Journal of Mathematics, 540 (1):0
150–168, 1932.

[Wiese et al., 2004]
Roland Wiese, Markus Eiglsperger, and Michael Kaufmann.
yfiles—visualization and automatic layout of graphs.
In Graph Drawing Software, pages 173–191. Springer, 2004.

[Windzio, 2018]
Michael Windzio.
The network of global migration 1990–2013: Using ergms to test
theories of migration between countries.
Social Networks, 53:0 20–29, 2018.

[Wittgenstein, 1921]
Ludwig Wittgenstein.
Tractatus logico-philosophicus, 1921.

[Wong et al., 2006]
Ling Heng Wong, Philippa Pattison, and Garry Robins.
A spatial model for social networks.
Physica A, 3600 (1):0 99–120, 2006.

[Wörlein et al., 2005]
Marc Wörlein, Thorsten Meinl, Ingrid Fischer, and Michael Philippsen.
A quantitative comparison of the subgraph miners mofa, gspan, ffsm,
and gaston.
In European Conference on Principles of Data Mining and
Knowledge Discovery, pages 392–403. Springer, 2005.

[Wu et al., 2019]
Zonghan Wu, Shirui Pan, Fengwen Chen, Guodong Long, Chengqi Zhang, and Philip S
A comprehensive survey on graph neural networks.
arXiv preprint arXiv:1901.00596, 2019.

[Xie et al., 2011]
Jierui Xie, Boleslaw K Szymanski, and Xiaoming Liu.
Slpa: Uncovering overlapping communities in social networks via a
speaker-listener interaction dynamic process.
In 2011 IEEE 11th International Conference on Data Mining
Workshops, pages 344–349. IEEE, 2011.

[Xie et al., 2013]
Jierui Xie, Stephen Kelley, and Boleslaw K Szymanski.
Overlapping community detection in networks: The state-of-the-art and
comparative study.
Acm computing surveys (csur), 450 (4):0 43,

[Xing et al., 2010]
Eric P Xing, Wenjie Fu, Le Song, et al.
A state-space mixed membership blockmodel for dynamic network
The Annals of Applied Statistics, 40 (2):0
535–566, 2010.

[Xu et al., 2016]
Jian Xu, Thanuka L Wickramarathne, and Nitesh V Chawla.
Representing higher-order dependencies in networks.
Science advances, 20 (5):0 e1600028, 2016.

[Xu and Hero, 2013]
Kevin S Xu and Alfred O Hero.
Dynamic stochastic blockmodels: Statistical models for time-evolving
In International conference on social computing,
behavioral-cultural modeling, and prediction, pages 201–210. Springer,

[Xulvi-Brunet and Sokolov, 2005]
R. Xulvi-Brunet and I. M. Sokolov.
Changing Correlations in Networks: Assortativity and
Acta Physica Polonica B, 36:0 1431, 5 2005.

[Xulvi-Brunet and Sokolov, 2004]
Ramon Xulvi-Brunet and Igor M Sokolov.
Reshuffling scale-free networks: From random to assortative.
Physical Review E, 700 (6):0 066102, 2004.

[Yakovlev and Andreychuk, 2017]
Konstantin Yakovlev and Anton Andreychuk.
Any-angle pathfinding for multiple agents based on sipp algorithm.
In Twenty-Seventh International Conference on Automated
Planning and Scheduling, 2017.

[Yan and Gregory, 2009]
Bowen Yan and Steve Gregory.
Detecting communities in networks by merging cliques.
In 2009 IEEE International Conference on Intelligent Computing
and Intelligent Systems, volume 1, pages 832–836. IEEE, 2009.

[Yan et al., 2015]
Gang Yan, Georgios Tsekenis, Baruch Barzel, Jean-Jacques Slotine, Yang-Yu Liu,
and Albert-László Barabási.
Spectrum of controlling and observing complex networks.
Nature Physics, 110 (9):0 779–786, 2015.

[Yan et al., 2018]
Sijie Yan, Yuanjun Xiong, and Dahua Lin.
Spatial temporal graph convolutional networks for skeleton-based
action recognition.
In Thirty-Second AAAI Conference on Artificial Intelligence,

[Yan and Han, 2002]
Xifeng Yan and Jiawei Han.
gspan: Graph-based substructure pattern mining.
In 2002 IEEE International Conference on Data Mining, 2002.
Proceedings., pages 721–724. IEEE, 2002.

[Yan and Han, 2003]
Xifeng Yan and Jiawei Han.
Closegraph: mining closed frequent graph patterns.
In Proceedings of the ninth ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 286–295. ACM, 2003.

[Yan et al., 2005]
Xifeng Yan, Philip S Yu, and Jiawei Han.
Substructure similarity search in graph databases.
In Proceedings of the 2005 ACM SIGMOD international conference
on Management of data, pages 766–777, 2005.

[Yang and Leskovec, 2012]
Jaewon Yang and Jure Leskovec.
Community-affiliation graph model for overlapping network community
In 2012 IEEE 12th international conference on data mining,
pages 1170–1175. IEEE, 2012.

[Yang and Leskovec, 2013]
Jaewon Yang and Jure Leskovec.
Overlapping community detection at scale: a nonnegative matrix
factorization approach.
In Proceedings of the sixth ACM international conference on Web
search and data mining, pages 587–596. ACM, 2013.

[Yang and Leskovec, 2014]
Jaewon Yang and Jure Leskovec.
Overlapping communities explain core–periphery organization of
Proceedings of the IEEE, 1020 (12):0
1892–1902, 2014.

[Yang and Leskovec, 2015]
Jaewon Yang and Jure Leskovec.
Defining and evaluating network communities based on ground-truth.
Knowledge and Information Systems, 420 (1):0
181–213, 2015.

[Yang et al., 2015]
Yang Yang, Ryan N Lichtenwalter, and Nitesh V Chawla.
Evaluating link prediction methods.
Knowledge and Information Systems, 450 (3):0
751–782, 2015.

[Yang et al., 2016]
Zhao Yang, René Algesheimer, and Claudio J Tessone.
A comparative analysis of community detection algorithms on
artificial networks.
Scientific Reports, 6:0 30750, 2016a.

[Yang et al., 2016]
Zhilin Yang, William W Cohen, and Ruslan Salakhutdinov.
Revisiting semi-supervised learning with graph embeddings.
arXiv preprint arXiv:1603.08861, 2016b.

[Yildirim and Coscia, 2014]
Muhammed A Yildirim and Michele Coscia.
Using random walks to generate associations between objects.
PloS one, 90 (8):0 e104813, 2014.

[Yin et al., 2017]
Hao Yin, Austin R Benson, Jure Leskovec, and David F Gleich.
Local higher-order graph clustering.
In Proceedings of the 23rd ACM SIGKDD International Conference
on Knowledge Discovery and Data Mining, pages 555–564. ACM, 2017.

[Yoghourdjian et al., 2018]
Vahan Yoghourdjian, Tim Dwyer, Karsten Klein, Kim Marriott, and Michael Wybrow.
Graph thumbnails: Identifying and comparing multiple graphs at a
IEEE Transactions on Visualization and Computer Graphics,
240 (12):0 3081–3095, 2018.

[Yook et al., 2001]
Soon-Hyung Yook, Hawoong Jeong, A-L Barabási, and Yuhai Tu.
Weighted evolving networks.
Physical review letters, 860 (25):0 5835,

[You et al., 2018]
Jiaxuan You, Rex Ying, Xiang Ren, William Hamilton, and Jure Leskovec.
Graphrnn: Generating realistic graphs with deep auto-regressive
In International Conference on Machine Learning, pages
5694–5703, 2018.

[Youn et al., 2015]
Hyejin Youn, Deborah Strumsky, Luis MA Bettencourt, and José Lobo.
Invention as a combinatorial process: evidence from us patents.
Journal of The Royal Society Interface, 120
(106):0 20150272, 2015.

[Young et al., 2017]
Jean-Gabriel Young, Giovanni Petri, Francesco Vaccarino, and Alice Patania.
Construction of and efficient sampling from the simplicial
configuration model.
Physical Review E, 960 (3):0 032312, 2017.

[Yu et al., 2016]
Amy Zhao Yu, Shahar Ronen, Kevin Hu, Tiffany Lu, and César A Hidalgo.
Pantheon 1.0, a manually verified dataset of globally famous
Scientific data, 3:0 150075, 2016.

[Yu et al., 2018]
Bing Yu, Haoteng Yin, and Zhanxing Zhu.
Spatio-temporal graph convolutional networks: a deep learning
framework for traffic forecasting.
In IJCAI, pages 3634–3640. AAAI Press, 2018.

[Yu and Gerstein, 2006]
Haiyuan Yu and Mark Gerstein.
Genomic analysis of the hierarchical structure of regulatory
Proceedings of the National Academy of Sciences, 1030
(40):0 14724–14731, 2006.

[Yu and Rus, 2015]
Jingjin Yu and Daniela Rus.
Pebble motion on graphs with rotations: Efficient feasibility tests
and planning algorithms.
In Algorithmic Foundations of Robotics XI, pages 729–746.
Springer, 2015.

[Yu et al., 2007]
Kai Yu, Wei Chu, Shipeng Yu, Volker Tresp, and Zhao Xu.
Stochastic relational models for discriminative link prediction.
In Advances in neural information processing systems, pages
1553–1560, 2007.

[Yucesoy and Barabási, 2016]
Burcu Yucesoy and Albert-László Barabási.
Untangling performance from success.
EPJ Data Science, 50 (1):0 17, 2016.

[Zachary, 1977]
Wayne W Zachary.
An information flow model for conflict and fission in small groups.
Journal of anthropological research, 330 (4):0
452–473, 1977.

[Zager and Verghese, 2008]
Laura A Zager and George C Verghese.
Graph similarity scoring and matching.
Applied mathematics letters, 210 (1):0 86–94,

[Zehfuss, 1858]
G Zehfuss.
Über eine gewisse determinante.
Zeitschrift für Mathematik und Physik, 30
(1858):0 298–301, 1858.

[Zeng et al., 2006]
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, and George Karypis.
Coherent closed quasi-clique discovery from large dense graph
In Proceedings of the 12th ACM SIGKDD international conference
on Knowledge discovery and data mining, pages 797–802. ACM, 2006.

[Zhang et al., 2018]
Hongming Zhang, Liwei Qiu, Lingling Yi, and Yangqiu Song.
Scalable multiplex network embedding.
In IJCAI, volume 18, pages 3082–3088, 2018.

[Zhang and Kai, 1998]
Jun Zhang and F Yu Kai.
What's the relative risk?: A method of correcting the odds ratio in
cohort studies of common outcomes.
Jama, 2800 (19):0 1690–1691, 1998.

[Zhang et al., 2007]
Jun Zhang, Mark S Ackerman, and Lada Adamic.
Expertise networks in online communities: structure and algorithms.
In Proceedings of the 16th international conference on World
Wide Web, pages 221–230, 2007a.

[Zhang and Chen, 2018]
Muhan Zhang and Yixin Chen.
Link prediction based on graph neural networks.
In Advances in Neural Information Processing Systems, pages
5165–5175, 2018.

[Zhang et al., 2010]
Ning Zhang, Yuanyuan Tian, and Jignesh M Patel.
Discovery-driven graph summarization.
In ICDE, pages 880–891. IEEE, 2010.

[Zhang and Moore, 2014]
Pan Zhang and Cristopher Moore.
Scalable detection of statistically significant communities and
hierarchies, using message passing for modularity.
Proceedings of the National Academy of Sciences, 1110
(51):0 18144–18149, 2014.

[Zhang et al., 2008]
Peng Zhang, Jinliang Wang, Xiaojia Li, Menghui Li, Zengru Di, and Ying Fan.
Clustering coefficient and community structure of bipartite networks.
Physica A: Statistical Mechanics and its Applications,
3870 (27):0 6869–6875, 2008.

[Zhang et al., 2006]
Shihua Zhang, Xuemei Ning, and Xiang-Sun Zhang.
Identification of functional modules in a ppi network by clique
percolation clustering.
Computational biology and chemistry, 300 (6):0
445–451, 2006.

[Zhang et al., 2007]
Shihua Zhang, Rui-Sheng Wang, and Xiang-Sun Zhang.
Identification of overlapping community structure in complex networks
using fuzzy c-means clustering.
Physica A: Statistical Mechanics and its Applications,
3740 (1):0 483–490, 2007b.

[Zhang et al., 2015]
Xiao Zhang, Travis Martin, and Mark EJ Newman.
Identification of core-periphery structure in networks.
Physical Review E, 910 (3):0 032803, 2015.

[Zhang and Ahn, 2015]
Zhong-Yuan Zhang and Yong-Yeol Ahn.
Community detection in bipartite networks using weighted symmetric
binary matrix factorization.
International Journal of Modern Physics C, 260
(09):0 1550096, 2015.

[Zhao et al., 2011]
Peixiang Zhao, Xiaolei Li, Dong Xin, and Jiawei Han.
Graph cube: on warehousing and olap multidimensional networks.
In Proceedings of the 2011 ACM SIGMOD International Conference
on Management of data, pages 853–864, 2011.

[Zheleva and Getoor, 2007]
Elena Zheleva and Lise Getoor.
Preserving the privacy of sensitive relationships in graph data.
In International Workshop on Privacy, Security, and Trust in
KDD, pages 153–171. Springer, 2007.

[Zheleva and Getoor, 2009]
Elena Zheleva and Lise Getoor.
To join or not to join: the illusion of privacy in social networks
with mixed public and private user profiles.
In Proceedings of the 18th international conference on World
wide web, pages 531–540, 2009.

[Zhou et al., 2018]
Jie Zhou, Ganqu Cui, Zhengyan Zhang, Cheng Yang, Zhiyuan Liu, and Maosong Sun.
Graph neural networks: A review of methods and applications.
arXiv preprint arXiv:1812.08434, 2018.

[Zhou and Mondragón, 2004]
Shi Zhou and Raúl J Mondragón.
The rich-club phenomenon in the internet topology.
IEEE Communications Letters, 80 (3):0
180–182, 2004.

[Zhou et al., 2007]
Tao Zhou, Jie Ren, Matúš Medo, and Yi-Cheng Zhang.
Bipartite network projection and personal recommendation.
Physical Review E, 760 (4):0 046115, 2007.

[Zhou et al., 2009]
Tao Zhou, Linyuan Lü, and Yi-Cheng Zhang.
Predicting missing links via local information.
The European Physical Journal B, 710 (4):0
623–630, 2009.

[Zhou et al., 2010]
Tao Zhou, Zoltán Kuscsik, Jian-Guo Liu, Matúš Medo,
Joseph Rushton Wakeling, and Yi-Cheng Zhang.
Solving the apparent diversity-accuracy dilemma of recommender
Proceedings of the National Academy of Sciences, 1070
(10):0 4511–4515, 2010.

[Zipf, 1935]
GK Zipf.
The psycho-biology of language.

[Zitnik et al., 2018]
Marinka Zitnik, Monica Agrawal, and Jure Leskovec.
Modeling polypharmacy side effects with graph convolutional networks.
Bioinformatics, 340 (13):0 i457–i466, 2018.

[Zlatić et al., 2010]
Vinko Zlatić, Andrea Gabrielli, and Guido Caldarelli.
Topologically biased random walk and community finding in networks.
Physical Review E, 820 (6):0 066109, 2010.

[Zuckerman and Jost, 2001]
Ezra W Zuckerman and John T Jost.
What makes you think you're so popular? self-evaluation maintenance
and the subjective side of the" friendship paradox".
Social Psychology Quarterly, pages 207–223, 2001.

[Zuse, 1972]
Konrad Zuse.
Der Plankalkül.
Number 63. Gesellschaft für Mathematik und Datenverarbeitung,