I have developed "tennis elbow" from lugging this book around the past four weeks, but it is worth the pain, the effort, and the aspirin. It is also worth the (relatively speaking) bargain price. Including appendixes, this book contains 894 pages of text. The entire panorama of the neural sciences is surveyed and examined, and it is comprehensive in its scope, from genomes to social behaviors. The editors explicitly state that the book is designed as "an introductory text for students of biology, behavior, and medicine," but it is hard to imagine any audience, interested in any fragment of neuroscience at any level of sophistication, that would not enjoy this book. The editors have done a masterful job of weaving together the biologic, the behavioral, and the clinical sciences into a single tapestry in which everyone from the molecular biologist to the practicing psychiatrist can find and appreciate his or

Principles of Neural Science

We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

Social Network Analysis

Estimation of the prevalence and contagiousness of undocumented novel coronavirus [severe acute respiratory syndrome–coronavirus 2 (SARS-CoV-2)] infections is critical for understanding the overall prevalence and pandemic potential of this disease. Here, we use observations of reported infection within China, in conjunction with mobility data, a networked dynamic metapopulation model, and Bayesian inference, to infer critical epidemiological characteristics associated with SARS-CoV-2, including the fraction of undocumented infections and their contagiousness. We estimate that 86% of all infections were undocumented [95% credible interval (CI): 82–90%] before the 23 January 2020 travel restrictions. The transmission rate of undocumented infections per person was 55% the transmission rate of documented infections (95% CI: 46–62%), yet, because of their greater numbers, undocumented infections were the source of 79% of the documented cases. These findings explain the rapid geographic spread of SARS-CoV-2 and indicate that containment of this virus will be particularly challenging.

/pdf/substantial-undocumented-infection-facilitates-the-rapid-20nusdrfp7.pdf

Substantial undocumented infection facilitates the rapid dissemination of novel coronavirus (SARS-CoV-2)

Physical Review B

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

Influence maximization in complex networks through optimal percolation

We elaborate on a linear time implementation of the Collective Influence (CI) algorithm introduced by Morone, Makse, Nature 524, 65 (2015) to find the minimal set of influencers in a network via optimal percolation. We show that the computational complexity of CI is O(N log N) when removing nodes one-by-one, with N the number of nodes. This is made possible by using an appropriate data structure to process the CI values, and by the finite radius l of the CI sphere. Furthermore, we introduce a simple extension of CI when l is infinite, the CI propagation (CI_P) algorithm, that considers the global optimization of influence via message passing in the whole network and identifies a slightly smaller fraction of influencers than CI. Remarkably, CI_P is able to reproduce the exact analytical optimal percolation threshold obtained by Bau, Wormald, Random Struct. Alg. 21, 397 (2002) for cubic random regular graphs, leaving little improvement left for random graphs. We also introduce the Collective Immunization Belief Propagation algorithm (CI_BP), a belief-propagation (BP) variant of CI based on optimal immunization, which has the same performance as CI_P. However, this small augmented performance of the order of 1-2 % in the low influencers tail comes at the expense of increasing the computational complexity from O(N log N) to O(N^2 log N), rendering both, CI_P and CI_BP, prohibitive for finding influencers in modern-day big-data. The same nonlinear running time drawback pertains to a recently introduced BP-decimation (BPD) algorithm by Mugisha, Zhou, arXiv:1603.05781. For instance, we show that for big-data social networks of typically 200 million users (eg, active Twitter users sending 500 million tweets per day), CI finds the influencers in less than 3 hours running on a single CPU, while the BP algorithms (CI_P, CI_BP and BDP) would take more than 3,000 years to accomplish the same task.

Collective Influence Algorithm to find influencers via optimal percolation in massively large social media

We elaborate on a linear-time implementation of Collective-Influence (CI) algorithm introduced by Morone, Makse, Nature 524, 65 (2015) to find the minimal set of influencers in networks via optimal percolation. The computational complexity of CI is O(N log N) when removing nodes one-by-one, made possible through an appropriate data structure to process CI. We introduce two Belief-Propagation (BP) variants of CI that consider global optimization via message-passing: CI propagation (CIP) and Collective-Immunization-Belief-Propagation algorithm (CIBP) based on optimal immunization. Both identify a slightly smaller fraction of influencers than CI and, remarkably, reproduce the exact analytical optimal percolation threshold obtained in Random Struct. Alg. 21, 397 (2002) for cubic random regular graphs, leaving little room for improvement for random graphs. However, the small augmented performance comes at the expense of increasing running time to O(N2), rendering BP prohibitive for modern-day big-data. For instance, for big-data social networks of 200 million users (e.g., Twitter users sending 500 million tweets/day), CI finds influencers in 2.5 hours on a single CPU, while all BP algorithms (CIP, CIBP and BDP) would take more than 3,000 years to accomplish the same task.

/pdf/collective-influence-algorithm-to-find-influencers-via-33a75p9iq8.pdf

Collective Influence Algorithm to find influencers via optimal percolation in massively large social media.

Granular materials are systems of macroscopic grains such as sugar, sand, or rice. These systems exhibit a transition to a jammed state similar to an amorphous solid. Although the jammed state concept is simple as it is determined by excluded volume interactions, describing this state of matter is highly challenging. The approach of Edwards is reviewed here which describes jammed granular materials using the volume ensemble of equally probable jammed states. The Edwards volume ensemble is reviewed for various packings providing insight into an unifying phase diagram for jammed matter.

Edwards statistical mechanics for jammed granular matter

Collapses of dynamical systems into irrecoverable states are observed in ecosystems, human societies, financial systems and network infrastructures. Despite their widespread occurrence and impact, these events remain largely unpredictable. In searching for the causes for collapse and instability, theoretical investigations have so far been unable to determine quantitatively the influence of the structural features of the network formed by the interacting species. Here, we derive the condition for the stability of a mutualistic ecosystem as a constraint on the strength of the dynamical interactions between species and a topological invariant of the network: the k-core. Our solution predicts that when species located at the maximum k-core of the network go extinct, as a consequence of sufficiently weak interaction strengths, the system will reach the tipping point of its collapse. As a key variable involved in collapse phenomena, monitoring the k-core of the network may prove a powerful method to anticipate catastrophic events in the vast context that stretches from ecological and biological networks to finance. Predicting the collapse of a dynamical system by monitoring the structure of its network of interaction takes the form of stability conditions formulated in terms of a topological invariant of the network, the k-core.

Flaviano Morone

Papers

Influence maximization in complex networks through optimal percolation

Collective Influence Algorithm to find influencers via optimal percolation in massively large social media

Collective Influence Algorithm to find influencers via optimal percolation in massively large social media.

Edwards statistical mechanics for jammed granular matter

The k-core as a predictor of structural collapse in mutualistic ecosystems