IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i3d10.1007_s10878-025-01262-x.html
   My bibliography  Save this article

Testing Higher-order Clusterability on Graphs

Author

Listed:
  • Yifei Li

    (Harbin Institute of Technology
    Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences)

  • Donghua Yang

    (Harbin Institute of Technology)

  • Jianzhong Li

    (Harbin Institute of Technology
    Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences)

Abstract

Analysis of higher-order organizations, represented as small connected subgraphs, is a fundamental task on complex networks. This paper studies a new problem of testing higher-order clusterability: given neighbor query access to an undirected graph, can we judge whether this graph can be partitioned into a few clusters of highly-connected cliques? This problem is an extension of the former work proposed by Czumaj et al. (STOC’ 15), who recognized cluster structure on graphs using the framework of property testing. In this paper, the problem of testing whether a well-defined higher-order cluster exists is first defined. Then, an $$\varOmega (\sqrt{n})$$ Ω ( n ) query lower bound of this problem is given. After that, a baseline algorithm is provided by an edge-cluster tester on k-clique dual graph. Finally, an optimized $$\tilde{O}(\sqrt{n})$$ O ~ ( n ) -time algorithm is developed for testing clusterability based on triangles.

Suggested Citation

  • Yifei Li & Donghua Yang & Jianzhong Li, 2025. "Testing Higher-order Clusterability on Graphs," Journal of Combinatorial Optimization, Springer, vol. 49(3), pages 1-21, April.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01262-x
    DOI: 10.1007/s10878-025-01262-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01262-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01262-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01262-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.