One of the things that has been repeatedly drilled into me over the past year or so is the fact that if you want people to do things for you, you’re most likely going to have to harass them. (I don’t mean literal harassment, by the way – please don’t commit a criminal offense and say I encouraged you.) This is true especially when working with highly busy people like managers and professors.

I keep coming across articles (and occasionally videos, and occasionally fiction or poetry) online that I want to share and comment on, but I recently realized that I will never have time to fully comment on everything I read that I find interesting. So I’m pulling another page out of Cory Doctorow’s book: here is a dump of links to cool stuff, along with some (hopefully very) brief descriptions of why I found these articles interesting.

Last summer, I was tasked with writing a report about the research I completed and submitting it to my supervisor by the end of the summer. I, of course, had never done this kind of writing before, so I learned several lessons. The hard way. The learning process was super painful, but it did come in handy when I had to write two other research reports in my classes last fall.

I think there might be people out there who think I’m a poet, and I think it’s terrifying. I haven’t been a poet since my middle school days of writing rhyming couplets about hating school and my early high school days of writing terrible prose with line breaks. In hindsight, I’m pretty sure the main reason I wrote so many poems in grade nine was because my teacher seemed to have no idea how to grade poems but very strong opinions about fiction, and I felt like I was terrible at writing fiction and wanted a shot at a decent grade.

In Part 2 of this talk, we gave a crash course to graph theory and showed how we can use it to view some real-world problems as instances of the densest subgraph problem (DSP). But what exactly is the DSP? If you’ve studied graph theory, you may have heard of something called the Maximum Clique Problem. The goal of the max clique problem is to find the largest complete subgraph in a graph. If we consider our vertices to be people, and edges to represent a friendship relationship between two people, in the max clique problem we are trying to find the largest friend group in a community.