2013
DOI: 10.48550/arxiv.1306.6714
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On the spectral distribution of large weighted random regular graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…They found that when p = 0.5, the LSD is the familiar semi-circular law, but when p = 0.5, the limiting moments are polynomials in (2p − 1) whose coefficients could not be identified, and as p approaches 1 these moments approach the corresponding moments of the LSD of the Toeplitz matrix. Goldmakher et al [2013] considered randomly weighted sequences of d-regular graphs with size growing to ∞, which amounts to taking Schur-Hadamard product of random real symmetric weight matrices with the adjacency matrices of the graphs, and established the existence of a limiting spectral distribution that depends only on d and the distribution of the weights, under the usual decay condition on the number of k-cycles relative to the graph-size, for each k 3 (in the unweighted case, the limiting spectral distribution is the well-known Kesten's measure).…”
Section: Introductionmentioning
confidence: 99%
“…They found that when p = 0.5, the LSD is the familiar semi-circular law, but when p = 0.5, the limiting moments are polynomials in (2p − 1) whose coefficients could not be identified, and as p approaches 1 these moments approach the corresponding moments of the LSD of the Toeplitz matrix. Goldmakher et al [2013] considered randomly weighted sequences of d-regular graphs with size growing to ∞, which amounts to taking Schur-Hadamard product of random real symmetric weight matrices with the adjacency matrices of the graphs, and established the existence of a limiting spectral distribution that depends only on d and the distribution of the weights, under the usual decay condition on the number of k-cycles relative to the graph-size, for each k 3 (in the unweighted case, the limiting spectral distribution is the well-known Kesten's measure).…”
Section: Introductionmentioning
confidence: 99%