[BOOK][B] Recent advances in graph partitioning
Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …
A survey of graph layout problems
Graph layout problems are a particular class of combinatorial optimization problems whose
goal is to find a linear layout of an input graph in such way that a certain objective cost is …
goal is to find a linear layout of an input graph in such way that a certain objective cost is …
Exact recovery in the stochastic block model
The stochastic block model with two communities, or equivalently the planted bisection
model, is a popular model of random graph exhibiting a cluster behavior. In the symmetric …
model, is a popular model of random graph exhibiting a cluster behavior. In the symmetric …
Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery
E Abbe, C Sandon - 2015 IEEE 56th Annual Symposium on …, 2015 - ieeexplore.ieee.org
New phase transition phenomena have recently been discovered for the stochastic block
model, for the special case of two non-overlap** symmetric communities. This gives raise …
model, for the special case of two non-overlap** symmetric communities. This gives raise …
[BOOK][B] Finite Markov chains and algorithmic applications
O Häggström - 2002 - books.google.com
Based on a lecture course given at Chalmers University of Technology, this 2002 book is
ideal for advanced undergraduate or beginning graduate students. The author first develops …
ideal for advanced undergraduate or beginning graduate students. The author first develops …
Reconstruction and estimation in the planted partition model
The planted partition model (also known as the stochastic blockmodel) is a classical cluster-
exhibiting random graph model that has been extensively studied in statistics, physics, and …
exhibiting random graph model that has been extensively studied in statistics, physics, and …
[BOOK][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
A proof of the block model threshold conjecture
We study a random graph model called the “stochastic block model” in statistics and the
“planted partition model” in theoretical computer science. In its simplest form, this is a …
“planted partition model” in theoretical computer science. In its simplest form, this is a …
Algorithms for graph partitioning on the planted partition model
A Condon, RM Karp - Random Structures & Algorithms, 2001 - Wiley Online Library
The NP‐hard graph bisection problem is to partition the nodes of an undirected graph into
two equal‐sized groups so as to minimize the number of edges that cross the partition. The …
two equal‐sized groups so as to minimize the number of edges that cross the partition. The …
Generative hypergraph clustering: From blockmodels to modularity
Hypergraphs are a natural modeling paradigm for networked systems with multiway
interactions. A standard task in network analysis is the identification of closely related or …
interactions. A standard task in network analysis is the identification of closely related or …