1949 search results - page 170 / 390 » Random graphs on surfaces |
166
click to vote
CPC
2010
15 years 2 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
130
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
137
click to vote
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
151
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
131
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...