- UNSW
- ...
- Our schools
- Mathematics & Statistics
- Engage with us
- Seminars
- 2017
- Approximating Consensus with Graph Limits
- Home
- Our school
- Study with us
- Our research
-
Student life & resources
- Undergraduate
- Honours year
- Postgraduate coursework
-
Postgraduate research
- Info for new students
- Current research students
- Postgraduate conference
- Postgraduate events
- Postgraduate student awards
- Michael Tallis PhD Research Travel Award
- Information about research theses
- Past research students
- Resources
- Entry requirements
- PhD projects
- Obtaining funding
- Application & fee information
-
Student services
- Help for postgraduate students
- Thesis guidelines
- School assessment policies
- Computing information
- Mathematics Drop-in Centre
- Consultation
- Statistics Consultation Service
- Academic advice
- Enrolment variation
- Changing tutorials
- Illness or misadventure
- Application form for existing casual tutors
- ARC grants Head of School sign off
- Computing facilities
- Choosing your major
- Student societies
- Student noticeboard
- Casual tutors
- Engage with us
- News & events
- Contact
- Home
- Our school
- Study with us
- Our research
-
Student life & resources
Postgraduate research
- Info for new students
- Current research students
- Postgraduate conference
- Postgraduate events
- Postgraduate student awards
- Michael Tallis PhD Research Travel Award
- Information about research theses
- Past research students
- Resources
- Entry requirements
- PhD projects
- Obtaining funding
- Application & fee information
Student services
- Help for postgraduate students
- Thesis guidelines
- School assessment policies
- Computing information
- Mathematics Drop-in Centre
- Consultation
- Statistics Consultation Service
- Academic advice
- Enrolment variation
- Changing tutorials
- Illness or misadventure
- Application form for existing casual tutors
- ARC grants Head of School sign off
- Computing facilities
- Choosing your major
- Engage with us
- News & events
- Contact
Abstract:
The consensus problem in multi-agent systems has long been the subject of intense research within the fields of computer science and mathematics. This problem can naturally be expressed as a dynamical system such that the interaction between agents is defined by a network.
The consensus problem in multi-agent systems has long been the subject of intense research within the fields of computer science and mathematics. This problem can naturally be expressed as a dynamical system such that the interaction between agents is defined by a network.
This talk will provide sufficient conditions for when graph limits can be used as a continuum-approximation for the consensus problem on large networks. I will also highlight other aspects of graph limit theory which have implications for the consensus problem.
Barton Lee is a PhD student at the School of Economics and Computer Science at UNSW.
Previously he completed his undergraduate studies within the School of Mathematics and Statistics at UNSW.
His research focuses are computational social choice and mechanism design with applications in political science.