2017 IEEE International Symposium on Informationâ€¦

2017

Many networks in the real world are dynamic in nature: nodes enter, exit, and make and break connections with one another as time passes. Several random graph models of these networks are such thatâ€¦ (More)

Inferring the node arrival sequence from a snapshot of a dynamic network is an important problem, with applications ranging from identifying sources of contagion to flow of capital in financialâ€¦ (More)

In this paper we address the problem of finding top k eigenvalues and corresponding eigenvectors of symmetric graph matrices in networks in a distributed way. We propose a novel idea called complexâ€¦ (More)

Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet itâ€¦ (More)

Background
In the framework of network sampling, random walk (RW) based estimation techniques provide many pragmatic solutions while uncovering the unknown network as little as possible. Despiteâ€¦ (More)

We consider the shortest path problem in evolving graphs<lb>with restricted access, i.e., the changes are unknown and can be probed<lb>only by limited queries. The goal is to maintain a shortest pathâ€¦ (More)

Social networks contain clusters of nodes centered at high-degree nodes and surrounded by low-degree nodes. Such a cluster structure of the networks is caused by the dependence (social relationshipsâ€¦ (More)