Discovering the structure of complex networks by minimizing cyclic bandwidth sum

Getting a labeling of vertices close to the structure of the graph has been proved to be of interest in many applications e.g., to follow smooth signals indexed by the vertices of the network. This question can be related to a graph labeling problem known as the cyclic bandwidth sum problem. It consists in finding a labeling of the vertices of an undirected and unweighted graph with distinct integers such that the sum of (cyclic) difference of labels of adjacent vertices is minimized. Although theoretical results exist that give optimal value of cyclic bandwidth sum for standard graphs, there are neither results in the general case, nor explicit methods to reach this optimal result. In addition to this lack of theoretical knowledge, only a few methods have been proposed to approximately solve this problem. In this paper, we introduce a new heuristic to find an approximate solution for the cyclic bandwidth sum problem, by following the structure of the graph. The heuristic is a two-step algorithm: the first step consists of traversing the graph to find a set of paths which follow the structure of the graph, using a similarity criterion based on the Jaccard index to jump from one vertex to the next one. The second step is the merging of all obtained paths, based on a greedy approach that extends a partial solution by inserting a new path at the position that minimizes the cyclic bandwidth sum. The effectiveness of the proposed heuristic, both in terms of performance and time execution, is shown through experiments on graphs whose optimal value of CBS is known as well as on real-world networks, where the consistence between labeling and topology is highlighted. An extension to weighted graphs is also proposed.

[1]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[2]  Takaomi Shigehara,et al.  From networks to time series. , 2012, Physical review letters.

[3]  Gabriel Ramírez-Torres,et al.  A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem , 2012, MICAI.

[4]  Christos H. Papadimitriou,et al.  The NP-Completeness of the bandwidth minimization problem , 1976, Computing.

[5]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[6]  S Koilraj,et al.  Labelings of graphs , 2008 .

[7]  Anna Scaglione,et al.  Models for the Diffusion of Beliefs in Social Networks: An Overview , 2013, IEEE Signal Processing Magazine.

[8]  Céline Robardet,et al.  Networks as signals, with an application to a bike sharing system , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[9]  Hao Jianxiu Cyclic bandwidth sum of graphs , 2001 .

[10]  Michael Small,et al.  Time-series analysis of networks: exploring the structure with random walks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Alain Barrat,et al.  Contact Patterns among High School Students , 2014, PloS one.

[12]  Uriel Feige,et al.  Coping with the NP-Hardness of the Graph Bandwidth Problem , 2000, SWAT.

[13]  Iain S. Duff,et al.  Users' guide for the Harwell-Boeing sparse matrix collection (Release 1) , 1992 .

[14]  Annalisa Massini,et al.  Antibandwidth of Complete k-Ary Trees , 2006, Electron. Notes Discret. Math..

[15]  L. Amaral,et al.  Duality between Time Series and Networks , 2011, PloS one.

[16]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[17]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[18]  Jing-Ho Yan,et al.  A study on cyclic bandwidth sum , 2007, J. Comb. Optim..

[19]  P. Jaccard,et al.  Etude comparative de la distribution florale dans une portion des Alpes et des Jura , 1901 .

[20]  P. Groenen,et al.  Modern multidimensional scaling , 1996 .

[21]  Pascal Frossard,et al.  The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.

[22]  Patrick Flandrin,et al.  Tracking of a dynamic graph using a signal theory approach : application to the study of a bike sharing system , 2013 .

[23]  P. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 1999 .

[24]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[25]  Francisco Gortázar,et al.  A hybrid metaheuristic for the cyclic antibandwidth problem , 2013, Knowl. Based Syst..

[26]  Dominique de Caen,et al.  An upper bound on the sum of squares of degrees in a graph , 1998, Discret. Math..

[27]  Pierre Borgnat,et al.  Transformation de graphes dynamiques en signaux non stationnaires , 2013 .

[28]  Gursaran,et al.  General variable neighbourhood search for cyclic bandwidth sum minimization problem , 2012, 2012 Students Conference on Engineering and Systems.

[29]  Dharna Satsangi DESIGN AND DEVELOPMENT OF METAHEURISTIC TECHNIQUES FOR SOME GRAPH LAYOUT PROBLEMS , 2013 .

[30]  Lin Yixun,et al.  THE CYCLIC BANDWIDTH PROBLEM , 1994 .

[31]  Rodrigo A. Botafogo Cluster analysis for hypertext systems , 1993, SIGIR.

[32]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[33]  Annalisa Massini,et al.  Antibandwidth of complete k-ary trees , 2009, Discret. Math..

[34]  Shang-Hua Teng,et al.  How Good is Recursive Bisection? , 1997, SIAM J. Sci. Comput..

[35]  Marc Moonen,et al.  Seeing the Bigger Picture: How Nodes Can Learn Their Place Within a Complex Ad Hoc Network Topology , 2013, IEEE Signal Processing Magazine.

[36]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[37]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[38]  Patrick Flandrin,et al.  Nonnegative matrix factorization to find features in temporal networks , 2014, ICASSP.

[39]  Kinkar Ch. Das Sharp bounds for the sum of the squares of the degrees of a graph , 2003 .

[40]  Soummya Kar,et al.  Consensus + innovations distributed inference over networks: cooperation and sensing in networked systems , 2013, IEEE Signal Processing Magazine.