pith. sign in

arxiv: 0709.3678 · v1 · pith:FCA6WJWCnew · submitted 2007-09-24 · ❄️ cond-mat.stat-mech

The spectral dimension of random brushes

classification ❄️ cond-mat.stat-mech
keywords randombrushesdimensiongraphsspectraladdingcalledclass
0
0 comments X
read the original abstract

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^d viewed as a graph. We prove that for d=2 all random brushes have spectral dimension d_s=2. For d=3 we have {5\over 2}\leq d_s\leq 3 and for d\geq 4 we have 3\leq d_s\leq d.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.