(Backward or forward) reachability in temporal networks is a measure of the position of nodes, akin to the centrality measures of static networks. The (forward, or downstream) reachability of a node i is the fraction of nodes that can be reached by time-respecting paths from i at time t, averaged over time from the beginning […]

This is not really a blog post, but rather a checklist of more or less painful mistakes in networks-science programs by me, or my students or teachers. (As a side note, computer scientists tend to be better a this, but are by no means immune to it.) This list is incomplete. I plan to fill […]

In my high school days, my daily commute consisted of: a 2 km bike ride, a 10 min train ride, 10 min walk, and finally 10 min by bus. For the final bus ride, there were a handful of coaches that all passed by my school. They would always come in a bunch and in […]

I do. In the sense of phantom traffic jams—traffic jams without a bottleneck, that just emerge spontaneously (and with peculiar density characteristics—more below). The most fundamental feature of highway traffic is the “inverse-λ shape” flow-density diagram. Flow is the number of vehicles that pass a point along the road. Density is how many cars there […]

It’s March 25, 2020, and the whole world is (or should be) battling the worst disease outbreak in anyone’s memory. It is definitely a unique situation in that it is the first emerging pandemics in the era of social media, so we get the full spectrum of information—from hard facts to nonsense—all filtered through the […]

Here I will list my ten favorite papers of the 2010s related to my research. It’s not an ordered list, and it will not be too serious, so don’t hate me if your paper is not on the list. Here we go: TW Wey, F Jordán, DT Blumstein, Transitivity and structural balance in marmot social […]

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 on 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 the computational results of a paper. Thoughts about computational reproducibility Reproducibility […]

I revised this post after comments from Urska Demsar, Travis Gibson, Des Higham, Mason Porter, Max Schich, 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 […]

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 of what it means in her study system. There is no shortage of methods in […]