Self-organized Emergence of Navigability on Small-World Networks

This paper mainly investigates why small-world networks are navigable and how to navigate small-world networks. We find that the navigability can naturally emerge from self-organization in the absence of prior knowledge about underlying reference frames of networks. Through a process of information exchange and accumulation on networks, a hidden metric space for navigation on networks is constructed. Navigation based on distances between vertices in the hidden metric space can efficiently deliver messages on small-world networks, in which long range connections play an important role. Numerical simulations further suggest that high cluster coefficient and low diameter are both necessary for navigability. These interesting results provide profound insights into scalable routing on the Internet due to its distributed and localized requirements.Comment: 3 figure

Algorithmic information and incompressibility of families of multidimensional networks

This article presents a theoretical investigation of string-based generalized representations of families of finite networks in a multidimensional space. First, we study the recursive labeling of networks with (finite) arbitrary node dimensions (or aspects), such as time instants or layers. In particular, we study these networks that are formalized in the form of multiaspect graphs. We show that, unlike classical graphs, the algorithmic information of a multidimensional network is not in general dominated by the algorithmic information of the binary sequence that determines the presence or absence of edges. This universal algorithmic approach sets limitations and conditions for irreducible information content analysis in comparing networks with a large number of dimensions, such as multilayer networks. Nevertheless, we show that there are particular cases of infinite nesting families of finite multidimensional networks with a unified recursive labeling such that each member of these families is incompressible. From these results, we study network topological properties and equivalences in irreducible information content of multidimensional networks in comparison to their isomorphic classical graph.Comment: Extended preprint version of the pape

Cooperative Caching in Space Information Networks

publishedVersio

HySIM: A Hybrid Spectrum and Information Market for TV White Space Networks

We propose a hybrid spectrum and information market for a database-assisted TV white space network, where the geo-location database serves as both a spectrum market platform and an information market platform. We study the inter- actions among the database operator, the spectrum licensee, and unlicensed users systematically, using a three-layer hierarchical model. In Layer I, the database and the licensee negotiate the commission fee that the licensee pays for using the spectrum market platform. In Layer II, the database and the licensee compete for selling information or channels to unlicensed users. In Layer III, unlicensed users determine whether they should buy the exclusive usage right of licensed channels from the licensee, or the information regarding unlicensed channels from the database. Analyzing such a three-layer model is challenging due to the co-existence of both positive and negative network externalities in the information market. We characterize how the network externalities affect the equilibrium behaviours of all parties involved. Our numerical results show that the proposed hybrid market can improve the network profit up to 87%, compared with a pure information market. Meanwhile, the achieved network profit is very close to the coordinated benchmark solution (the gap is less than 4% in our simulation).Comment: This manuscript serves as the online technical report of the article published in IEEE International Conference on Computer Communications (INFOCOM), 201

Spectrum-based deep neural networks for fraud detection

In this paper, we focus on fraud detection on a signed graph with only a small set of labeled training data. We propose a novel framework that combines deep neural networks and spectral graph analysis. In particular, we use the node projection (called as spectral coordinate) in the low dimensional spectral space of the graph's adjacency matrix as input of deep neural networks. Spectral coordinates in the spectral space capture the most useful topology information of the network. Due to the small dimension of spectral coordinates (compared with the dimension of the adjacency matrix derived from a graph), training deep neural networks becomes feasible. We develop and evaluate two neural networks, deep autoencoder and convolutional neural network, in our fraud detection framework. Experimental results on a real signed graph show that our spectrum based deep neural networks are effective in fraud detection

Robustness and Closeness Centrality for Self-Organized and Planned Cities

Street networks are important infrastructural transportation systems that cover a great part of the planet. It is now widely accepted that transportation properties of street networks are better understood in the interplay between the street network itself and the so called \textit{information} or \textit{dual network}, which embeds the topology of the street network navigation system. In this work, we present a novel robustness analysis, based on the interaction between the primal and the dual transportation layer for two large metropolis, London and Chicago, thus considering the structural differences to intentional attacks for \textit{self-organized} and planned cities. We elaborate the results through an accurate closeness centrality analysis in the Euclidean space and in the relationship between primal and dual space. Interestingly enough, we find that even if the considered planar graphs display very distinct properties, the information space induce them to converge toward systems which are similar in terms of transportation properties