Bipartitioning of directed and mixed random graphs

DOI10.1088/1742-5468/ab3280zbMath1456.05148arXiv1901.09298OpenAlexW2911379472MaRDI QIDQ5132545

Manuel A. Barroso, Dorota Lipowska, António Luis Ferreira, Adam Lipowski

Publication date: 12 November 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.09298

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering and community detection in directed networks: a survey
• On the complexity of finding balanced oneway cuts
• Replica symmetry breaking in short-range spin glasses: Theoretical foundations and numerical evidences
• Laplacians and the Cheeger inequality for directed graphs
• The mixing time of the giant component of a random graph
• Belief propagation for graph partitioning
• Directed metrics and directed graph partitioning problems
• The peculiar phase structure of random graph bisection
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation
• Graph bipartitioning and statistical mechanics
• Optimization problems and replica symmetry breaking in finite connectivity spin glasses
• Bisecting sparse random graphs
• Cut Size Statistics of Graph Bisection Heuristics
• Gibbs states and the set of solutions of random constraint satisfaction problems

This page was built for publication: Bipartitioning of directed and mixed random graphs