• Applied category theory, Fall Western Sectional Meeting of the AMS, 4-5 November 2017, U.C. Riverside.

This is going to be fun.

My former student Brendan Fong is now working with David Spivak at MIT, and they’re both coming. My collaborator John Foley at Metron is also coming: we’re working on the CASCADE project for designing networked systems.

]]>Here and are so-called ‘overlay’ and ‘connect’ operations that are defined on simple networks as:

The application of the operation to the arguments is then simply , which gives you the right result.

Not sure how useful this observation is! :)

P.S.: The above ‘overlay’ and ‘connect’ operations have a simple equational theory: https://github.com/snowleopard/alga-paper/releases/download/final/algebraic-graphs.pdf

]]>If it happen a phase transition, where the numbers of edges (less of 100 kilometers) is large enough to allow long-range communication and rescue (I am thinking that little perturbation of the ships configuration give the same statistical phase), then the rescue would be probable: if a statistical description could be possible, then the number of the rescue boat could be adapted to the number of ships, and some lives could be saved. ]]>