A d-regular graph has largest or first (adjacency matrix) eigenvalue λ 1 = d. Consider for an even d ≥ 4, a random d-regular graph model formed from d/2 uniform, independent permutations on {1, . . . , n}. We shall show that for any ǫ > 0 we have all eigenvalues aside fromWe also show that this probability is at most 1 − c/n τ ′ , for a constant c and a τ ′ that is either τ or τ + 1 ("more often" τ than τ + 1). We prove related theorems for other models of random graphs, including models with d odd.These theorems resolve the conjecture of Alon, that says that for any ǫ > 0 and d, the second largest eigenvalue of "most" random dregular graphs are at most 2 √ d − 1 +ǫ (Alon did not specify precisely what "most" should mean or what model of random graph one should take).
The main goal of this paper is to estimate the magnitude of the second largest eigenvalue in absolute value, A2, of (the adjacency matrix of) a random d-regular graph, G. In order to do so, we study the probability that a random walk on a random graph returns to its originating vertex at the k-th step, for various values of k. Our main theorem about eigenvalues is thatfor any m < 2[logn L2dv/~g~-l/2J/logdJ, where E denotes the expected value over a certain probability space of 2d-regular graphs. It follows, for example, that for fixed d the second eigenvalue's magnitude is no more than 2 2~/'2d "L--1 + 2 log d + C I with probability 1 -n -C for constants C and C' for sufficiently large n. j fecs.princeton, edu
We study three mathematical notions, that of nodal regions for eigenfunctions of the Laplacian, that of covering theory, and that of fiber products, in the context of graph theory and spectral theory for graphs. We formulate analogous notions and theorems for graphs and their eigenpairs. These techniques suggest new ways of studying problems related to spectral theory of graphs. We also perform some numerical experiments suggesting that the fiber product can yield graphs with small second eigenvalue.
Ten million third molars (wisdom teeth) are extracted from approximately 5 million people in the United States each year at an annual cost of over $3 billion. In addition, more than 11 million patient days of "standard discomfort or disability"--pain, swelling, bruising, and malaise--result postoperatively, and more than 11000 people suffer permanent paresthesia--numbness of the lip, tongue, and cheek--as a consequence of nerve injury during the surgery. At least two thirds of these extractions, associated costs, and injuries are unnecessary, constituting a silent epidemic of iatrogenic injury that afflicts tens of thousands of people with lifelong discomfort and disability. Avoidance of prophylactic extraction of third molars can prevent this public health hazard.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.