1511 search results - page 10 / 303 » Randomness, lowness and degrees |
104
Voted
ALGORITHMICA
2007
15 years 1 months ago
2007
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
125
Voted
RSA
2006
15 years 1 months ago
2006
We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is s...
111
Voted
RSA
2010
15 years 5 days ago
2010
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
113
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
106
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...