5606 search results - page 61 / 1122 » Randomization Techniques for Graphs. |
CCCG
2009
13 years 10 months ago
2009
We study the emergence of rigid components in an Erdos-R
RSA
2006
13 years 9 months ago
2006
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
KES
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we discuss how graph mining system is applied to sales transaction data so as to understand consumer behavior. First, existing research of consumer behavior analysis ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...