Sciweavers

154 search results - page 18 / 31
» rsa 2006
Sort
View
RSA
2008
80views more  RSA 2008»
13 years 9 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
RSA
2010
89views more  RSA 2010»
13 years 8 months ago
A system of grabbing particles related to Galton-Watson trees
We consider a system of particles with arms that are activated randomly to grab other particles as a toy model for polymerization. We assume that the following two rules are ful...
Jean Bertoin, Vladas Sidoravicius, Maria Eulalia V...
RSA
2010
104views more  RSA 2010»
13 years 8 months ago
Random graphs with forbidden vertex degrees
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...
Geoffrey R. Grimmett, Svante Janson
RSA
2010
89views more  RSA 2010»
13 years 8 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
RSA
2010
108views more  RSA 2010»
13 years 8 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge