We develop a new Bayesian split population survival model for the analysis of survival data with misclassified event failures. Within political science survival data, right-censored survival cases are often erroneously misclassified as failure cases due to measurement error. Treating these cases as failure events within survival analyses will underestimate the duration of some events. This will bias coefficient estimates, especially in situations where such misclassification is associated with covariates of interest. Our split population survival estimator addresses this challenge by using a system of two equations to explicitly model the misclassification of failure events alongside a parametric survival process of interest. After deriving this model, we use Bayesian estimation via slice sampling to evaluate its performance with simulated data, and in several political science applications. We find that our proposed “misclassified failure” survival model allows researchers to accurately account for misclassified failure events within the contexts of civil war duration and democratic survival.

Network analysis has typically examined the formation of whole networks while neglecting variation within or across networks. These approaches neglect the particular roles actors may adopt within networks. While cross-sectional approaches for inferring latent roles exist, there is a paucity of approaches for considering roles in longitudinal networks. This paper explores the conceptual dynamics of temporally observed roles while deriving and introducing a novel statistical tool, the ego-TERGM, capable of uncovering these latent dynamics. Estimated through an Expectation–Maximization algorithm, the ego-TERGM is quick and accurate in classifying roles within a broader temporal network. An application to the Kapferer strike network illustrates the model’s utility.

We investigate the limit distributions associated with cost measures in Sattolo's algorithm for generating random cyclic permutations. The number of moves made by an element turns out to be a mixture of 1 and 1 plus a geometric distribution with parameter ½, where the mixing probability is the limiting ratio of the rank of the element being moved to the size of the permutation. On the other hand, the raw distance traveled by an element to its final destination does not converge in distribution without norming. Linearly scaled, the distance converges to a mixture of a uniform and a shifted product of a pair of independent uniforms. The results are obtained via randomization as a transform, followed by derandomization as an inverse transform. The work extends analysis by Prodinger.