14 citations · 57 across the 43 of their papers we have counts for
63 papers
The Generalized Friendship Paradox for Eigenvectors
Bishakh Bhattacharya, Arijit Chakrabarty, Rajat Subhra Hazra
In this paper, we investigate the generalized friendship paradox for eigenvectors (alternatively called the eigen friendship paradox and abbreviated hereafter as EFP) in the settin…
Renormalisation of Inhomogeneous Random Graphs
Luca Avena, Diego Garlaschelli, Rajat Subhra Hazra +1
We consider inhomogeneous random graphs in which vertices are assigned i.i.d.\ random weights, pairs of distinct vertices are connected by an edge independently with a probability…
Spectrum of Directed Inhomogeneous Random Graphs
Rajat Subhra Hazra, Giacomo Passuello
We study the spectrum of the adjacency matrix of directed inhomogeneous random graphs on vertices. We assume that has independent entries and diverging average degr…
Outlier eigenvalues and eigenvectors of generalized Wigner matrices with finite-rank perturbations
Bishakh Bhattacharya, Arijit Chakrabarty, Rajat Subhra Hazra
A generalized Wigner matrix perturbed by a finite-rank deterministic matrix is considered. The fluctuations of the largest eigenvalues, which emerge outside the bulk of the spectru…
Functional central limit theorem for subgraph counts in a dynamic random connection model
Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes +1
We prove a functional central limit theorem for subgraph counts in a dynamic version of the random connection model. To establish tightness, we develop a dynamic extension of the c…
Spectra of random graphs with discrete scale invariance
Alessio Catanzaro, Rajat Subhra Hazra, Diego Garlaschelli
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance…