اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSpanning Trees on the Two-Dimensional Lattices with More Than One Type of Vertex
105
0
0.0
(
0
)
تأليف
Shu-Chiuan Chang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For a two-dimensional lattice $Lambda$ with $n$ vertices, the number of spanning trees $N_{ST}(Lambda)$ grows asymptotically as $exp(n z_Lambda)$ in the thermodynamic limit. We present exact integral expression and numerical value for the asymptotic growth constant $z_Lambda$ for spanning trees on various two-dimensional lattices with more than one type of vertex given in cite{Okeeffe}. An exact closed-form expression for the asymptotic growth constant is derived for net 14, and the asymptotic growth constants of net 27 and the triangle lattice have the simple relation $z_{27} = (z_{tri}+ln 4)/4$. Some integral identities are also obtained.
قيم البحث
اقرأ أيضاً
We calculate exponential growth constants $phi$ and $sigma$ describing the asymptotic behavior of spanning forests and connected spanning subgraphs on strip graphs, with arbitrarily great length, of several two-dimensional lattices, including square,
triangular, honeycomb, and certain heteropolygonal Archimedean lattices. By studying the limiting values as the strip widths get large, we infer lower and upper bounds on these exponential growth constants for the respective infinite lattices. Since our lower and upper bounds are quite close to each other, we can infer very accurate approximate values for these exponential growth constants, with fractional uncertainties ranging from $O(10^{-4})$ to $O(10^{-2})$. We show that $phi$ and $sigma$, are monotonically increasing functions of vertex degree for these lattices.
Consider spanning trees on the two-dimensional Sierpinski gasket SG(n) where stage $n$ is a non-negative integer. For any given vertex $x$ of SG(n), we derive rigorously the probability distribution of the degree $j in {1,2,3,4}$ at the vertex and it
s value in the infinite $n$ limit. Adding up such probabilities of all the vertices divided by the number of vertices, we obtain the average probability distribution of the degree $j$. The corresponding limiting distribution $phi_j$ gives the average probability that a vertex is connected by 1, 2, 3 or 4 bond(s) among all the spanning tree configurations. They are rational numbers given as $phi_1=10957/40464$, $phi_2=6626035/13636368$, $phi_3=2943139/13636368$, $phi_4=124895/4545456$.
An important problem in statistical physics concerns the fascinating connections between partition functions of lattice models studied in equilibrium statistical mechanics on the one hand and graph theoretical enumeration problems on the other hand.
We investigate the nature of the relationship between the number of spanning trees and the partition function of the Ising model on the square lattice. The spanning tree generating function $T(z)$ gives the spanning tree constant when evaluated at $z=1$, while giving he lattice green function when differentiated. It is known that for the infinite square lattice the partition function $Z(K)$ of the Ising model evaluated at the critical temperature $K=K_c$ is related to $T(1)$. Here we show that this idea in fact generalizes to all real temperatures. We prove that $ ( Z(K) {rm sech~} 2K ~!)^2 = k expbig[ T(k) big] $, where $k= 2 tanh(2K) {rm sech}(2K)$. The identical Mahler measure connects the two seemingly disparate quantities $T(z)$ and $Z(K)$. In turn, the Mahler measure is determined by the random walk structure function. Finally, we show that the the above correspondence does not generalize in a straightforward manner to non-planar lattices.
We present the numbers of ice model and eight-vertex model configurations (with Boltzmann factors equal to one), I(n) and E(n) respectively, on the two-dimensional Sierpinski gasket SG(n) at stage $n$. For the eight-vertex model, the number of config
urations is $E(n)=2^{3(3^n+1)/2}$ and the entropy per site, defined as $lim_{v to infty} ln E(n)/v$ where $v$ is the number of vertices on SG(n), is exactly equal to $ln 2$. For the ice model, the upper and lower bounds for the entropy per site $lim_{v to infty} ln I(n)/v$ are derived in terms of the results at a certain stage. As the difference between these bounds converges quickly to zero as the calculated stage increases, the numerical value of the entropy can be evaluated with more than a hundred significant figures accurate. The corresponding result of ice model on the generalized two-dimensional Sierpinski gasket SG_b(n) with $b=3$ is also obtained. For the generalized vertex model on SG_3(n), the number of configurations is $2^{(8 times 6^n +7)/5}$ and the entropy per site is equal to $frac87 ln 2$. The general upper and lower bounds for the entropy per site for arbitrary $b$ are conjectured.
Levy-type walks with correlated jumps, induced by the topology of the medium, are studied on a class of one-dimensional deterministic graphs built from generalized Cantor and Smith-Volterra-Cantor sets. The particle performs a standard random walk on
the sets but is also allowed to move ballistically throughout the empty regions. Using scaling relations and the mapping onto the electric network problem, we obtain the exact values of the scaling exponents for the asymptotic return probability, the resistivity and the mean square displacement as a function of the topological parameters of the sets. Interestingly, the systems undergoes a transition from superdiffusive to diffusive behavior as a function of the filling of the fractal. The deterministic topology also allows us to discuss the importance of the choice of the initial condition. In particular, we demonstrate that local and average measurements can display different asymptotic behavior. The analytic results are compared with the numerical solution of the master equation of the process.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
