335 search results - page 27 / 67 » Resolvent of large random graphs |
COMBINATORICA
2007
13 years 7 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...