| EPSRC Reference: |
EP/L002787/1 |
| Title: |
Discrete Potential Theory and Applications |
| Principal Investigator: |
Georgakopoulos, Dr A |
| Other Investigators: |
|
| Researcher Co-Investigators: |
|
| Project Partners: |
|
| Department: |
Mathematics |
| Organisation: |
University of Warwick |
| Scheme: |
First Grant - Revised 2009 |
| Starts: |
05 September 2013 |
Ends: |
04 September 2015 |
Value (£): |
98,503
|
| EPSRC Research Topic Classifications: |
|
| EPSRC Industrial Sector Classifications: |
| No relevance to Underpinning Sectors |
|
|
| Related Grants: |
|
| Panel History: |
| Panel Date | Panel Name | Outcome |
|
12 Jun 2013
|
Mathematics Prioritisation Panel Meeting June 2013
|
Announced
|
|
|
Summary on Grant Application Form |
The project is devoted to basic research in pure mathematics.
It is based on the well-studied interplay between the theory of electrical networks -seen as abstract mathematical tools- and the theory of random walks on graphs. Four specific topics within this framework are addressed by the project:
-- The Poisson boundary for random walk on graphs and groups;
We follow an active tradition in group theory, triggered by Kesten, where results about groups are obtained indirectly by considering a random walk on the group and relating its behaviour, or the structure of a boundary associated to it, to the algebraic properties of the group. The project benefits from a recent strong result of the applicant providing a criterion for the Poisson boundary, as well as a novel idea of associating a random finite graph rather than a random walk with a group, exploiting the recent theory of graphons by Lovasz et. al.
-- Discrete conformal uniformization in the sense of Benjamini & Schramm;
We seek to strengthen a new result of the applicant, related to the above, that answered a question of Benjamini & Schramm. Such a strengthening will provide new results on the Poisson boundary.
-- The relationship between the cover time and the cover cost in extremal and random finite graphs.
The cover time of a graph is an important concept in mathematics and computer science, and is even studied by physicists, but it is very hard to compute or even approximate. Using the concept of cover cost that the applicant introduced, we seek to simplify the approximation of the cover time for many classes of graphs by breaking it down into two steps: showing that it is close to the cover cost, and computing the (provably more tractable) cover cost.
These topics lie in different areas of mathematics, all of which have seen a lot of research activity in recent years. They are interlinked by the general theme of electrical networks, random walks, and their interplay, and share further finer interconnections. The project aims to contribute by producing new results individually for each sub-topic as well as by establishing or strengthening connections between them.
The project's results will be of interest to several research communities, including Graph Theory, Probability, (discrete) Potential Theory and Group Theory.
|
|
Key Findings |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Potential use in non-academic contexts |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
|
Impacts |
|
| Description |
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk |
| Summary |
|
| Date Materialised |
|
|
|
|
Sectors submitted by the Researcher |
|
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
|
| Project URL: |
|
| Further Information: |
|
| Organisation Website: |
http://www.warwick.ac.uk |