Zero Forcing Sets and Bipartite Circulants

In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a graph based only on the parameters that describe its biadjacency matrix. The main results of the paper characterize the bipartite circulant graphs that achieve equality in the lower bound.Comment: 22 pages, 13 figure

Identifiability of Large Phylogenetic Mixture Models

Phylogenetic mixture models are statistical models of character evolution allowing for heterogeneity. Each of the classes in some unknown partition of the characters may evolve by different processes, or even along different trees. The fundamental question of whether parameters of such a model are identifiable is difficult to address, due to the complexity of the parameterization. We analyze mixture models on large trees, with many mixture components, showing that both numerical and tree parameters are indeed identifiable in these models when all trees are the same. We also explore the extent to which our algebraic techniques can be employed to extend the result to mixtures on different trees.Comment: 15 page

The minimum rank problem for circulants

The minimum rank problem is to determine for a graph $G$ the smallest rank of a Hermitian (or real symmetric) matrix whose off-diagonal zero-nonzero pattern is that of the adjacency matrix of $G$. Here $G$ is taken to be a circulant graph, and only circulant matrices are considered. The resulting graph parameter is termed the minimum circulant rank of the graph. This value is determined for every circulant graph in which a vertex neighborhood forms a consecutive set, and in this case is shown to coincide with the usual minimum rank. Under the additional restriction to positive semidefinite matrices, the resulting parameter is shown to be equal to the smallest number of dimensions in which the graph has an orthogonal representation with a certain symmetry property, and also to the smallest number of terms appearing among a certain family of polynomials determined by the graph. This value is then determined when the number of vertices is prime. The analogous parameter over the reals is also investigated.Comment: 27 pages, 3 figures; to appear in Linear Algebra and its Application

On the Convexity of Latent Social Network Inference

In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, we formulate the problem of inferring latent social networks based on network diffusion or disease propagation data. We consider contagions propagating over the edges of an unobserved social network, where we only observe the times when nodes became infected, but not who infected them. Given such node infection times, we then identify the optimal network that best explains the observed data. We present a maximum likelihood approach based on convex programming with a l1-like penalty term that encourages sparsity. Experiments on real and synthetic data reveal that our method near-perfectly recovers the underlying network structure as well as the parameters of the contagion propagation model. Moreover, our approach scales well as it can infer optimal networks of thousands of nodes in a matter of minutes.Comment: NIPS, 201

Formation and Evolution of Binary Asteroids

Satellites of asteroids have been discovered in nearly every known small body population, and a remarkable aspect of the known satellites is the diversity of their properties. They tell a story of vast differences in formation and evolution mechanisms that act as a function of size, distance from the Sun, and the properties of their nebular environment at the beginning of Solar System history and their dynamical environment over the next 4.5 Gyr. The mere existence of these systems provides a laboratory to study numerous types of physical processes acting on asteroids and their dynamics provide a valuable probe of their physical properties otherwise possible only with spacecraft. Advances in understanding the formation and evolution of binary systems have been assisted by: 1) the growing catalog of known systems, increasing from 33 to nearly 250 between the Merline et al. (2002) Asteroids III chapter and now, 2) the detailed study and long-term monitoring of individual systems such as 1999 KW4 and 1996 FG3, 3) the discovery of new binary system morphologies and triple systems, 4) and the discovery of unbound systems that appear to be end-states of binary dynamical evolutionary paths. Specifically for small bodies (diameter smaller than 10 km), these observations and discoveries have motivated theoretical work finding that thermal forces can efficiently drive the rotational disruption of small asteroids. Long-term monitoring has allowed studies to constrain the system's dynamical evolution by the combination of tides, thermal forces and rigid body physics. The outliers and split pairs have pushed the theoretical work to explore a wide range of evolutionary end-states.Comment: 42 pages, 4 figures, contribution to the Asteroids 4 boo

New Operators for Spin Net Gravity: Definitions and Consequences

Two operators for quantum gravity, angle and quasilocal energy, are briefly reviewed. The requirements to model semi-classical angles are discussed. To model semi-classical angles it is shown that the internal spins of the vertex must be very large, ~10^20.Comment: 7 pages, 2 figures, a talk at the MG9 Meeting, Rome, July 2-8, 200