In this article, we introduce Mallows processes, defined to be continuous-time cadlag processes with Mallows distributed marginals. We show that such processes exist and that they can be restricted to have certain natural properties. In particular, we prove that there exist regular Mallows processes, defined to have their inversion numbers ${\mathrm{Inv}}_j(\sigma )=|\{i\in [j-1] \, : \, \sigma (i)\gt \sigma (\,j)\}|$ be independent increasing stochastic processes with jumps of size $1$. We further show that there exists a unique Markov process which is a regular Mallows process. Finally, we study properties of regular Mallows processes and show various results on the structure of these objects. Among others, we prove that the graph structure related to regular Mallows processes looks like an expanded hypercube where we stacked $k$ hypercubes on the dimension $k\in [n]$; we also prove that the first jumping times of regular Mallows processes converge to a Poisson point process; we eventually provide results regarding the Markov property of the discrete jumping chain corresponding to a Mallows process.

It has been known for nearly a decade that deterministically modeled reaction networks that are weakly reversible and consist of a single linkage class have trajectories that are bounded from both above and below by positive constants (so long as the initial condition has strictly positive components). It is conjectured that the stochastically modeled analogs of these systems are positive recurrent. We prove this conjecture in the affirmative under the following additional assumptions: (i) the system is binary, and (ii) for each species, there is a complex (vertex in the associated reaction diagram) that is a multiple of that species. To show this result, a new proof technique is developed in which we study the recurrence properties of the n-step embedded discrete-time Markov chain.

We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated with the chain form a linear space spanning a Lie algebra. The key original contribution we make is to overcome an obstruction, due to the presence of inequalities that are unavoidable in the probabilistic application, which prevents free manipulation of terms in the Baker–Campbell–Haursdorff formula.

In dynamic networks, the presence of ties are subject both to endogenous network dependencies and spatial dependencies. Current statistical models for change over time are typically defined relative to some initial condition, thus skirting the issue of where the first network came from. Additionally, while these longitudinal network models may explain the dynamics of change in the network over time, they do not explain the change in those dynamics. We propose an extension to the longitudinal exponential random graph model that allows for simultaneous inference of the changes over time and the initial conditions, as well as relaxing assumptions of time-homogeneity. Estimation draws on recent Bayesian approaches for cross-sectional exponential random graph models and Bayesian hierarchical models. This is developed in the context of foreign direct investment relations in the global electricity industry in 1995–2003. International investment relations are known to be affected by factors related to: (i) the initial conditions determined by the geographical locations; (ii) time-dependent fluctuations in the global intensity of investment flows; and (iii) endogenous network dependencies. We rely on the well-known gravity model used in research on international trade to represent how spatial embedding and endogenous network dependencies jointly shape the dynamics of investment relations.

Patch clamp recordings from ion channels often show periods of repetitive activity, known as bursts, which are noticeably separated from each other by periods of inactivity. Depending on the type of channel, such recordings may exhibit (conductance) levels between the closed (zero) level and the fully open level. Properties of bursts are less subject to problems that arise from recording than are properties for individual sojourns at different levels, and study of bursting behaviour provides important information about the finer structure of the underlying channel gating process. For a general finite state space continuous-time Markov chain model allowing one or more nonzero conductance levels, the present paper establishes results about the semi-Markov structure of a single burst and of a sequence of bursts, and uses this in a unified approach to properties of both theoretical and empirical bursts. The distribution and moments of particular burst properties, including the total charge transfer, the total sojourn time and the total number of visits to specified conductance levels during a burst, are derived. Various extensions are also described.

We give simple sufficient conditions for integrability of continuous-time Markov chains in terms of their infinitesimal parameters. Similar conditions for regularity are stated first, and a simple proof given.

In this paper, we give an alternative derivation of Kendall's representation for symmetric transition functions which relies on the backward and/or forward integral recursions. The proof uses a lemma concerning approximation by finite sections (which is useful in its own right) and is similar to the original proof for birth and death processes by Lederman and Reuter. Finally, we obtain a general result guaranteeing the existence of representations of transition functions such as those obtained by Pruitt and Iglehart.

Sufficient conditions for strong ergodicity of discrete-time non-homogeneous Markov chains have been given in several papers. Conditions have been given using the left eigenvectors ψn of Pn (ψ nPn = ψ n ) and also using the limiting behavior of Pn. In this paper we consider the analogous results in the case of continuous-time Markov chains where one uses the intensity matrices Q(t) instead of P(s, t). A bound on the rate of convergence of certain strongly ergodic chains is also given.

The concept of strong ergodicity for discrete-time homogeneous Markov chains has been characterized in several ways (Dobrushin (1956), Lin (1975), Isaacson and Tweedie (1978)). In this paper the characterization using mean visit times (Huang and Isaacson (1977)) is extended to continuous-time Markov chains. From this it follows that for a certain subclass of continuous-time Markov chains, X(t), is strongly ergodic if and only if the associated embedded chain is Cesaro strongly ergodic.