Autoregressive cascades on random networks

A network cascade model that captures many real-life correlated node failures in large networks via load redistribution is studied. The considered model is well suited for networks where physical quantities are transmitted, e.g., studying large scale outages in electrical power grids, gridlocks in road networks, and connectivity breakdown in communication networks, etc. For this model, a phase transition is established, i.e., existence of critical thresholds above or below which a small number of node failures lead to a global cascade of network failures or not. Theoretical bounds are obtained for the phase transition on the critical capacity parameter that determines the threshold above and below which cascade appears or disappears, respectively, that are shown to closely follow numerical simulation results. (C) 2015 Elsevier B.V. All rights reserved.

Autoregressive cascades on random networks

A network cascade model that captures many real-life correlated node failures in large networks via load redistribution is studied. The considered model is well suited for networks where physical quantities are transmitted, e.g., studying large scale outages in electrical power grids, gridlocks in road networks, and connectivity breakdown in communication networks, etc. For this model, a phase transition is established, i.e., existence of critical thresholds above or below which a small number of node failures lead to a global cascade of network failures or not. Theoretical bounds are obtained for the phase transition on the critical capacity parameter that determines the threshold above and below which cascade appears or disappears, respectively, that are shown to closely follow numerical simulation results. (C) 2015 Elsevier B.V. All rights reserved.

Complex patterns arise through spontaneous symmetry breaking in dense homogeneous networks of neural oscillators

There has been much interest in understanding collective dynamics in networks of brain regions due to their role in behavior and cognitive function. Here we show that a simple, homogeneous system of densely connected oscillators, representing the aggregate activity of local brain regions, can exhibit a rich variety of dynamical patterns emerging via spontaneous breaking of permutation or translational symmetries. Upon removing just a few connections, we observe a striking departure from the mean-field limit in terms of the collective dynamics, which implies that the sparsity of these networks may have very important consequences. Our results suggest that the origins of some of the complicated activity patterns seen in the brain may be understood even with simple connection topologies.

Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale-free networks. Results show that more resource is allocated to high-degree nodes in the case of scale-free networks, but medium-degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal strategy and quantify the improvement offered by the optimal strategy over the static and bang-bang control strategies. The effect of the time-varying spreading rate on the controls is explored as the interest level of the population in the subject of the campaign may change over time. We show the existence of a solution to the formulated optimal control problem, which has nonlinear isoperimetric constraints, using novel techniques that is general and can be used in other similar optimal control problems. This work may be of interest to political, social awareness, or crowdfunding campaigners and product marketing managers, and with some modifications may be used for mitigating biological epidemics.

Stabilization of Cu-7 clusters in azide networks: syntheses, structures and magnetic behaviour

Two new azide bridged copper(II) coordination polymer compounds, Cu-7(N-3)(14)(C3H10N2)(C4H13N3)]n (I) and Cu-7(N-3)(14)(C3H10N2)(C5H15N3)(2)](n) (II) where C3H10N2 = 1,2-diaminopropane (1,2-DAP); C4H13N3 = di-ethylenetriamine (DETA); C5H15N3 = N-2-aminoethyl-1,3-propanediamine (AEDAP)] were prepared by employing a room temperature diffusion technique involving three layers. Single crystal studies reveal that both compounds I and II, have similar connectivity forming Cu7 clusters through end-on (EO) bonding of the azide. The Cu-7 clusters are connected through end-to-end (EE) connectivity of the azides forming three-dimensional structures. Magnetic studies confirmed the ferromagnetic interactions within the Cu-7 units and revealed the occurrence of concomitant ferro- and antiferro-magnetic interactions between these clusters. As a result I behaves as a weak-ferromagnet with T-C = 10 K.

Cost effective campaigning in social networks

Campaigners are increasingly using online social networking platforms for promoting products, ideas and information. A popular method of promoting a product or even an idea is incentivizing individuals to evangelize the idea vigorously by providing them with referral rewards in the form of discounts, cash backs, or social recognition. Due to budget constraints on scarce resources such as money and manpower, it may not be possible to provide incentives for the entire population, and hence incentives need to be allocated judiciously to appropriate individuals for ensuring the highest possible outreach size. We aim to do the same by formulating and solving an optimization problem using percolation theory. In particular, we compute the set of individuals that are provided incentives for minimizing the expected cost while ensuring a given outreach size. We also solve the problem of computing the set of individuals to be incentivized for maximizing the outreach size for given cost budget. The optimization problem turns out to be non trivial; it involves quantities that need to be computed by numerically solving a fixed point equation. Our primary contribution is, that for a fairly general cost structure, we show that the optimization problems can be solved by solving a simple linear program. We believe that our approach of using percolation theory to formulate an optimization problem is the first of its kind. (C) 2016 Elsevier B.V. All rights reserved.

RPRDC: Reliable Proliferation Routing with low Duty-Cycle in Wireless Sensor Networks

Ensuring reliable energy efficient data communication in resource constrained Wireless Sensor Networks (WSNs) is of primary concern. Traditionally, two types of re-transmission have been proposed for the data-loss, namely, End-to-End loss recovery (E2E) and per hop. In these mechanisms, lost packets are re-transmitted from a source node or an intermediate node with a low success rate. The proliferation routing(1) for QoS provisioning in WSNs low End-to-End reliability, not energy efficient and works only for transmissions from sensors to sink. This paper proposes a Reliable Proliferation Routing with low Duty Cycle RPRDC] in WSNs that integrates three core concepts namely, (i) reliable path finder, (ii) a randomized dispersity, and (iii) forwarding. Simulation results demonstrates that packet successful delivery rate can be maintained upto 93% in RPRDC and outperform Proliferation Routing(1). (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

PIB: Profiling Influential Blogger in Online Social Networks, A Knowledge Driven Data Mining Approach

Online Social Networks (OSNs) facilitate to create and spread information easily and rapidly, influencing others to participate and propagandize. This work proposes a novel method of profiling Influential Blogger (IB) based on the activities performed on one's blog documents who influences various other bloggers in Social Blog Network (SBN). After constructing a social blogging site, a SBN is analyzed with appropriate parameters to get the Influential Blog Power (IBP) of each blogger in the network and demonstrate that profiling IB is adequate and accurate. The proposed Profiling Influential Blogger (PIB) Algorithm survival rate of IB is high and stable. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Parameters Inversion of Fluid-Saturated Porous Media Based on Neural Networks

The multi-layers feedforward neural network is used for inversion of material constants of fluid-saturated porous media. The direct analysis of fluid-saturated porous media is carried out with the boundary element method. The dynamic displacement responses obtained from direct analysis for prescribed material parameters constitute the sample sets training neural network. By virtue of the effective L-M training algorithm and the Tikhonov regularization method as well as the GCV method for an appropriate selection of regularization parameter, the inverse mapping from dynamic displacement responses to material constants is performed. Numerical examples demonstrate the validity of the neural network method.