Renormalization Group Analysis of the Anderson Model on Random Regular Graphs

• URL: http://arxiv.org/abs/2306.14965v3
• Date: Thu, 9 May 2024 12:32:15 GMT
• Title: Renormalization Group Analysis of the Anderson Model on Random Regular Graphs
• Authors: Carlo Vanoni, Boris L. Altshuler, Vladimir E. Kravtsov, Antonello Scardicchio,
• Abstract summary: We present a renormalization group analysis of the problem of Anderson localization on a Random Regular Graph (RRG) We show that the one- parameter scaling hypothesis is recovered for sufficiently large system sizes for both eigenstates and spectrum observables. We also explain the non-monotonic behavior of dynamical and spectral quantities as a function of the system size for values of disorder close to the transition.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a renormalization group analysis of the problem of Anderson localization on a Random Regular Graph (RRG) which generalizes the renormalization group of Abrahams, Anderson, Licciardello, and Ramakrishnan to infinite-dimensional graphs. The renormalization group equations necessarily involve two parameters (one being the changing connectivity of sub-trees), but we show that the one-parameter scaling hypothesis is recovered for sufficiently large system sizes for both eigenstates and spectrum observables. We also explain the non-monotonic behavior of dynamical and spectral quantities as a function of the system size for values of disorder close to the transition, by identifying two terms in the beta function of the running fractal dimension of different signs and functional dependence. Our theory provides a simple and coherent explanation for the unusual scaling behavior observed in numerical data of the Anderson model on RRG and of Many-Body Localization.

Related papers

• Parameter identification in linear non-Gaussian causal models under general confounding [8.273471398838533]
  We study identification of the linear coefficients when such models contain latent variables. Our main result is a graphical criterion that is necessary and sufficient for deciding generic identifiability of direct causal effects. We report on estimations based on the identification result, explore a generalization to models with feedback loops, and provide new results on the identifiability of the causal graph.
  arXiv  Detail & Related papers  (2024-05-31T14:39:14Z)
• Renormalization group for Anderson localization on high-dimensional lattices [0.0]
  We show how in the delocalized region, including the transition point, the $beta$-function for the fractal dimension $D_1$ evolves smoothly. We put forward a conjecture about a lower bound for the fractal dimension.
  arXiv  Detail & Related papers  (2024-03-04T12:16:35Z)
• On the renormalization group fixed point of the two-dimensional Ising model at criticality [77.34726150561087]
  We show that a simple, explicit analytic description of a fixed point using operator-algebraic renormalization (OAR) is possible. Specifically, the fixed point is characterized in terms of spin-spin correlation functions.
  arXiv  Detail & Related papers  (2023-04-06T16:57:28Z)
• GrannGAN: Graph annotation generative adversarial networks [72.66289932625742]
  We consider the problem of modelling high-dimensional distributions and generating new examples of data with complex relational feature structure coherent with a graph skeleton. The model we propose tackles the problem of generating the data features constrained by the specific graph structure of each data point by splitting the task into two phases. In the first it models the distribution of features associated with the nodes of the given graph, in the second it complements the edge features conditionally on the node features.
  arXiv  Detail & Related papers  (2022-12-01T11:49:07Z)
• Graph Polynomial Convolution Models for Node Classification of Non-Homophilous Graphs [52.52570805621925]
  We investigate efficient learning from higher-order graph convolution and learning directly from adjacency matrix for node classification. We show that the resulting model lead to new graphs and residual scaling parameter. We demonstrate that the proposed methods obtain improved accuracy for node-classification of non-homophilous parameters.
  arXiv  Detail & Related papers  (2022-09-12T04:46:55Z)
• Universality in Anderson localization on random graphs with varying connectivity [0.0]
  We show that there should be a non-ergodic region above a given value of disorder $W_E$. Although no separate $W_E$ exists from $W_C$, the length scale at which fully developed ergodicity is found diverges like $|W-W_C|-1$. The separation of these two scales at the critical point allows for a true non-ergodic, delocalized region.
  arXiv  Detail & Related papers  (2022-05-29T09:47:39Z)
• T-LoHo: A Bayesian Regularization Model for Structured Sparsity and Smoothness on Graphs [0.0]
  In graph-structured data, structured sparsity and smoothness tend to cluster together. We propose a new prior for high dimensional parameters with graphical relations. We use it to detect structured sparsity and smoothness simultaneously.
  arXiv  Detail & Related papers  (2021-07-06T10:10:03Z)
• Graph Gamma Process Generalized Linear Dynamical Systems [60.467040479276704]
  We introduce graph gamma process (GGP) linear dynamical systems to model real multivariate time series. For temporal pattern discovery, the latent representation under the model is used to decompose the time series into a parsimonious set of multivariate sub-sequences. We use the generated random graph, whose number of nonzero-degree nodes is finite, to define both the sparsity pattern and dimension of the latent state transition matrix.
  arXiv  Detail & Related papers  (2020-07-25T04:16:34Z)
• Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees [106.91654068632882]
  We consider the bipartite graph and formalize its representation learning problem as a statistical estimation problem of parameters in a semiparametric exponential family distribution. We show that the proposed objective is strongly convex in a neighborhood around the ground truth, so that a gradient descent-based method achieves linear convergence rate. Our estimator is robust to any model misspecification within the exponential family, which is validated in extensive experiments.
  arXiv  Detail & Related papers  (2020-03-02T16:40:36Z)
• Generalizing Convolutional Neural Networks for Equivariance to Lie Groups on Arbitrary Continuous Data [52.78581260260455]
  We propose a general method to construct a convolutional layer that is equivariant to transformations from any specified Lie group. We apply the same model architecture to images, ball-and-stick molecular data, and Hamiltonian dynamical systems.
  arXiv  Detail & Related papers  (2020-02-25T17:40:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.