Analysis of weighted networks

The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such weighted networks, which are often perceived as being harder to analyze than their unweighted counterparts. Here we point out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighted graphs to weighted ones as well. We give a number of examples of the method, including an algorithm for detecting community structure in weighted networks and a new and simple proof of the max-flow/min-cut theorem.Comment: 9 pages, 3 figure

A Secure Image Encryption Algorithm Based on Hill Cipher System

We present a technique of image encryption based on Hill cipher system that provides better security than existing approach of Bibhudendra Acharya et al. by rendering the image content completely scrambled using multiple self-invertible keys, block shuffling and a new developed pel transformation. The Hill cipher algorithm is one of the symmetric key algorithms having several advantages in encryption. However, the inverse of the matrix used for encrypting the plain text in this algorithm may not always exist. Moreover this algorithm is susceptible to known plain text attack. Our proposed algorithm is aimed at better encryption of all types of images even ones with uniform background and makes the image encryption scheme more secure

Resiliently evolving supply-demand networks

Peer reviewedPublisher PD

Maximum flow and topological structure of complex networks

The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$ and $t$. The average of $q$ over all node pairs with smaller degree $k_{\rm min}$ is $_{k_{\rm min}} \simeq c k_{\rm min}$ for large $k_{\rm min}$ with $c$ a constant implying that the statistics of $q$ is related to the degree distribution of the network. The disjoint paths between hub nodes are found to be distributed among the links belonging to the same edge-biconnected component, and $q$ can be estimated by the number of pairs of edge-biconnected links incident to the start and terminal node. The relative size of the giant edge-biconnected component of a network approximates to the coefficient $c$. The applicability of our results to real world networks is tested for the Internet at the autonomous system level.Comment: 7 pages, 4 figure

Magnetoresistance behavior of a ferromagnetic shape memory alloy: Ni_1.75Mn_1.25Ga

A negative-positive-negative switching behavior of magnetoresistance (MR) with temperature is observed in a ferromagnetic shape memory alloy Ni_1.75Mn_1.25Ga. In the austenitic phase between 300 and 120 K, MR is negative due to s-d scattering. Curiously, below 120K MR is positive, while at still lower temperatures in the martensitic phase, MR is negative again. The positive MR cannot be explained by Lorentz contribution and is related to a magnetic transition. Evidence for this is obtained from ab initio density functional theory, a decrease in magnetization and resistivity upturn at 120 K. Theory shows that a ferrimagnetic state with anti-ferromagnetic alignment between the local magnetic moments of the Mn atoms is the energetically favoured ground state. In the martensitic phase, there are two competing factors that govern the MR behavior: a dominant negative trend up to the saturation field due to the decrease of electron scattering at twin and domain boundaries; and a weaker positive trend due to the ferrimagnetic nature of the magnetic state. MR exhibits a hysteresis between heating and cooling that is related to the first order nature of the martensitic phase transition.Comment: 17 pages, 5 figures. Accepted in Phys. Rev.

Pareto Optimal Matchings in Many-to-Many Markets with Ties

We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses. Since this is the most general setting examined so far in the literature, our work unifies and generalizes several known results. Specifically, we characterize POMs and introduce the \emph{Generalized Serial Dictatorship Mechanism with Ties (GSDT)} that effectively handles ties via properties of network flows. We show that GSDT can generate all POMs using different priority orderings over the applicants, but it satisfies truthfulness only for certain such orderings. This shortcoming is not specific to our mechanism; we show that any mechanism generating all POMs in our setting is prone to strategic manipulation. This is in contrast to the one-to-one case (with or without ties), for which truthful mechanisms generating all POMs do exist

The Use of Resources in Resource Acquisition

The author considers the processes through which a firm can acquire resources and argues that its current stock of resources create asymmetries in competition for new resources. Two simple models illustrate how this can work through linkages on the demand and/or cost side. The normative implication is that firms should expand their resource portfolios by building on their existing resources; different firms will then acquire different new resources, and small initial heterogeneities will amplify over time

Random manifolds in non-linear resistor networks: Applications to varistors and superconductors

We show that current localization in polycrystalline varistors occurs on paths which are, usually, in the universality class of the directed polymer in a random medium. We also show that in ceramic superconductors, voltage localizes on a surface which maps to an Ising domain wall. The emergence of these manifolds is explained and their structure is illustrated using direct solution of non-linear resistor networks

First Passage Properties of the Erdos-Renyi Random Graph

We study the mean time for a random walk to traverse between two arbitrary sites of the Erdos-Renyi random graph. We develop an effective medium approximation that predicts that the mean first-passage time between pairs of nodes, as well as all moments of this first-passage time, are insensitive to the fraction p of occupied links. This prediction qualitatively agrees with numerical simulations away from the percolation threshold. Near the percolation threshold, the statistically meaningful quantity is the mean transit rate, namely, the inverse of the first-passage time. This rate varies non-monotonically with p near the percolation transition. Much of this behavior can be understood by simple heuristic arguments.Comment: 10 pages, 9 figures, 2-column revtex4 forma

An Agent-Based Approach to Self-Organized Production

The chapter describes the modeling of a material handling system with the production of individual units in a scheduled order. The units represent the agents in the model and are transported in the system which is abstracted as a directed graph. Since the hindrances of units on their path to the destination can lead to inefficiencies in the production, the blockages of units are to be reduced. Therefore, the units operate in the system by means of local interactions in the conveying elements and indirect interactions based on a measure of possible hindrances. If most of the units behave cooperatively ("socially"), the blockings in the system are reduced. A simulation based on the model shows the collective behavior of the units in the system. The transport processes in the simulation can be compared with the processes in a real plant, which gives conclusions about the consequencies for the production based on the superordinate planning.Comment: For related work see http://www.soms.ethz.c