Abstract
In a number of recent papers, the spectral properties of the Laplacian on randomly connected graphs have been studied within the replica formalism. In this letter we show how the replica formalism can be unravelled and we find an approximation for calculating the density of states which substantially simplifies the numerical resolution of the equations obtained, whilst giving results in excellent accord with the exact solution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
