ترغب بنشر مسار تعليمي؟ اضغط هنا

Theory of minimum spanning trees II: exact graphical methods and perturbation expansion at the percolation threshold

119   0   0.0 ( 0 )
 نشر من قبل Thomas Jackson
 تاريخ النشر 2009
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

Continuing the program begun by the authors in a previous paper, we develop an exact low-density expansion for the random minimum spanning tree (MST) on a finite graph, and use it to develop a continuum perturbation expansion for the MST on critical percolation clusters in space dimension d. The perturbation expansion is proved to be renormalizable in d=6 dimensions. We consider the fractal dimension D_p of paths on the latter MST; our previous results lead us to predict that D_p=2 for d>d_c=6. Using a renormalization-group approach, we confirm the result for d>6, and calculate D_p to first order in epsilon=6-d for dleq 6 using the connection with critical percolation, with the result D_p = 2 - epsilon/7 + O(epsilon^2).



قيم البحث

اقرأ أيضاً

A complete understanding of real networks requires us to understand the consequences of the uneven interaction strengths between a systems components. Here we use the minimum spanning tree (MST) to explore the effect of weight assignment and network topology on the organization of complex networks. We find that if the weight distribution is correlated with the network topology, the MSTs are either scale-free or exponential. In contrast, when the correlations between weights and topology are absent, the MST degree distribution is a power-law and independent of the weight distribution. These results offer a systematic way to explore the impact of weak links on the structure and integrity of complex networks.
We present a general formalism that allows for the computation of large-order renormalized expansions in the spacetime representation, effectively doubling the numerically attainable perturbation order of renormalized Feynman diagrams. We show that t his formulation compares advantageously to the currently standard techniques due to its high efficiency, simplicity, and broad range of applicability. Our formalism permits to easily complement perturbation theory with non-perturbative information, which we illustrate by implementing expansions renormalized by the addition of a gap or the inclusion of Dynamical Mean-Field Theory. As a result, we present numerically-exact results for the square-lattice Fermi-Hubbard model in the low temperature non-Fermi-liquid regime and show the momentum-dependent suppression of fermionic excitations in the antinodal region.
We construct and solve a classical percolation model with a phase transition that we argue acts as a proxy for the quantum many-body localisation transition. The classical model is defined on a graph in the Fock space of a disordered, interacting qua ntum spin chain, using a convenient choice of basis. Edges of the graph represent matrix elements of the spin Hamiltonian between pairs of basis states that are expected to hybridise strongly. At weak disorder, all nodes are connected, forming a single cluster. Many separate clusters appear above a critical disorder strength, each typically having a size that is exponentially large in the number of spins but a vanishing fraction of the Fock-space dimension. We formulate a transfer matrix approach that yields an exact value $ u=2$ for the localisation length exponent, and also use complete enumeration of clusters to study the transition numerically in finite-sized systems.
We derive exact expressions for the excess number of clusters b and the excess cumulants b_n of a related quantity at the 2-D percolation point. High-accuracy computer simulations are in accord with our predictions. b is a finite-size correction to t he Temperley-Lieb or Baxter-Temperley-Ashley formula for the number of clusters per site n_c in the infinite system limit; the bn correct bulk cumulants. b and b_n are universal, and thus depend only on the systems shape. Higher-order corrections show no apparent dependence on fractional powers of the system size.
We present a simple, perturbative approach for calculating spectral densities for random matrix ensembles in the thermodynamic limit we call the Perturbative Resolvent Method (PRM). The PRM is based on constructing a linear system of equations and ca lculating how the solutions to these equation change in response to a small perturbation using the zero-temperature cavity method. We illustrate the power of the method by providing simple analytic derivations of the Wigner Semi-circle Law for symmetric matrices, the Marchenko-Pastur Law for Wishart matrices, the spectral density for a product Wishart matrix composed of two square matrices, and the Circle and elliptic laws for real random matrices.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا