Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSpectral and localization properties of random bipartite graphs
68
0
0.0
(
0
)
Added by
J. A. Mendez-Bermudez
Publication date
2019
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Bipartite graphs are often found to represent the connectivity between the components of many systems such as ecosystems. A bipartite graph is a set of $n$ nodes that is decomposed into two disjoint subsets, having $m$ and $n-m$ vertices each, such that there are no adjacent vertices within the same set. The connectivity between both sets, which is the relevant quantity in terms of connections, can be quantified by a parameter $alphain[0,1]$ that equals the ratio of existent adjacent pairs over the total number of possible adjacent pairs. Here, we study the spectral and localization properties of such random bipartite graphs. Specifically, within a Random Matrix Theory (RMT) approach, we identify a scaling parameter $xiequivxi(n,m,alpha)$ that fixes the localization properties of the eigenvectors of the adjacency matrices of random bipartite graphs. We also show that, when $xi<1/10$ ($xi>10$) the eigenvectors are localized (extended), whereas the localization--to--delocalization transition occurs in the interval $1/10<xi<10$. Finally, given the potential applications of our findings, we round off the study by demonstrating that for fixed $xi$, the spectral properties of our graph model are also universal.
rate research
Read More
In this work we perform a detailed statistical analysis of topological and spectral properties of random geometric graphs (RGGs); a graph model used to study the structure and dynamics of complex systems embedded in a two dimensional space. RGGs, $G(n,ell)$, consist of $n$ vertices uniformly and independently distributed on the unit square, where two vertices are connected by an edge if their Euclidian distance is less or equal than the connection radius $ell in [0,sqrt{2}]$. To evaluate the topological properties of RGGs we chose two well-known topological indices, the Randic index $R(G)$ and the harmonic index $H(G)$. While we characterize the spectral and eigenvector properties of the corresponding randomly-weighted adjacency matrices by the use of random matrix theory measures: the ratio between consecutive eigenvalue spacings, the inverse participation ratios and the information or Shannon entropies $S(G)$. First, we review the scaling properties of the averaged measures, topological and spectral, on RGGs. Then we show that: (i) the averaged--scaled indices, $leftlangle R(G) rightrangle$ and $leftlangle H(G) rightrangle$, are highly correlated with the average number of non-isolated vertices $leftlangle V_times(G) rightrangle$; and (ii) surprisingly, the averaged--scaled Shannon entropy $leftlangle S(G) rightrangle$ is also highly correlated with $leftlangle V_times(G) rightrangle$. Therefore, we suggest that very reliable predictions of eigenvector properties of RGGs could be made by computing topological indices.
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 study spectra of directed networks with inhibitory and excitatory couplings. We investigate in particular eigenvector localization properties of various model networks for different value of correlation among their entries. Spectra of random networks, with completely uncorrelated entries show a circular distribution with delocalized eigenvectors, where as networks with correlated entries have localized eigenvectors. In order to understand the origin of localization we track the spectra as a function of connection probability and directionality. As connections are made directed, eigenstates start occurring in complex conjugate pairs and the eigenvalue distribution combined with the localization measure shows a rich pattern. Moreover, for a very well distinguished community structure, the whole spectrum is localized except few eigenstates at boundary of the circular distribution. As the network deviates from the community structure there is a sudden change in the localization property for a very small value of deformation from the perfect community structure. We search for this effect for the whole range of correlation strengths and for different community configurations. Furthermore, we investigate spectral properties of a metabolic network of zebrafish, and compare them with those of the model networks.
We theoretically study transport properties in one-dimensional interacting quasiperiodic systems at infinite temperature. We compare and contrast the dynamical transport properties across the many-body localization (MBL) transition in quasiperiodic and random models. Using exact diagonalization we compute the optical conductivity $sigma(omega)$ and the return probability $R(tau)$ and study their average low-frequency and long-time power-law behavior, respectively. We show that the low-energy transport dynamics is markedly distinct in both the thermal and MBL phases in quasiperiodic and random models and find that the diffusive and MBL regimes of the quasiperiodic model are more robust than those in the random system. Using the distribution of the DC conductivity, we quantify the contribution of sample-to-sample and state-to-state fluctuations of $sigma(omega)$ across the MBL transition. We find that the activated dynamical scaling ansatz works poorly in the quasiperiodic model but holds in the random model with an estimated activation exponent $psiapprox 0.9$. We argue that near the MBL transition in quasiperiodic systems, critical eigenstates give rise to a subdiffusive crossover regime on finite-size systems.
We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for the minimum distance. For ErdH{o}s-Renyi (ER) and scale free networks (SF), with parameter $lambda$ ($lambda >3$), we find that the small-world nature is destroyed. We also find numerically that for weak disorder the length of the optimal path scales logaritmically with the size of the networks studied. We also review the transition between the strong and weak disorder regimes in the scaling properties of the length of the optimal path for ER and SF networks and for a general distribution of weights, and suggest that for any distribution of weigths, the distribution of optimal path lengths has a universal form which is controlled by the scaling parameter $Z=ell_{infty}/A$ where $A$ plays the role of the disorder strength, and $ell_{infty}$ is the length of the optimal path in strong disorder. The relation for $A$ is derived analytically and supported by numerical simulations. We then study the minimum spanning tree (MST) and show that it is composed of percolation clusters, which we regard as super-nodes, connected by a scale-free tree. We furthermore show that the MST can be partitioned into two distinct components. One component the {it superhighways}, for which the nodes with high centrality dominate, corresponds to the largest cluster at the percolation threshold which is a subset of the MST. In the other component, {it roads}, low centrality nodes dominate. We demonstrate the significance identifying the superhighways by showing that one can improve significantly the global transport by improving a very small fraction of the network.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
