14 citations · 57 across the 43 of their papers we have counts for
6 papers · 1 filter
Percolation on preferential attachment models
Rajat Subhra Hazra, Remco van der Hofstad, Rounak Ray
We study the percolation phase transition on preferential attachment models, in which vertices enter with edges and attach proportionally to their degree plus . We identify…
Largest Eigenvalue of the Configuration Model and Breaking of Ensemble Equivalence
Pierfrancesco Dionigi, Diego Garlaschelli, Rajat Subhra Hazra +1
We analyse the largest eigenvalue of the adjacency matrix of the configuration model with large degrees, where the latter are treated as hard constraints. In particular, we compute…
Limiting Spectra of inhomogeneous random graphs
Luca Avena, Rajat Subhra Hazra, Nandan Malhotra
We consider sparse inhomogeneous Erdős-Rényi random graph ensembles where edges are connected independently with probability . We assume that $p_{ij}= \varepsilon_N f(w_i,…
The friendship paradox for sparse random graphs
Rajat Subhra Hazra, Frank den Hollander, Azadeh Parvaneh
Let be an undirected finite graph on vertices labelled by . For , let be the friendship bias of vertex , define…
Meeting, coalescence and consensus time on random directed graphs
Luca Avena, Federico Capannoli, Rajat Subhra Hazra +1
We consider Markovian dynamics on a typical realization of the so-called Directed Configuration Model (DCM), that is, a random directed graph with prescribed in- and out-degrees. I…
Large deviation principle for the norm of the Laplacian matrix of inhomogeneous Erdős-Rényi random graphs
Rajat Subhra Hazra, Frank den Hollander, Maarten Markering
We consider an inhomogeneous Erdős-Rényi random graph with vertex set for which the pair of vertices , , is connected by an edge w…