<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
         xmlns:dc="http://purl.org/dc/terms/"
         xmlns:foaf="http://xmlns.com/foaf/0.1/"
         xmlns:bibo="http://purl.org/ontology/bibo/"
         xmlns:fabio="http://purl.org/spar/fabio/"
         xmlns:owl="http://www.w3.org/2002/07/owl#"
         xmlns:event="http://purl.org/NET/c4dm/event.owl#"
         xmlns:ore="http://www.openarchives.org/ore/terms/">

    <rdf:Description rdf:about="https://research-explorer.ista.ac.at/record/23268">
        <ore:isDescribedBy rdf:resource="https://research-explorer.ista.ac.at/record/23268"/>
        <dc:title>Mesoscopic eigenvalue statistics for random regular graphs: A case study</dc:title>
        <bibo:authorList rdf:parseType="Collection">
            <foaf:Person>
                <foaf:name></foaf:name>
                <foaf:surname></foaf:surname>
                <foaf:givenname></foaf:givenname>
            </foaf:Person>
        </bibo:authorList>
        <bibo:abstract>We study mesoscopic fluctuations of linear eigenvalue statistics for random $d$-regular graphs on $N$ vertices with fixed $d\ge 3$. Revisiting the approach developed by Dumitriu-Johnson-Pal-Paquette (2013) and Johnson (2015), we establish a mesoscopic central limit theorem in the bulk and identify its universal limiting variance. Our result applies to test functions with smooth compactly supported Fourier transforms and to a specific range of spectral scales $(\log N)^{-1}\llη\ll 1$. In particular, this case study allows the mesoscopic scale to tend to zero arbitrarily slowly.</bibo:abstract>
        <bibo:doi rdf:resource="10.48550/arXiv.2611.09215" />
        <ore:similarTo rdf:resource="info:doi/10.48550/arXiv.2611.09215"/>
    </rdf:Description>
</rdf:RDF>
