IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/vyid10.1007_s10878-020-00574-4.html
   My bibliography  Save this article

Bipartite communities via spectral partitioning

Author

Listed:
  • Kelly B. Yancey

    (University of Maryland
    Institute for Defense Analyses/Center for Computing Sciences (IDA/CCS))

  • Matthew P. Yancey

    (Institute for Defense Analyses/Center for Computing Sciences (IDA/CCS))

Abstract

In this paper we are interested in finding communities with bipartite structure. A bipartite community is a pair of disjoint vertex sets S, $$S'$$S′ such that the number of edges with one endpoint in S and the other endpoint in $$S'$$S′ is “significantly more than expected.” This additional structure is natural to some applications of community detection. In fact, using other terminology, they have already been used to study correlation networks, social networks, and two distinct biological networks. In 2012 two groups independently [(1) Lee, Oveis Gharan, and Trevisan and (2) Louis, Raghavendra, Tetali, and Vempala] used higher eigenvalues of the normalized Laplacian to find an approximate solution to the k-sparse-cuts problem. In 2015 Liu generalized spectral methods for finding k communities to find k bipartite communities. Our approach improves the bounds on bipartite conductance (measure of strength of a bipartite community) found by Liu and also implies improvements to the original spectral methods by Lee et al. and Louis et al. We also highlight experimental results found when applying a practical algorithm derived from our theoretical results to three distinct real-world networks.

Suggested Citation

  • Kelly B. Yancey & Matthew P. Yancey, 0. "Bipartite communities via spectral partitioning," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-34.
    • Handle: RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00574-4
    DOI: 10.1007/s10878-020-00574-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00574-4
    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-020-00574-4?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.

    References listed on IDEAS

    as
    1. Marián Boguñá & Fragkiskos Papadopoulos & Dmitri Krioukov, 2010. "Sustaining the Internet with hyperbolic mapping," Nature Communications, Nature, vol. 1(1), pages 1-8, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wang, Zuxi & Wu, Yao & Li, Qingguang & Jin, Fengdong & Xiong, Wei, 2016. "Link prediction based on hyperbolic mapping with community structure for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 609-623.
    2. Ma, Lili & Jiang, Xin & Wu, Kaiyuan & Zhang, Zhanli & Tang, Shaoting & Zheng, Zhiming, 2012. "Surveying network community structure in the hidden metric space," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 371-378.
    3. Wang, Zuxi & Li, Qingguang & Xiong, Wei & Jin, Fengdong & Wu, Yao, 2016. "Fast community detection based on sector edge aggregation metric model in hyperbolic space," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 178-191.
    4. Antoine Allard & M Ángeles Serrano, 2020. "Navigable maps of structural brain networks across species," PLOS Computational Biology, Public Library of Science, vol. 16(2), pages 1-20, February.
    5. Wang, Zuxi & Li, Qingguang & Jin, Fengdong & Xiong, Wei & Wu, Yao, 2016. "Hyperbolic mapping of complex networks based on community information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 455(C), pages 104-119.
    6. Huang, Wei & Chen, Shengyong & Wang, Wanliang, 2014. "Navigation in spatial networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 132-154.
    7. Maksim Kitsak & Alexander Ganin & Ahmed Elmokashfi & Hongzhu Cui & Daniel A. Eisenberg & David L. Alderson & Dmitry Korkin & Igor Linkov, 2023. "Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping," Nature Communications, Nature, vol. 14(1), pages 1-9, December.
    8. Komjáthy, Júlia & Lodewijks, Bas, 2020. "Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs," Stochastic Processes and their Applications, Elsevier, vol. 130(3), pages 1309-1367.
    9. Maksim Kitsak & Ahmed Elmokashfi & Shlomo Havlin & Dmitri Krioukov, 2015. "Long-Range Correlations and Memory in the Dynamics of Internet Interdomain Routing," PLOS ONE, Public Library of Science, vol. 10(11), pages 1-12, November.
    10. Ma, Lili, 2019. "Studying node centrality based on the hidden hyperbolic metric space of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 426-434.
    11. Robert Jankowski & Antoine Allard & Marián Boguñá & M. Ángeles Serrano, 2023. "The D-Mercator method for the multidimensional hyperbolic embedding of real networks," Nature Communications, Nature, vol. 14(1), pages 1-11, December.
    12. Meliksah Turker & Haluk O. Bingol, 2023. "Multi-layer network approach in modeling epidemics in an urban town," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 96(2), pages 1-13, February.
    13. Kelly B. Yancey & Matthew P. Yancey, 2022. "Bipartite communities via spectral partitioning," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1995-2028, October.

    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::y::i::d:10.1007_s10878-020-00574-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.