1 citations · 1 across the 4 of their papers we have counts for
5 papers
Nearest Graph Laplacians with Prescribed Connected Components: A Convex Framework for Network Reconstruction
Udit Raj, Sudeepto Bhattacharya, Prince Kanhya
We study the problem of constructing the nearest graph Laplacian matrix to a given Laplacian while enforcing a prescribed connected-component structure. Let the vertex set be parti…
Combinatorial metaplexes and centrality indices for identifying higher-order interactions
Hiren J. Dhameliya, Udit Raj, Sudeepto Bhattacharya
Complex systems consist of interacting units whose interactions may be pairwise, involving two units, or higher-order, involving more than two units simultaneously. Graphs capture…
Construction of the Nearest Nonnegative Hankel Matrix for a Prescribed Eigenpair
Prince Kanhya, Udit Raj
We study the problem of determining whether a prescribed eigenpair can be made an exact eigenpair of a nonnegative Hankel matrix through the smallest possible structured pe…
Study of higher-order interactions in unweighted, undirected networks using persistent homology
Udit Raj, Slobodan Maletić, Sudeepto Bhattacharya
Persistent homology has been studied to better understand the structural properties and topology features of weighted networks. It can reveal hidden layers of information about the…
Simplicial structures in ecological networks
Udit Raj, Shashankaditya Upadhyay, Moumita Karmakar +1
An ecological network is a formal representation of a specific type of interaction in a corresponding ecosystem. Such networks have traditionally been modelled as encoding exclusiv…