The isoperimetric number of random regular graphs
From MaRDI portal
Publication:1120601
DOI10.1016/S0195-6698(88)80014-3zbMath0673.05086OpenAlexW1993216347MaRDI QIDQ1120601
Publication date: 1988
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(88)80014-3
Related Items
A survey of the modified Moran process and evolutionary graph theory, Explicit spectral gaps for random covers of Riemann surfaces, Bounds on the max and min bisection of random cubic and random 4-regular graphs, Adjacency matrices of random digraphs: singularity and anti-concentration, Bounds on the bisection width for random \(d\)-regular graphs, Cycles in a random graph near the critical point, Upper bounds on the bisection width of 3- and 4-regular graphs, Some remarks on rainbow connectivity, Complete Minors in Graphs Without Sparse Cuts, Poisson-Dirichlet distribution for random Belyi surfaces, Unnamed Item, New spectral lower bounds on the bisection width of graphs, Explicit expanding expanders, Discrepancies of spanning trees and Hamilton cycles, Glauber dynamics for Ising models on random regular graphs: cut-off and metastability, On the discrepancies of graphs, A random cover of a compact hyperbolic surface has relative spectral gap \(\frac{3}{16}-\varepsilon\), Cops and Robber game with a fast robber on expander graphs and random graphs, A forest building process on simple graphs, Sublinear separators, fragility and subexponential expansion, On the minimum bisection of random 3-regular graphs, A note on internal partitions: the 5-regular case and beyond, Analysis of edge deletion processes on faulty random regular graphs., Low-temperature Ising dynamics with random initializations, Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs, Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs, The length of closed geodesics on random Riemann surfaces, On the structure of random graphs with constant \(r\)-balls, Factors of IID on Trees, Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems, Leader election in well-connected graphs, Expansion properties of a random regular graph after random vertex deletions, The cook-book approach to the differential equation method, Unnamed Item, A note on sublinear separators and expansion, Exact modularity of line graphs of complete graphs, New lower bound on the modularity of Johnson graphs, Synchronization in power-law networks, Erdős-Hajnal-type results for monotone paths, Metastability of the Ising model on random regular graphs at zero temperature, Synchronization in random networks with given expected degree sequences, The small world effect on the coalescing time of random walks, The giant component threshold for random regular graphs with edge faults H. Prodinger, Satisfactory graph partition, variants, and generalizations, Random regular graphs with edge faults: Expansion through cores, The isoperimetric constant of the random graph process, Modularity of some distance graphs, Minimal selectors and fault tolerant networks, Gonality of expander graphs, Sparse graphs: Metrics and random models, On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model, Graphs with Many Strong Orientations, Expanders with respect to Hadamard spaces and random graphs, Absorption time of the Moran process, New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\), Improved Ramsey-type results for comparability graphs, Contact process on a graph with communities, The first eigenvalue of a Riemann surface, Bootstrap percolation on the random regular graph, Isoperimetric numbers of randomly perturbed intersection graphs, Nowhere-zero flows in random graphs, Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs, Random graphs, weak coarse embeddings, and higher index theory, Cycle lengths modulo \(k\) in expanders, Spectrum of Johnson graphs
Cites Work
