Sciweavers

77 search results - page 2 / 16
» On the Spectrum of the Derangement Graph
Sort
View
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
13 years 5 months ago
A Matrix Representation of Graphs and its Spectrum as a Graph Invariant
David Emms, Edwin R. Hancock, Simone Severini, Ric...
MONET
2006
107views more  MONET 2006»
13 years 5 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
ICML
2008
IEEE
14 years 6 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt
RSA
2010
108views more  RSA 2010»
13 years 4 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
COMBINATORICS
2007
65views more  COMBINATORICS 2007»
13 years 5 months ago
On Certain Integral Schreier Graphs of the Symmetric Group
We compute the spectrum of the Schreier graph of the symmetric group Sn corresponding to the Young subgroup S2 × Sn−2 and the generating set consisting of initial reversals. In ...
Paul E. Gunnells, Richard A. Scott, Byron L. Walde...