14 citations · 57 across the 43 of their papers we have counts for
11 papers · 1 filter
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…
The Generalized Friendship Paradox for Spectral Centralities
Rajat Subhra Hazra, Evgeny Verbitskiy
We revisit the classical friendship paradox which states that on an average ones friends have at least as many friends as oneself and generalize it to a variety of network centrali…
Voter model on heterogeneous directed networks
Luca Avena, Federico Capannoli, Diego Garlaschelli +1
We investigate the consensus dynamics of the voter model on large random graphs with heterogeneous and directed features, focusing in particular on networks with power-law degree d…
The friendship paradox for trees
Rajat Subhra Hazra, Frank den Hollander, Nelly Litvak +1
We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively…
Spectral properties of the Laplacian of Scale-Free Percolation models
Rajat Subhra Hazra, Nandan Malhotra
We consider scale-free percolation on a discrete torus of size . Conditionally on an i.i.d. sequence of Pareto weights with tail expon…
The spectrum of dense kernel-based random graphs
Alessandra Cipriani, Rajat Subhra Hazra, Nandan Malhotra +1
Kernel-based random graphs (KBRGs) are a broad class of random graph models that account for inhomogeneity among vertices. We consider KBRGs on a discrete dimensional torus $\m…
The multi-level friendship paradox for sparse random graphs
Rajat Subhra Hazra, Frank den Hollander, Azadeh Parvaneh
In Hazra, den Hollander and Parvaneh (2025) we analysed the friendship paradox for sparse random graphs. For four classes of random graphs we characterised the empirical distributi…
Parameter estimation in a dynamic Chung-Lu random graph
Rajat Subhra Hazra, Michel Mandjes, Jiesen Wang
In this paper we consider a dynamic version of the Chung-Lu random graph in which the edges alternate between being present and absent. The main contribution concerns a technique b…
Functional Central Limit Theorem for the simultaneous subgraph count of dynamic Erdős-Rényi random graphs
Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes
In this paper we consider a dynamic Erdős-Rényi random graph with independent identically distributed edge processes. Our aim is to describe the joint evolution of the entries of a…
The voter model on random regular graphs with random rewiring
Luca Avena, Rangel Baldasso, Rajat Subhra Hazra +2
We consider the voter model with binary opinions on a random regular graph with vertices of degree , subject to a rewiring dynamics in which pairs of edges are rewire…