Graph Searching in Canada (GRASCan) Workshop 2019
Description
Please refer to organizer website here: http://www.math.ryerson.ca/~abonato/GRASCan/GRASCan19/index.html .
Graph searching focuses on the analysis of games and graph processes that model some form of intrusion in a network, and efforts to eliminate or contain that intrusion. For example, in the game of Cops and Robbers, a robber is loose on the network, and a set of cops attempts to capture the robber. How the players move and the rules of capture depend on which variant is studied. There are many variants of graph searching studied in the literature, which are either motivated by problems in practice or are inspired by foundational issues in computer science, discrete mathematics, and artificial intelligence, such as robotics and network security.
In the past few years, many problems have emerged from applications related to the structure of real-world networks that are expected to be large-scale and dynamic, and where agents can be probabilistic, decentralized, and even selfish or antagonistic. This is one of the reasons why the field of graph searching is nowadays rapidly expanding. Several new models, problems, and approaches have appeared, relating it to diverse fields such as random walks, game theory, logic, probabilistic analysis, complex networks, mobile robotics, and distributed computing.
Graph Searching in Canada (or GRASCan) is an annual conference that has been held at various sites, beginning with an inaugural meeting at Ryerson University in 2012. GRASCan provides an opportunity for mathematicians and researchers in graph searching, Cops and Robbers games, pursuit-evasion games, and related fields to meet, disseminate their work, and collaborate. Although GRASCan is a national conference, it attracts a number of international participants. GRASCan enjoys an excellent reputation for its welcoming atmosphere and its high-quality scientific program. Junior mathematicians (graduate students, postdoctoral researchers, early career faculty members) are particularly encouraged to participate. Moreover, we expect that hosting this event at the Fields Institute, given its outstanding reputation and central location within Canada, will attract numerous researchers and graduate students with interests in these topics.
Schedule
09:00 to 10:00 |
Propagation and throttling for zero forcing, power domination, &Cops and Robbers
Leslie Hogben, Iowa State University |
10:00 to 10:30 |
Coffee break
|
10:30 to 11:00 |
Cops that surround a robber
Andrea Burgess, University of New Brunswick |
11:00 to 11:30 |
Catching a robber quickly with few cops
Boris Brimkov, Rice University |
11:30 to 12:00 |
Throttling for the Cop versus Robber Game
Jesse Geneson, Iowa State University |
12:00 to 12:30 |
Humans Capturing Robots
Melissa Huggan, Dalhousie University |
12:30 to 14:00 |
Lunch
|
09:00 to 10:00 |
Boting Yang, University of Regina |
10:00 to 10:30 |
Coffee break
|
10:30 to 11:00 |
Firefighter problem on planar graphs
Stephen Finbow, St Francis Xavier University |
11:00 to 11:30 |
The Firebreak Problem
David Pike, Memorial University |
11:30 to 12:00 |
On complexity of burning and broadcasting problems
Shahin Kamali, University of Manitoba |
12:00 to 12:30 |
Sequential Metric Dimension
Fionn Mc Inerney, Centre national de la recherche scientifique (CNRS) and Université Côte d'Azur |
12:30 to 14:00 |
Lunch
|