688 search results - page 52 / 138 » General Partitioning on Random Graphs |
158
click to vote
CPC
2002
15 years 5 months ago
2002
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
189
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
159
click to vote
ACMSE
2005
ACM
15 years 11 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
149
click to vote
RSA
2008
15 years 5 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
173
click to vote
DAM
1999
15 years 5 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...