The spectral dimension of random trees

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The spectral dimension of random brushes

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 ds = 2. For d = 3 we have 5 2 ≤ ds ≤ 3 and for d ≥ 4 we have 3 ≤ ds ≤ d.

متن کامل

Exact spectral dimension of the random surface

We propose a new method of the analytical computation of the spectral dimension which is based on the equivalence of the random walk and the q-state Potts model with non-zero magnetic field in the limit q → 0. Calculating the critical exponent of the magnetization δ of this model on the dynamically triangulated random surface by means of a matrix model technique we obtain that the spectral dime...

متن کامل

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

Spectral Dimension of the Universe

We measure the spectral dimension of universes emerging from nonperturbative quantum gravity, defined through state sums of causal triangulated geometries. While four-dimensional on large scales, the quantum universe appears two-dimensional at short distances. We conclude that quantum gravity may be “selfrenormalizing” at the Planck scale, by virtue of a mechanism of dynamical dimensional reduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and General

سال: 2002

ISSN: 0305-4470

DOI: 10.1088/0305-4470/35/45/301