The isoperimetric number of random regular graphs
From MaRDI portal
(Redirected from Publication:1120601)
Recommendations
- Lower bounds for the isoperimetric numbers of random regular graphs
- scientific article; zbMATH DE number 1033851
- Isoperimetric numbers of regular graphs of high degree with applications to arithmetic Riemann surfaces
- Packing vertices and edges in random regular graphs
- scientific article; zbMATH DE number 3869382
Cites work
Cited in
(70)- Improved Ramsey-type results for comparability graphs
- Low-temperature Ising dynamics with random initializations
- Subspace-invariant \(\mathrm{AC}^0\) formulas
- Complete Minors in Graphs Without Sparse Cuts
- Network cluster-robust inference
- scientific article; zbMATH DE number 7471677 (Why is no real title available?)
- On connectivity in random graph models with limited dependencies
- Modularity of some distance graphs
- Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs
- On minimum vertex bisection of random \(d\)-regular graphs
- The question of the collapsibility of random 3-regular graphs
- A note on internal partitions: the 5-regular case and beyond
- Random graphs, weak coarse embeddings, and higher index theory
- Random regular graphs with edge faults: Expansion through cores
- The cook-book approach to the differential equation method
- Poisson-Dirichlet distribution for random Belyi surfaces
- Discrepancies of spanning trees and Hamilton cycles
- A Cauchy-Davenport type result for arbitrary regular graphs
- Bounds on the max and min bisection of random cubic and random 4-regular graphs
- Analysis of edge deletion processes on faulty random regular graphs.
- A Note on Almost Regular Graphs
- The first eigenvalue of a Riemann surface
- Cycles in a random graph near the critical point
- New lower bound on the modularity of Johnson graphs
- Exact modularity of line graphs of complete graphs
- Bounds on the bisection width for random \(d\)-regular graphs
- A forest building process on simple graphs
- On the discrepancies of graphs
- Graphs with many strong orientations
- The small world effect on the coalescing time of random walks
- A survey of the modified Moran process and evolutionary graph theory
- Explicit spectral gaps for random covers of Riemann surfaces
- The length of closed geodesics on random Riemann surfaces
- Absorption time of the Moran process
- On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model
- Bootstrap percolation on the random regular graph
- The isoperimetric constant of the random graph process
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs
- Cycle lengths modulo \(k\) in expanders
- Spectrum of Johnson graphs
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Upper bounds on the bisection width of 3- and 4-regular graphs
- Glauber dynamics for Ising models on random regular graphs: cut-off and metastability
- Metastability of the Ising model on random regular graphs at zero temperature
- Sublinear separators, fragility and subexponential expansion
- Leader election in well-connected graphs
- Sparse graphs: metrics and random models
- Nowhere-zero flows in random graphs
- Satisfactory graph partition, variants, and generalizations
- A note on sublinear separators and expansion
- Minimal selectors and fault tolerant networks
- Gonality of expander graphs
- Isoperimetric numbers of randomly perturbed intersection graphs
- Adjacency matrices of random digraphs: singularity and anti-concentration
- Synchronization in power-law networks
- On the minimum bisection of random 3-regular graphs
- The giant component threshold for random regular graphs with edge faults H. Prodinger
- Expanders with respect to Hadamard spaces and random graphs
- Erdős-Hajnal-type results for monotone paths
- Synchronization in random networks with given expected degree sequences
- Factors of IID on trees
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
- Lower bounds for the isoperimetric numbers of random regular graphs
- A random cover of a compact hyperbolic surface has relative spectral gap \(\frac{3}{16}-\varepsilon\)
- Contact process on a graph with communities
- On the structure of random graphs with constant \(r\)-balls
- New spectral lower bounds on the bisection width of graphs
- Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems
- Expansion properties of a random regular graph after random vertex deletions
This page was built for publication: The isoperimetric number of random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120601)
