activity
20082026
most citedBipartite separability and non-local quantum operations on graphs

18 citations · 81 across the 38 of their papers we have counts for

collaborators
Showing 2015Show all

6 papers · 1 filter

cs.IR2015★ 1 cited

A Complex Network Approach for Collaborative Recommendation

Ranveer Singh, Bidyut Kr. Patra, Bibhas Adhikari

Collaborative filtering (CF) is the most widely used and successful approach for personalized service recommendations. Among the collaborative recommendation approaches, neighborho…

cs.DM2015★ 2 cited

Self-Coordinated Corona Graphs: a model for complex networks

Rohan Sharma, Bibhas Adhikari

Recently, real world networks having constant/shrinking diameter along with power-law degree distribution are observed and investigated in literature. Taking an inspiration from th…

math.SP2015

Structural and Spectral properties of Corona Graphs

Rohan Sharma, Bibhas Adhikari, Abhishek Mishra

Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication pheno…

quant-ph2015★ 12 cited

A graph theoretical approach to states and unitary operations

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee

Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applie…

math.NA2015

Structured inverse least-squares problem for structured matrices

Bibhas Adhikari, Rafikul Alam

Given a pair of matrices X and B and an appropriate class of structured matrices S, we provide a complete solution of the structured inverse least-squares problem $min_{A\in_S} \|A…

cs.SI2015

Context dependent preferential attachment model for complex networks

Pradumn Kumar Pandey, Bibhas Adhikari

In this paper, we propose a growing random complex network model, which we call context dependent preferential attachment model (CDPAM), when the preference of a new node to get at…