CLR, a novel contrastive learning method using graph-based sample relationships. This approach outperformed traditional ...

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest ...

Together, we extend inferences to applications where the underlying network structure is also latent; that is, the adjacency matrix is unobserved. Here, we consider a Bayesian variant of the matrix ...