Structure of Heterogeneous Networks

Heterogeneous networks play a key role in the evolution of communities and the decisions individuals make. These networks link different types of entities, for example, people and the events they attend. Network analysis algorithms usually project such networks unto simple graphs composed of entities of a single type. In the process, they conflate relations between entities of different types and loose important structural information. We develop a mathematical framework that can be used to compactly represent and analyze heterogeneous networks that combine multiple entity and link types. We generalize Bonacich centrality, which measures connectivity between nodes by the number of paths between them, to heterogeneous networks and use this measure to study network structure. Specifically, we extend the popular modularity-maximization method for community detection to use this centrality metric. We also rank nodes based on their connectivity to other nodes. One advantage of this centrality metric is that it has a tunable parameter we can use to set the length scale of interactions. By studying how rankings change with this parameter allows us to identify important nodes in the network. We apply the proposed method to analyze the structure of several heterogeneous networks. We show that exploiting additional sources of evidence corresponding to links between, as well as among, different entity types yields new insights into network structure

Upstream reciprocity in heterogeneous networks

Many mechanisms for the emergence and maintenance of altruistic behavior in social dilemma situations have been proposed. Indirect reciprocity is one such mechanism, where other-regarding actions of a player are eventually rewarded by other players with whom the original player has not interacted. The upstream reciprocity (also called generalized indirect reciprocity) is a type of indirect reciprocity and represents the concept that those helped by somebody will help other unspecified players. In spite of the evidence for the enhancement of helping behavior by upstream reciprocity in rats and humans, theoretical support for this mechanism is not strong. In the present study, we numerically investigate upstream reciprocity in heterogeneous contact networks, in which the players generally have different number of neighbors. We show that heterogeneous networks considerably enhance cooperation in a game of upstream reciprocity. In heterogeneous networks, the most generous strategy, by which a player helps a neighbor on being helped and in addition initiates helping behavior, first occupies hubs in a network and then disseminates to other players. The scenario to achieve enhanced altruism resembles that seen in the case of the Prisoner's Dilemma game in heterogeneous networks.Comment: 10 figures, Journal of Theoretical Biology, in press (2010

Chimera states in heterogeneous networks

Chimera states in networks of coupled oscillators occur when some fraction of the oscillators synchronise with one another, while the remaining oscillators are incoherent. Several groups have studied chimerae in networks of identical oscillators, but here we study these states in a heterogeneous model for which the natural frequencies of the oscillators are chosen from a distribution. We obtain exact results by reduction to a finite set of differential equations. We find that heterogeneity can destroy chimerae, destroy all states except chimerae, or destabilise chimerae in Hopf bifurcations, depending on the form of the heterogeneity.Comment: Revised text. To appear, Chao

Matchability of heterogeneous networks pairs

We consider the problem of graph matchability in non-identically distributed networks. In a general class of edge-independent networks, we demonstrate that graph matchability is almost surely lost when matching the networks directly, and is almost perfectly recovered when first centering the networks using Universal Singular Value Thresholding before matching. These theoretical results are then demonstrated in both real and synthetic simulation settings. We also recover analogous core-matchability results in a very general core-junk network model, wherein some vertices do not correspond between the graph pair.First author draf

Wireless Broadband Access: Policy Implications of Heterogeneous Networks

A wireless heterogeneous network can help increase the access transmission speed and contribute thereby to the broadband deployment policies of administrations and telecommunications operators. Given the technical particularities of wireless heterogeneous networks, the deployment of wireless heterogeneous networks raises a number of challenges that need to be addressed by regulatory authorities. This article analyses the following regulatory implications: standardisation and technology neutrality, spectrum management, market analysis, open access and infrastructure sharing, interconnection pricing and charging, broadband deployment policies, and privacy and security issues. --4G,heterogeneous networks,cooperative networks,spectrum management,regulation,wireless networks