Message passing optimization of Harmonic Influence Centrality

This paper proposes a new measure of node centrality in social networks, the Harmonic Influence Centrality, which emerges naturally in the study of social influence over networks. Using an intuitive analogy between social and electrical networks, we introduce a distributed message passing algorithm to compute the Harmonic Influence Centrality of each node. Although its design is based on theoretical results which assume the network to have no cycle, the algorithm can also be successfully applied on general graphs.Comment: 11 pages; 10 figures; to appear as a journal publicatio

Applications of Structural Balance in Signed Social Networks

We present measures, models and link prediction algorithms based on the structural balance in signed social networks. Certain social networks contain, in addition to the usual 'friend' links, 'enemy' links. These networks are called signed social networks. A classical and major concept for signed social networks is that of structural balance, i.e., the tendency of triangles to be 'balanced' towards including an even number of negative edges, such as friend-friend-friend and friend-enemy-enemy triangles. In this article, we introduce several new signed network analysis methods that exploit structural balance for measuring partial balance, for finding communities of people based on balance, for drawing signed social networks, and for solving the problem of link prediction. Notably, the introduced methods are based on the signed graph Laplacian and on the concept of signed resistance distances. We evaluate our methods on a collection of four signed social network datasets.Comment: 37 page

Reactanceless synthesized impedance bandpass amplifier

An active R bandpass filter network is formed by four operational amplifier stages interconnected by discrete resistances. One pair of stages synthesize an equivalent input impedance of an inductance (L sub eq) in parallel with a discrete resistance (R sub o) while the second pair of stages synthesizes an equivalent input impedance of a capacitance (C sub eq) serially coupled to another discrete resistance (R sub i) coupled in parallel with the first two stages. The equivalent input impedances aggregately define a tuned resonant bandpass filter in the roll-off regions of the operational amplifiers

Rearranging trees for robust consensus

In this paper, we use the H2 norm associated with a communication graph to characterize the robustness of consensus to noise. In particular, we restrict our attention to trees and by systematic attention to the effect of local changes in topology, we derive a partial ordering for undirected trees according to the H2 norm. Our approach for undirected trees provides a constructive method for deriving an ordering for directed trees. Further, our approach suggests a decentralized manner in which trees can be rearranged in order to improve their robustness.Comment: Submitted to CDC 201

An equivalent circuit for the evaluation of cross-country fault currents in medium voltage (MV) distribution networks

A Cross-Country Fault (CCF) is the simultaneous occurrence of a couple of Line-to-Ground Faults (LGFs), affecting different phases of same feeder or of two distinct ones, at different fault locations. CCFs are not uncommon in medium voltage (MV) public distribution networks operated with ungrounded or high-impedance neutral: despite the relatively small value of LGF current that is typical of such networks, CCF currents can be comparable to those that are found in Phase-To-Phase Faults, if the affected feeder(s) consists of cables. This occurs because the faulted cables' sheaths/screens provide a continuous, relatively low-impedance metallic return path to the fault currents. An accurate evaluation is in order, since the resulting current magnitudes can overheat sheaths/screens, endangering cable joints and other plastic sheaths. Such evaluation, however, requires the modeling of the whole MV network in the phase domain, simulating cable screens and their connections to the primary and secondary substation earth electrodes by suitable computer programs, such as ATP (which is the acronym for alternative transient program) or EMTP (the acronym for electromagnetic transient program), with substantial input data being involved. This paper presents a simplified yet accurate circuit model of the faulted MV network, taking into account the CCF currents' return path (cable sheaths/screens, ground conductors, and earthing resistances of secondary substations). The proposed CCF model can be implemented in a general-purpose simulation program, and it yields accurate fault currents estimates: for a 20 kV network case study, the comparison with accurate ATP simulations evidences mismatches mostly smaller than 2%, and never exceeding 5%

Absorbing Random Walks Interpolating Between Centrality Measures on Complex Networks

Centrality, which quantifies the "importance" of individual nodes, is among the most essential concepts in modern network theory. As there are many ways in which a node can be important, many different centrality measures are in use. Here, we concentrate on versions of the common betweenness and it closeness centralities. The former measures the fraction of paths between pairs of nodes that go through a given node, while the latter measures an average inverse distance between a particular node and all other nodes. Both centralities only consider shortest paths (i.e., geodesics) between pairs of nodes. Here we develop a method, based on absorbing Markov chains, that enables us to continuously interpolate both of these centrality measures away from the geodesic limit and toward a limit where no restriction is placed on the length of the paths the walkers can explore. At this second limit, the interpolated betweenness and closeness centralities reduce, respectively, to the well-known it current betweenness and resistance closeness (information) centralities. The method is tested numerically on four real networks, revealing complex changes in node centrality rankings with respect to the value of the interpolation parameter. Non-monotonic betweenness behaviors are found to characterize nodes that lie close to inter-community boundaries in the studied networks