Markov chain theory and its applications

我对我的研究计划的长期愿景是通过执行由实际应用驱动的基础理论研究来扩大马尔可夫链理论在工业中的应用。特别是，我将进行原创性研究，开发和完善具有广泛应用的度量，算法和创新计算工具的工具包。马尔可夫链是一种数学模型，已被用于描述无数类型的动力系统，从城市道路网络中的交通行为到分子动力学及其在药物设计中的作用。马尔可夫链用于表示可以占据许多状态中的任何一个的系统，并且系统的行为通过概率转移矩阵来确定，该概率转移矩阵描述了系统在状态之间的随机运动。给定一个马尔可夫链，有许多指标可以确定它的“良好连接”程度。也希望了解每个国家的“中心”程度。举例来说：在传染病的接触网络中，连通性度量确定图的密度（对应于疾病的快速传播），并且为了控制传播，应该从网络中移除（隔离）最中心的节点以减少连通性。我的计划的一个目标是研究措施的连通性和中心性，从一个图上的随机游动的动力学过程中得出。一个关键的连通性度量被称为凯梅尼常数，它代表了系统的全局“连通性”;即系统在状态之间移动的平均速度。对凯梅尼常数的考虑是相对较新的，还有很多有待理解。这个建议的一个目标是提供一个了解如何敏感的Kemeny常数的计算是在过渡矩阵中的错误，为了给一个措施的信心，在这些应用程序之一的背景下的Kemeny常数的计算值。我还计划开发更新，更有效的方法计算凯梅尼常数比目前的国家的最先进的。最后一个目标是考虑有向复杂网络，即网络或数据集的关系可能是单向的（例如，社交网络Twitter涉及友谊连接，不一定是互惠的）。有向网络历来难以分析;例如，识别和分析集群是一个非常困难的问题。基于我过去在该领域的工作，我计划开发和实施马尔可夫链理论的新技术来解决这个问题。作为该提案的一部分，将培训4名硕士生，1名博士生和几名理科学生。他们将从事理论和应用研究，这将有助于推进马尔可夫链理论在广泛的工业环境中的理论理解和适用性的长期目标，如车辆交通模型，数据科学和社交网络。

My long-term vision for my research program is to expand the use of Markov chain theory in industry by performing fundamental theoretical research that is driven by practical applications. In particular, I will undertake original research to develop and refine a toolkit of metrics, algorithms, and innovative computational tools with a wide range of applications. A Markov chain is a type of mathematical model which has been used to describe countless types of dynamical systems, from traffic behaviour in an urban road network, to molecular dynamics and their role in drug design. A Markov chain is used to represent systems which can occupy any of a number of states, and the behaviour of the system is determined via a probability transition matrix, which describes the random movement of the system between the states. Given a Markov chain, there are many metrics which determine how 'well-connected' it is. It is also desirable to know how 'central' each state is. For example: in a contact network for a communicable disease, connectivity metrics determine how dense the graph is (corresponding to fast spread of the disease) and to control the spread, the most central nodes should be removed (quarantined) from the network to reduce connectivity. One objective of my program is to research measures of connectivity and centrality that derive from the dynamical process of a random walk on a graph. One key connectivity metric is called Kemeny's constant, and it represents the global 'connectedness' of the system; i.e. how quickly the system moves between states on average. The consideration of Kemeny's constant is relatively recent, and much remains to be understood. One objective of this proposal is to provide an understanding of how sensitive the calculation of Kemeny's constant is to errors in the transition matrix, in order to give a measure of confidence in the computed value of Kemeny's constant in the context of one of these applications. I also plan to develop newer, more efficient methods of computing Kemeny's constant than the current state-of-the-art. A final objective is to consider directed complex networks; that is, networks or datasets in which the relationship may be one-way only (for example, the social network Twitter involves friendship connections which are not necessarily reciprocated). Directed networks have historically been difficult to analyse; for example, identifying and analysing clusters is a very hard problem. Based on my past work in the area, I plan to develop and implement novel techniques from Markov chain theory to solve this problem. As part of this proposal, 4 MSc students, 1 PhD student, and several BSc students will be trained. They will engage in theoretical and applied research that will contribute towards the long-term goal of advancing the theoretical understanding and applicability of Markov chain theory in a wide range of industrial settings, such as vehicle traffic models, data science, and social networks.