The Atlas for the Aspiring Network Scientist
arXiv:2101.00863
Abstract
Network science is the field dedicated to the investigation and analysis of complex systems via their representations as networks. We normally model such networks as graphs: sets of nodes connected by sets of edges and a number of node and edge attributes. This deceptively simple object is the starting point of never-ending complexity, due to its ability to represent almost every facet of reality: chemical interactions, protein pathways inside cells, neural connections inside the brain, scientific collaborations, financial relations, citations in art history, just to name a few examples. If we hope to make sense of complex networks, we need to master a large analytic toolbox: graph and probability theory, linear algebra, statistical physics, machine learning, combinatorics, and more. This book aims at providing the first access to all these tools. It is intended as an "Atlas", because its interest is not in making you a specialist in using any of these techniques. Rather, after reading this book, you will have a general understanding about the existence and the mechanics of all these approaches. You can use such an understanding as the starting point of your own career in the field of network science. This has been, so far, an interdisciplinary endeavor. The founding fathers of this field come from many different backgrounds: mathematics, sociology, computer science, physics, history, digital humanities, and more. This Atlas is charting your path to be something different from all of that: a pure network scientist.
References in corpus (86)
- Fast unfolding of communities in large networks
- Modularity and community structure in networks
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Maps of random walks on complex networks reveal community structure
- Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation
- Statistical physics of social dynamics
- Near linear time algorithm to detect community structures in large-scale networks
- The Building Blocks of Economic Complexity
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Comparing community structure identification
- The scaling laws of human travel
- Statistical Mechanics of Community Detection
- Detecting the overlapping and hierarchical community structure of complex networks
- Predicting Missing Links via Local Information
- Scale-free brain functional networks
- Finding statistically significant communities in networks
- Efficient Immunization Strategies for Computer Networks and Populations
- Community structure in directed networks
- Multirelational Organization of Large-scale Social Networks in an Online World
- A tool for filtering information in complex systems
- Extracting the multiscale backbone of complex weighted networks
- Variational Graph Auto-Encoders
- Dynamics of person-to-person interactions from distributed RFID sensor networks
- Clustering in Complex Directed Networks
- Missing and spurious interactions and the reconstruction of complex networks
- Theory of Rumour Spreading in Complex Social Networks
- Modularity and community detection in bipartite networks
- New Model of Internet Topology Using k-shell Decomposition
- Modeling the Worldwide Spread of Pandemic Influenza: Baseline Case and Containment Interventions
- Thresholds for epidemic spreading in networks
- Layer aggregation and reducibility of multilayer interconnected networks
- Line Graphs, Link Partitions and Overlapping Communities
- The Rich-Club Phenomenon In The Internet Topology
- Emergence of network features from multiplexity
- Clique percolation in random networks
- Extracting the hierarchical organization of complex systems
- Robustness of interdependent networks under targeted attack
- Random graphs with clustering
- Understanding the spreading patterns of mobile phone viruses
- Community detection in networks with positive and negative links
- Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
- Detecting network communities by propagating labels under constraints
- Path lengths, correlations, and centrality in temporal networks
- Robustness of community structure in networks
- Size reduction of complex networks preserving modularity
- Dynamics of Social Balance on Networks
- Avoiding catastrophic failure in correlated networks of networks
- Evaluating Link Prediction Methods
- Happiness is assortative in online social networks
- Core-periphery organization of complex networks
- Invention as a Combinatorial Process: Evidence from U.S. Patents
- Community detection in networks: Structural communities versus ground truth
- A sequential algorithm for fast clique percolation
- The clustering coefficient and community structure of bipartite networks
- Identification of core-periphery structure in networks
- Evaluating Local Community Methods in Networks
- Systemic delay propagation in the US airport network
- Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity
- k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
- Career on the Move: Geography, Stratification, and Scientific Impact
- Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement
- Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
- Link Prediction in Complex Networks: A Mutual Information Perspective
- Quantifying and identifying the overlapping community structure in networks
- Motif-based communities in complex networks
- HARP: Hierarchical Representation Learning for Networks
- NetSimile: A Scalable Approach to Size-Independent Network Similarity
- Information filtering in complex weighted networks
- Information filtering via preferential diffusion
- Synchronization in weighed scale-free networks with degree-degree correlation
- Topologically biased random walk with application for community finding in networks
- Detecting Communities in Networks by Merging Cliques
- Growing network model for community with group structure
- Afterglow Light Curves and Broken Power Laws: A Statistical Study
- Bridge Bounding: A Local Approach for Efficient Community Discovery in Complex Networks
- Tracking and Predicting Evolution of Social Communities
- Multi-Agent Path Finding with Delay Probabilities
- Community detection in bipartite networks using weighted symmetric binary matrix factorization
- Irreducible network backbones: unbiased graph filtering via maximum entropy
- Atmospheric reaction systems as null-models to identify structural traces of evolution in metabolism
- Role-based similarity in directed networks
- Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm
- Revealing evolutions in dynamical networks
- Empirical comparison of network sampling techniques