2270 search results - page 22 / 454 » On the distribution of eigenvalues of graphs |
113
click to vote
COMBINATORICA
2007
15 years 1 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...
130
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. This paper proposes a method to calculate the limit of the eige...
136
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
110
click to vote
MA
2010
Springer
15 years 9 days ago
2010
Springer
We consider two continuous-time Gaussian processes, one being partially correlated to a time-lagged version of the other. We first give the limiting spectral distribution for the ...
106
click to vote
COMBINATORICS
2006
15 years 1 months ago
2006
This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncro...