A non-backtracking method for long matrix and tensor completion

L Stephan, Y Zhu - The Thirty Seventh Annual Conference …, 2024 - proceedings.mlr.press
We consider the problem of low-rank rectangular matrix completion in the regime where the
matrix $ M $ of size $ n\times m $ is “long", ie, the aspect ratio $ m/n $ diverges to infinity …

Strong consistency guarantees for clustering high-dimensional bipartite graphs with the spectral method

G Braun - Electronic Journal of Statistics, 2024 - projecteuclid.org
We investigate the problem of clustering bipartite graphs using a simple spectral method
within the framework of the Bipartite Stochastic Block Model (BiSBM), a popular model for …

An Optimisation Method of Construction for War** Copper Plates and Engines Using Complete Block Designs with Some Special Types of Graphs

P Karthikeyan, K Kalaiselvi… - … in Materials Science …, 2023 - Wiley Online Library
The application of bipartite and regular graphs plays a vital role in the area of engineering,
mathematical sciences, design of experiments, and medical fields. This study proposes an …

Efficient iterative methods for clustering and matching problems on graphs

G Braun - 2022 - hal.science
Graph structured datasets arise naturally in many fields including biology with protein-to-
protein interaction networks, ecology with predator-prey networks and economy with …

[PDF][PDF] ED MADIS 631-Université de Lille-INRIA

MIEP DES PROBLÈMES - 2022 - pepite-depot.univ-lille.fr
Graph-structured datasets arise naturally in many fields including biology with protein-to-
protein interaction networks, ecology with predator-prey networks, and economy with …

[PDF][PDF] Clustering Bipartite Graphs with the Generalized Power Method

G Braun, H Tyagi - dyn.phys.northwestern.edu
The interactions between objects of two different types can be naturally encoded as a
bipartite graph where nodes correspond to objects and edges to the links between the …

[CITACE][C] A non-backtracking method for long matrix completion