Observable Graphs

An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his position only from time to time, the graph is said to be \emph{partly observable}. Observability in graphs is desirable in situations where autonomous agents are moving on a network and one wants to localize them (or the agent wants to localize himself) with limited information. In this paper, we completely characterize observable and partly observable graphs and show how these concepts relate to observable discrete event systems and to local automata. Based on these characterizations, we provide polynomial time algorithms to decide observability, to decide partial observability, and to compute the minimal number of observations necessary for finding the position of an agent. In particular we prove that in the worst case this minimal number of observations increases quadratically with the number of nodes in the graph. From this it follows that it may be necessary for an agent to pass through the same node several times before he is finally able to determine his position in the graph. We then consider the more difficult question of assigning colors to a graph so as to make it observable and we prove that two different versions of this problem are NP-complete.Comment: 15 pages, 8 figure

Observations and a model of gravity-wave variability in the middle atmosphere

A major goal was to determine what portion of the gravity-wave frequency spectrum accounted for the majority of the momentum flux and divergence, as this has important implications for the middle atmosphere response. It was found that approx. 70% of the total flux and divergence was due to wave motions with observed periods less than 1 hour, consistent with expectations based on the shape of the observed gravity-wave spectrum (FrItts, 1984). This dominance of the momentum flux and divergence by high-frequency motions implies a potential for the modulation of those quantities by large-amplitude motions at lower frequencies. A second, striking aspect of the velocity and momentum flux data is its dramatic diurnal variability, particularly at certain levels. This variability is illustrated with the momentum flux, computed in 8-hr blocks. The dominant contributions here are due to waves with periods less than 1 hr. The variability with height and size of the mean square velocity in the west beam and the momentum flux, energed over the 3-day period. A detailed analysis of the various tidal motions present during this data interval was performed, and it was determined that variations in the zontal wind profile imposed by the diurnal tidal motion are probably responsible for the modulation of the gravity-wave amplitudes and momentum fluxes

Mechanics of large folds in thin interfacial films

A thin film at a liquid interface responds to uniaxial confinement by wrinkling and then by folding; its shape and energy have been computed exactly before self contact. Here, we address the mechanics of large folds, i.e. folds that absorb a length much larger than the wrinkle wavelength. With scaling arguments and numerical simulations, we show that the antisymmetric fold is energetically favorable and can absorb any excess length at zero pressure. Then, motivated by puzzles arising in the comparison of this simple model to experiments on lipid monolayers and capillary rafts, we discuss how to incorporate film weight, self-adhesion and energy dissipation.Comment: 5 pages, 3 figure

The Richtmyer–Meshkov instability in magnetohydrodynamics

In ideal magnetohydrodynamics (MHD), the Richtmyer–Meshkov instability can be suppressed by the presence of a magnetic field. The interface still undergoes some growth, but this is bounded for a finite magnetic field. A model for this flow has been developed by considering the stability of an impulsively accelerated, sinusoidally perturbed density interface in the presence of a magnetic field that is parallel to the acceleration. This was accomplished by analytically solving the linearized initial value problem in the framework of ideal incompressible MHD. To assess the performance of the model, its predictions are compared to results obtained from numerical simulation of impulse driven linearized, shock driven linearized, and nonlinear compressible MHD for a variety of cases. It is shown that the analytical linear model collapses the data from the simulations well. The predicted interface behavior well approximates that seen in compressible linearized simulations when the shock strength, magnetic field strength, and perturbation amplitude are small. For such cases, the agreement with interface behavior that occurs in nonlinear simulations is also reasonable. The effects of increasing shock strength, magnetic field strength, and perturbation amplitude on both the flow and the performance of the model are investigated. This results in a detailed exposition of the features and behavior of the MHD Richtmyer–Meshkov flow. For strong shocks, large initial perturbation amplitudes, and strong magnetic fields, the linear model may give a rough estimate of the interface behavior, but it is not quantitatively accurate. In all cases examined the accuracy of the model is quantified and the flow physics underlying any discrepancies is examine

Dynamics of latent voters

We study the effect of latency on binary-choice opinion formation models. Latency is introduced into the models as an additional dynamic rule: after a voter changes its opinion, it enters a waiting period of stochastic length where no further changes take place. We first focus on the voter model and show that as a result of introducing latency, the average magnetization is not conserved, and the system is driven toward zero magnetization, independently of initial conditions. The model is studied analytically in the mean-field case and by simulations in one dimension. We also address the behavior of the Majority Rule model with added latency, and show that the competition between imitation and latency leads to a rich phenomenology

Efficient algorithms for deciding the type of growth of products of integer matrices

For a given finite set $\Sigma$ of matrices with nonnegative integer entries we study the growth of $$\max_t(\Sigma) = \max\{\|A_{1}... A_{t}\|: A_i \in \Sigma\}.$$ We show how to determine in polynomial time whether the growth with $t$ is bounded, polynomial, or exponential, and we characterize precisely all possible behaviors.Comment: 20 pages, 4 figures, submitted to LA

Capillarity-Driven Flows at the Continuum Limit

We experimentally investigate the dynamics of capillary-driven flows at the nanoscale, using an original platform that combines nanoscale pores and microfluidic features. Our results show a coherent picture across multiple experiments including imbibition, poroelastic transient flows, and a drying-based method that we introduce. In particular, we exploit extreme drying stresses - up to 100 MPa of tension - to drive nanoflows and provide quantitative tests of continuum theories of fluid mechanics and thermodynamics (e.g. Kelvin-Laplace equation) across an unprecedented range. We isolate the breakdown of continuum as a negative slip length of molecular dimension.Comment: 5 pages; 4 figure

Flow Motifs Reveal Limitations of the Static Framework to Represent Human interactions

Networks are commonly used to define underlying interaction structures where infections, information, or other quantities may spread. Although the standard approach has been to aggregate all links into a static structure, some studies suggest that the time order in which the links are established may alter the dynamics of spreading. In this paper, we study the impact of the time ordering in the limits of flow on various empirical temporal networks. By using a random walk dynamics, we estimate the flow on links and convert the original undirected network (temporal and static) into a directed flow network. We then introduce the concept of flow motifs and quantify the divergence in the representativity of motifs when using the temporal and static frameworks. We find that the regularity of contacts and persistence of vertices (common in email communication and face-to-face interactions) result on little differences in the limits of flow for both frameworks. On the other hand, in the case of communication within a dating site (and of a sexual network), the flow between vertices changes significantly in the temporal framework such that the static approximation poorly represents the structure of contacts. We have also observed that cliques with 3 and 4 vertices con- taining only low-flow links are more represented than the same cliques with all high-flow links. The representativity of these low-flow cliques is higher in the temporal framework. Our results suggest that the flow between vertices connected in cliques depend on the topological context in which they are placed and in the time sequence in which the links are established. The structure of the clique alone does not completely characterize the potential of flow between the vertices