With about ten nine eight weeks left of the decade, obviously we need to start making top-lists! The idea here is to list ten favorite papers of the 2010s, related to my research, and add one item per week. It’s not an ordered list and it will not be too serious, don’t hate me if your paper is […]

Yesterday a paper by Mason Porter, Hiroki Sayama and myself was published in Frontiers for Young Minds. It attempts to present network centrality to the Frozen generation. In the spirit of data sharing, you can find the raw data below. It is the undirected network of who talks to whom and how many lines they […]

June 21, that authors of the General Network Dismantling paper sent me a reply with their comments to this blog post. You can read it here. I will comment on it later.   This post is about some recent experiences and thoughts of reproducing computational results of a paper. Thoughts about computational reproducibility Reproducibility of […]

This post is revised after comments from Urska Demsar, Travis Gibson, Des Higham, Mason Porter, Jan Peter Schäfermeyer, Johan Ugander, and Jean-Gabriel Young. Thanks! Our field is interdisciplinary and many smart people have been thinking about similar things. No wonder things get reinvented and rediscovered many times. I don’t think science is a competition to […]

One of the problems network science sets out to solve is to find important nodes. Of course, what is important depends on the context, but an applied scientist coming to network science for an answer probably has a clear idea what it means in her study system. There is no shortage of methods in the […]

This is a comment on the recent arxiv by Voitalov, van der Hoorn, van der Hofstad and Krioukov titled Scale-free networks well done, and the ongoing debate of scale-free networks. As usual, I take a laid-back spectator position—no papers, no research of my own, just another blog post of my own reading of this contribution […]

In one of my first network projects, as a student, I studied how networks break down when you remove edges in order of their betweenness. Simultaneously, Girvan and Newman used exactly the same approach to make the first modern community detection algorithm. This was before authors used to make their code publicly available, so when […]