اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCalculation of mean spectral density for statistically uniform tree-like random models
187
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this note is to investigate and compare expressions for the spectral density of random regular graphs, based on easy approximations for real solutions of the recursive relation valid for trees with large coordination number. The obtained formulas are in a good agreement with the results of numerical calculations even for small coordination number.
قيم البحث
اقرأ أيضاً
The random Lorentz gas (RLG) is a minimal model for transport in disordered media. Despite the broad relevance of the model, theoretical grasp over its properties remains weak. For instance, the scaling with dimension d of its localization transition
at the void percolation threshold is not well controlled analytically nor computationally. A recent study [Biroli et al. Phys. Rev. E L030104 (2021)] of the caging behavior of the RLG motivated by the mean-field theory of glasses has uncovered physical inconsistencies in that scaling that heighten the need for guidance. Here, we first extend analytical expectations for asymptotic high-d bounds on the void percolation threshold, and then computationally evaluate both the threshold and its criticality in various d. In high-d systems, we observe that the standard percolation physics is complemented by a dynamical slowdown of the tracer dynamics reminiscent of mean-field caging. A simple modification of the RLG is found to bring the interplay between percolation and mean-field-like caging down to d=3.
Although the spectra of random networks have been studied for a long time, the influence of network topology on the dense limit of network spectra remains poorly understood. By considering the configuration model of networks with four distinct degree
distributions, we show that the spectral density of the adjacency matrices of dense random networks is determined by the strength of the degree fluctuations. In particular, the eigenvalue distribution of dense networks with an exponential degree distribution is governed by a simple equation, from which we uncover a logarithmic singularity in the spectral density. We also derive a relation between the fourth moment of the eigenvalue distribution and the variance of the degree distribution, which leads to a sufficient condition for the breakdown of the Wigner semicircle law for dense random networks. Based on the same relation, we propose a classification scheme of the distinct universal behaviours of the spectral density in the dense limit. Our theoretical findings should lead to important insights on the mean-field behaviour of models defined on graphs.
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of As takes precedence over that of Bs. The model was originally proposed and analyzed in Maragakis et al., Phys. Re
v. E 77, 020103 (2008); here we provide additional results. We solve analytically the diffusion coefficients of the two species in lattices for a number of protocols. In networks, we find that the probability of a B particle to be free decreases exponentially with the node degree. In scale-free networks, this leads to localization of the Bs at the hubs and arrest of their motion. To remedy this, we investigate several strategies to avoid trapping of the Bs: moving an A instead of the hindered B; allowing a trapped B to hop with a small probability; biased walk towards non-hub nodes; and limiting the capacity of nodes. We obtain analytic results for lattices and networks, and discuss the advantages and shortcomings of the possible strategies.
We present a simple strategy in order to show the existence and uniqueness of the infinite volume limit of thermodynamic quantities, for a large class of mean field disordered models, as for example the Sherrington-Kirkpatrick model, and the Derrida
p-spin model. The main argument is based on a smooth interpolation between a large system, made of N spin sites, and two similar but independent subsystems, made of N_1 and N_2 sites, respectively, with N_1+N_2=N. The quenched average of the free energy turns out to be subadditive with respect to the size of the system. This gives immediately convergence of the free energy per site, in the infinite volume limit. Moreover, a simple argument, based on concentration of measure, gives the almost sure convergence, with respect to the external noise. Similar results hold also for the ground state energy per site.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
