The spectral dimension of random brushes
Jonsson, Thordur · Stefansson, Sigurdur Orn
Original · EN
We consider a class of random graphs, called random brushes, which are constructed by adding linear graphs of random lengths to the vertices of Zᵈ viewed as a graph. We prove that for d=2 all random brushes have spectral dimension dₛ=2. For d=3 we have 5 2≤ dₛ≤ 3 and for d≥ 4 we have 3≤ dₛ≤ d.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.