MJMatthew D. Johnston

Matthew D. Johnston

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Matthew D. Johnston has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Exceptional graphs for the random walk

    by Juhan Aru, Carla Groenland, Tom Johnston, Bhargav Narayanan, Alex Roberts, Alex Scott

    If $\mathcal{W}$ is the simple random walk on the square lattice $\mathbb{Z}^2$, then $\mathcal{W}$ induces a random walk $\mathcal{W}_G$ on any spanning subgraph $G\subset \mathbb{Z}^2$ of the lattice as follows: viewing $\mathcal{W}$ as a uniformly random infinite word on the alphabet $\{\mathbf{x}, -\mathbf{x}, \mathbf{y}, -\mathbf{y} \}$, the walk $\mathcal{W}_G$ starts at the origin and follows the directions specified by $\mathcal{W}$, only accepting steps of $\mathcal{W}$ along which the walk $\mathcal{W}_G$ does not exit $G$. For any fixed subgraph $G \subset \mathbb{Z}^2$, the walk $\mathcal{W}_G$ is distributed as the simple random walk on $G$, and hence $\mathcal{W}_G$ is almost surely recurrent in the sense that $\mathcal{W}_G$ visits every site reachable from the origin in $G$ infinitely often. This fact naturally leads us to ask the following: does $\mathcal{W}$ almost surely have the property that $\mathcal{W}_G$ is recurrent for \emph{every} subgraph $G \subset \mathbb{Z}^2$? We answer this question negatively, demonstrating that exceptional subgraphs exist almost surely. In fact, we show more to be true: exceptional subgraphs continue to exist almost surely for a countable collection of independent simple random walks, but on the other hand, there are almost surely no exceptional subgraphs for a branching random walk.

  • Examples of Mathematical Modeling: Tales from the Crypt

    by Matthew D. Johnston, Carina M. Edwards, Walter F. Bodmer, Philip K. Maini, S. Jonathan Chapman

    Mathematical modeling is being increasingly recognized within the biomedical sciences as an important tool that can aid the understanding of biological systems. The heavily regulated cell renewal cycle in the colonic crypt provides a good example of how modeling can be used to find out key features of the system kinetics, and help to explain both the breakdown of homeostasis and the initiation of tumorigenesis.We use the cell population model by Johnston et al. (2007) Proc. Natl. Acad. Sci. USA 104, 4008-4013, to illustrate the power of mathematical modeling by considering two key questions about the cell population dynamics in the colonic crypt. We ask: how can a model describe both homeostasis and unregulated growth in tumorigenesis; and to which parameters in the system is the model most sensitive? In order to address these questions, we discuss what type of modeling approach is most appropriate in the crypt.We use the model to argue why tumorigenesis is observed to occur in stages with long lag phases...