Grant: Discovery Grants Program - Individual
University of Manitoba
$42,000.00
Nonnegative and Combinatorial Matrix Theory
FY 2023-24
Summary
The overarching objective of my research program is to develop tools and insights for nonnegative matrix theory and combinatorial matrix theory, and to apply them in order to advance the understanding of Markov chains and to expose the structure of networks. A Markov chain is a certain type of probabilistic model that is ubiquitous in science and engineering, finding applications in such diverse areas as computational drug design, ranking of web pages, and wireless network design. Kemeny's constant is a key quantity associated with a Markov chain which provides an overall measure of the short-term efficiency of the Markov chain. My proposed program of research in this area develops the theory underpinning, and the understanding of, Kemeny's constant, thus yielding insight into the design of Markov chains with desirable efficiency properties. The long-term behaviour of a Markov chain is described by the so-called stationary distribution, and the rate of approach to that stationary distribution is governed by quantities called eigenvalues. It turns out that the stationary distribution itself places constraints on the rate of approach to it. This aspect of my program of research will undertake a detailed investigation of the relationship between the stationary distribution and the eigenvalues. This will shed useful light on the long-term properties of Markov chains and the phenomena that they model. I will also bring insights from nonnegative and combinatorial matrix theory to the study of certain networks. Specifically, two-mode networks arise in the study of social networks, and can be thought of as a record of individuals and the groups to which they belong. One approach to measuring the importance of the individuals and groups involves replacing the original two-mode network by two related networks, one based only on the individuals and the other based only on the groups. It has been shown that sometimes this replacement can overlook the structure of the orginal two-mode network, and this is known as data loss. My program of research in this domain will investigate this data loss by identifying two-mode networks where data loss is certain, and in a complementary manner, networks where data loss cannot take place. The results of this line of inquiry will inform the utility of the technique of analysing a single two-mode network in terms of a pair of related networks. My proposed program of research is conceived with HQP training as a key priority. Specifically, this research program will underpin the training of two Ph.D. students, one M.Sc. student, one Postdoctoral Fellow and two USRAs.
Program
Discovery Grants Program - Individual
Recipient
Location
Manitoba, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2019-05408
Name nom
Kirkland, Stephen
Department département
Mathematics - Mathematics
Organization id
19
Institution établissement
University of Manitoba
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2019
Award amount
42000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Combinatorics
Research subject en
Mathématiques pures
Research subject fr
Combinatoire
Application title
Nonnegative and Combinatorial Matrix Theory
Keyword
Combinatorial matrix theory; Kemeny's constant; Markov chains; Nonnegative matrix theory; Two-mode networks
Application summary
The overarching objective of my research program is to develop tools and insights for nonnegative matrix theory and combinatorial matrix theory, and to apply them in order to advance the understanding of Markov chains and to expose the structure of networks. A Markov chain is a certain type of probabilistic model that is ubiquitous in science and engineering, finding applications in such diverse areas as computational drug design, ranking of web pages, and wireless network design. Kemeny's constant is a key quantity associated with a Markov chain which provides an overall measure of the short-term efficiency of the Markov chain. My proposed program of research in this area develops the theory underpinning, and the understanding of, Kemeny's constant, thus yielding insight into the design of Markov chains with desirable efficiency properties. The long-term behaviour of a Markov chain is described by the so-called stationary distribution, and the rate of approach to that stationary distribution is governed by quantities called eigenvalues. It turns out that the stationary distribution itself places constraints on the rate of approach to it. This aspect of my program of research will undertake a detailed investigation of the relationship between the stationary distribution and the eigenvalues. This will shed useful light on the long-term properties of Markov chains and the phenomena that they model. I will also bring insights from nonnegative and combinatorial matrix theory to the study of certain networks. Specifically, two-mode networks arise in the study of social networks, and can be thought of as a record of individuals and the groups to which they belong. One approach to measuring the importance of the individuals and groups involves replacing the original two-mode network by two related networks, one based only on the individuals and the other based only on the groups. It has been shown that sometimes this replacement can overlook the structure of the orginal two-mode network, and this is known as data loss. My program of research in this domain will investigate this data loss by identifying two-mode networks where data loss is certain, and in a complementary manner, networks where data loss cannot take place. The results of this line of inquiry will inform the utility of the technique of analysing a single two-mode network in terms of a pair of related networks. My proposed program of research is conceived with HQP training as a key priority. Specifically, this research program will underpin the training of two Ph.D. students, one M.Sc. student, one Postdoctoral Fellow and two USRAs.