اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the spectra of large sparse graphs with cycles
97
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a general method for obtaining the spectra of large graphs with short cycles using ideas from statistical mechanics of disordered systems. This approach leads to an algorithm that determines the spectra of graphs up to a high accuracy. In particular, for (un)directed regular graphs with cycles of arbitrary length we derive exact and simple equations for the resolvent of the associated adjacency matrix. Solving these equations we obtain analytical formulas for the spectra and the boundaries of their support.
قيم البحث
اقرأ أيضاً
We consider an Erdos-Renyi random graph consisting of N vertices connected by randomly and independently drawing an edge between every pair of them with probability c/N so that at N->infinity one obtains a graph of finite mean degree c. In this regim
e, we study the distribution of resistance distances between the vertices of this graph and develop an auxiliary field representation for this quantity in the spirit of statistical field theory. Using this representation, a saddle point evaluation of the resistance distance distribution is possible at N->infinity in terms of an 1/c expansion. The leading order of this expansion captures the results of numerical simulations very well down to rather small values of c; for example, it recovers the empirical distribution at c=4 or 6 with an overlap of around 90%. At large values of c, the distribution tends to a Gaussian of mean 2/c and standard deviation sqrt{2/c^3}. At small values of c, the distribution is skewed toward larger values, as captured by our saddle point analysis, and many fine features appear in addition to the main peak, including subleading peaks that can be traced back to resistance distances between vertices of specific low degrees and the rest of the graph. We develop a more refined saddle point scheme that extracts the corresponding degree-differentiated resistance distance distributions. We then use this approach to recover analytically the most apparent of the subleading peaks that originates from vertices of degree 1. Rather intuitively, this subleading peak turns out to be a copy of the main peak, shifted by one unit of resistance distance and scaled down by the probability for a vertex to have degree 1. We comment on a possible lack of smoothness in the true N->infinity distribution suggested by the numerics.
We present a full description of the nonergodic properties of wavefunctions on random graphs without boundary in the localized and critical regimes of the Anderson transition. We find that they are characterized by two critical localization lengths:
the largest one describes localization along rare branches and diverges with a critical exponent $ u_parallel=1$ at the transition. The second length, which describes localization along typical branches, reaches at the transition a finite universal value (which depends only on the connectivity of the graph), with a singularity controlled by a new critical exponent $ u_perp=1/2$. We show numerically that these two localization lengths control the finite-size scaling properties of key observables: wavefunction moments, correlation functions and spectral statistics. Our results are identical to the theoretical predictions for the typical localization length in the many-body localization transition, with the same critical exponent. This strongly suggests that the two transitions are in the same universality class and that our techniques could be directly applied in this context.
We solve the q-state Potts model with anti-ferromagnetic interactions on large random lattices of finite coordination. Due to the frustration induced by the large loops and to the local tree-like structure of the lattice this model behaves as a mean
field spin glass. We use the cavity method to compute the temperature-coordination phase diagram and to determine the location of the dynamic and static glass transitions, and of the Gardner instability. We show that for q>=4 the model possesses a phenomenology similar to the one observed in structural glasses. We also illustrate the links between the positive and the zero-temperature cavity approaches, and discuss the consequences for the coloring of random graphs. In particular we argue that in the colorable region the one-step replica symmetry breaking solution is stable towards more steps of replica symmetry breaking.
Long-range interacting systems such as nitrogen vacancy centers in diamond and trapped ions serve as useful experimental setups to probe a range of nonequilibrium many-body phenomena. In particular, via driving, various effective Hamiltonians with ph
ysics potentially quite distinct from short-range systems can be realized. In this Letter, we derive general bounds on the linear response energy absorption rates of periodically driven systems of spins or fermions with long-range interactions that are sign changing and fall off as $1/r^alpha$ with $alpha > d/2$. We show that the disordered averaged energy absorption rate at high temperature decays exponentially with the driving frequency. This strongly suggests the presence of a prethermal plateau in which dynamics is governed by an effective, static Hamiltonian for long times, and we provide numerical evidence to support such a statement. Our results are relevant for understanding timescales of both heating and hence new dynamical regimes described by effective Hamiltonians in such long-range systems.
Eigenstates of fully many-body localized (FMBL) systems can be organized into spin algebras based on quasilocal operators called l-bits. These spin algebras define quasilocal l-bit measurement ($tau^z_i$) and l-bit flip ($tau^x_i$) operators. For a d
isordered Heisenberg spin chain in the MBL regime we approximate l-bit flip operators by finding them exactly on small windows of systems and extending them onto the whole system by exploiting their quasilocal nature. We subsequently use these operators to represent approximate eigenstates. We then describe a method to calculate products of local observables on these eigenstates for systems of size $L$ in $O(L^2)$ time. This algorithm is used to compute the error of the approximate eigenstates.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
