Detection and Isolation of Link Failures under the Agreement Protocol

In this paper a property of the multi-agent consensus dynamics that relates the failure of links in the network to jump discontinuities in the derivatives of the output responses of the nodes is derived and verified analytically. At the next step, an algorithm for sensor placement is proposed, which would enable the designer to detect and isolate any link failures across the network based on the observed jump discontinuities in the derivatives of the responses of a subset of nodes. These results are explained through elaborative examples.Comment: 6 pages, 3 figures, IEEE Conference on Decision and Control, 201

Moment-Based Spectral Analysis of Random Graphs with Given Expected Degrees

In this paper, we analyze the limiting spectral distribution of the adjacency matrix of a random graph ensemble, proposed by Chung and Lu, in which a given expected degree sequence $\overline{w}_n^{^{T}} = (w^{(n)}_1,\ldots,w^{(n)}_n)$ is prescribed on the ensemble. Let $\mathbf{a}_{i,j} =1$ if there is an edge between the nodes $\{i,j\}$ and zero otherwise, and consider the normalized random adjacency matrix of the graph ensemble: $\mathbf{A}_n$ $=$ $[\mathbf{a}_{i,j}/\sqrt{n}]_{i,j=1}^{n}$. The empirical spectral distribution of $\mathbf{A}_n$ denoted by $\mathbf{F}_n(\mathord{\cdot})$ is the empirical measure putting a mass $1/n$ at each of the $n$ real eigenvalues of the symmetric matrix $\mathbf{A}_n$. Under some technical conditions on the expected degree sequence, we show that with probability one, $\mathbf{F}_n(\mathord{\cdot})$ converges weakly to a deterministic distribution $F(\mathord{\cdot})$. Furthermore, we fully characterize this distribution by providing explicit expressions for the moments of $F(\mathord{\cdot})$. We apply our results to well-known degree distributions, such as power-law and exponential. The asymptotic expressions of the spectral moments in each case provide significant insights about the bulk behavior of the eigenvalue spectrum

Effect of ethanolic extract of Adiantum capillus-veneris in comparison with Gentamicine on 3 pathogenic bacteria in vitro

Objectives: Adiantum capillus-veneris is one of herbs that has been used in traditional medicine of Iran and has mucolytic and antipyretic effects. Antibiotic resistancy is developing against severe bacteria,due to irrational prescription. Therefore, we assessed Adiantum capillus-veneris effects as a medicinal herb on three common bacteria. Methods: Ethanolic extract of Adiantum capillus-veneris was prepared by a pharmacology company with perculation method and was diluted in distilled water to 1/2,1/4 and 1/8 concentration.blank discs were placed in extracts for one day.Then ,the bacteria were cultured in muller hinton agar plate and the discs were placed on them.We used Gentamicine disc as control.After incubation in 37° for 24 hour, the diameter of no growth hallo around the discs were read. Results: The ethanolic extract of Adiantum capillus-veneris herb has no antimicrobial effects on the bacteria. Conclusion: Results of this study suggested that ethanolic extract of Adiantum capillus-veneris has no antimicrobial effects on this three bacteria mentioned above.Because this herb has been used in traditional medicine, we suggest more studies about it

Long ties accelerate noisy threshold-based contagions

Network structure can affect when and how widely new ideas, products, and behaviors are adopted. In widely-used models of biological contagion, interventions that randomly rewire edges (generally making them "longer") accelerate spread. However, there are other models relevant to social contagion, such as those motivated by myopic best-response in games with strategic complements, in which an individual's behavior is described by a threshold number of adopting neighbors above which adoption occurs (i.e., complex contagions). Recent work has argued that highly clustered, rather than random, networks facilitate spread of these complex contagions. Here we show that minor modifications to this model, which make it more realistic, reverse this result: we allow very rare below-threshold adoption, i.e., rarely adoption occurs when there is only one adopting neighbor. To model the trade-off between long and short edges we consider networks that are the union of cycle-power-$k$ graphs and random graphs on $n$ nodes. Allowing adoptions below threshold to occur with order $1/\sqrt{n}$ probability along some "short" cycle edges is enough to ensure that random rewiring accelerates spread. Simulations illustrate the robustness of these results to other commonly-posited models for noisy best-response behavior. Hypothetical interventions that randomly rewire existing edges or add random edges (versus adding "short", triad-closing edges) in hundreds of empirical social networks reduce time to spread. This revised conclusion suggests that those wanting to increase spread should induce formation of long ties, rather than triad-closing ties. More generally, this highlights the importance of noise in game-theoretic analyses of behavior