In this paper, we present a sufficient framework to exhibit the sample path-wise asymptotic flocking dynamics of the Cucker–Smale model with unit-speed constraint and the randomly switching network topology. We employ a matrix formulation of the given equation, which allows us to evaluate the diameter of velocities with respect to the adjacency matrix of the network. Unlike the previous result on the randomly switching Cucker–Smale model, the unit-speed constraint disallows the system to be considered as a nonautonomous linear ordinary differential equation on velocity vector, which forces us to get a weaker form of the flocking estimate than the result for the original Cucker–Smale model.

It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted graph. The aim of this work is to extend these results to semigroups with infinitesimal generators given by a directed graph Laplacian operator through an analogous inspection of the geometry of the underlying directed graph. In particular, we introduce appropriate nomenclature to discuss the geometry of an infinite directed graph, as well as provide sufficient conditions to extend ultracontractive properties of undirected graph Laplacians to those of the directed variety. Such directed graph Laplacians can often be observed in the study of coupled oscillators, where recent work made explicit the link between synchronous patterns to systems of identically coupled oscillators and ultracontractive properties of undirected graph semigroups. Therefore, in this work we demonstrate the applicability of our results on directed graph semigroups by extending the aforementioned investigation beyond the idealized case of identically coupled oscillators.

We show that every subset of vertices of a directed graph $E$ gives a Morita equivalence between a subalgebra and an ideal of the associated Leavitt path algebra. We use this observation to prove an algebraic version of a theorem of Crisp and Gow: certain subgraphs of $E$ can be contracted to a new graph $G$ such that the Leavitt path algebras of $E$ and $G$ are Morita equivalent. We provide examples to illustrate how desingularising a graph, and in- or out-delaying of a graph, all fit into this setting.

Simple random walks on a partially directed version of Z2 are considered. More precisely, vertical edges between neighbouring vertices of Z2 can be traversed in both directions (they are undirected) while horizontal edges are one-way. The horizontal orientation is prescribed by a random perturbation of a periodic function; the perturbation probability decays according to a power law in the absolute value of the ordinate. We study the type of simple random walk that is recurrent or transient, and show that there exists a critical value of the decay power, above which it is almost surely recurrent and below which it is almost surely transient.

One interesting example of a discrete mathematical model used in biology is a food web.The first biology courses in high school and in college present the fundamental nature ofa food web, one that is understandable by students at all levels. But food webs as part ofa larger system are often not addressed. This paper presents materials that can be used inundergraduate classes in biology (and mathematics) and provides students with theopportunity to explore mathematical models of predator-prey relationships, determinetrophic levels, dominant species, stability of the ecosystem, competition graphs, intervalgraphs, and even confront problems that would appear to have logical answers that are asyet unsolved.

In DNA sequences, specific words may take on biological functions as marker or signalling sequences. These may often be identified by frequent-word analyses as being particularly abundant. Accurate statistics is needed to assess the statistical significance of these word frequencies. The set of shuffled sequences - letter sequences having the same k-word composition, for some choice of k, as the sequence being analysed - is considered the most appropriate sample space for analysing word counts. However, little is known about these word counts. Here we present exact formulae for word counts in shuffled sequences.

We prove that two quiver operator algebras can be isometrically isomorphic only if the quivers (=directed graphs) are isomorphic. We also show how the graph can be recovered from certain representations of the algebra.