Niek Mooij
London E1W 1YW, UK
Portland, ME 04101
2nd floor
11th floor
Boston, MA 02115
London E1W 1LP, UK
Talk recording
Systems of ordinary differential equations (ODEs) are rarely thought of as a means of discrete computations. We consider finding the maximum independent set in a complex network, which is known to be a computationally demanding (NP-hard) problem. This problem is at the heart of many real-world computations, e.g., the more efficient invention of new drugs, communication systems, and information flows. We construct an approximate solution by exploring the limiting behavior of ecology dynamics under constant interacting species assumption. We see that we can generate maximal independent sets in any complex network, and we show numerical performance results.