Conferences  >  Informatics  >  Scientific Computing and Data Science  >  United States

Institute for Computational and Experimental Research in Mathematics (ICERM)

In recent years, new opportunities have emerged for pattern detection and identification in applications using data-scientific approaches. These applications include spiral waves in cardiac dynamics, vegetation patterns in arid ecosystems, and cell organization in biological tissues. The aim of this workshop is to bring together researchers at the interface of these diverse aspects of pattern-formation theory, computation, and applications in order to share ideas and identify new challenges and open problems. The scientific program will focus on the use of dynamical systems methods in the study of pattern formation, as well as the integration of dynamics, data, and computation.

ICERM;     Email: info@icerm.brown.edu

dynamical systems, data science, pattern formation

Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University

Researchers working on graph algorithms use a broad range of different criteria for deciding what makes an algorithm efficient. While in theory the dominant benchmark is the asymptotic running time, in practice the story is more nuanced: an algorithm needs to be simple enough to be implementable, fast on graphs of bounded size, space efficient, cache-friendly, and easy to test. While many of these requirements motivate interesting algorithmic questions that are highly relevant in practice, they are often overlooked by the theory community. The goal of the workshop is to foster the exchange of ideas between researchers working on graph algorithms, which have high practical relevance. The workshop will include overview talks on the various perspectives, research talks, an open problem session, and structured time for collaboration.

ICERM Program Staff;     Phone: [+1 (401) 863-5030];     Email: info@icerm.brown.edu

graph algorithms, data science, networks

Algorithms and Data Structures,    Graph Theory and Combinatorics

Simons Laufer Mathematical Sciences Institute (SLMath)

In a growing number of applications, one needs to analyze and interpret data coming from massive networks. The statistical problems arising from such applications lead to important mathematical challenges: building novel probabilistic models, understanding the possibilities and limitations for statistical detection and inference, designing efficient algorithms, and understanding the inherent limitations of fast algorithms. The workshop will bring together leading researchers in combinatorial statistics, machine learning, and random graphs in the hope of cross-fertilization of ideas.

combinatorial statistics, random graphs, network inference, network reconstruction, detection, estimation

Complex Networks,    Graph Theory and Combinatorics