_ 1, isoperimetric inequalities for graphs, and superconcentrators
From MaRDI portal
(Redirected from Publication:800384)
\(\lambda 1\), isoperimetric inequalities for graphs, and superconcentrators
\(\lambda 1\), isoperimetric inequalities for graphs, and superconcentrators
Recommendations
- \(\lambda_{\infty}\), vertex isoperimetry and concentration
- Isoperimetric inequalities for graphs
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Isoperimetric inequalities and the width parameters of graphs
- Weighted graph Laplacians and isoperimetric inequalities
- On the isoperimetric spectrum of graphs and its approximations
- The Faber-Krahn type isoperimetric inequalities for a graph
- Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)
- Isoperimetric inequalities in graphs and surfaces
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
Cites work
- scientific article; zbMATH DE number 3864514 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3737716 (Why is no real title available?)
- scientific article; zbMATH DE number 3608081 (Why is no real title available?)
- scientific article; zbMATH DE number 3618783 (Why is no real title available?)
- scientific article; zbMATH DE number 3808278 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3226460 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 3067044 (Why is no real title available?)
- A Topological Application of the Isoperimetric Inequality
- A note on a construction of Margulis
- A quantitative finite-dimensional Krivine theorem
- A short proof for a theorem of Harper about Hamming-spheres
- Better expanders and superconcentrators
- Connection of the dual space of a group with the structure of its closed subgroups
- Cubic graphs on \(\leq 14\) vertices
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Ergodic theory, group representations, and rigidity
- Explicit Concentrators from Generalized N-Gons
- Explicit constructions of linear-sized superconcentrators
- Extremal Configurations on a Discrete Torus and a Generalization of the Generalized Macaulay Theorem
- Filling Riemannian manifolds
- Global versus local asymptotic theories of finite-dimensional normed spaces
- Lower Bounds for the Partitioning of Graphs
- On the bipartition of graphs
- Optimal numberings and isoperimetric problems on graphs
- Sorting in \(c \log n\) parallel steps
- Spectra of Cayley graphs
- Spectra of graphs with transitive groups
- Unconditional and symmetric sets in \(n\)-dimensional normed spaces
Cited in
(only showing first 100 items - show all)- The rapid mixing of random walks defined by an \(n\)-cube
- Fast Fourier Analysis for SL2over a Finite Field and Related Numerical Experiments
- On Khot’s unique games conjecture
- A lower bound on the area of permutation layouts
- Multi-way dual Cheeger constants and spectral bounds of graphs
- Spectra of graphs and fractal dimensions. I
- A global Poincaré inequality on graphs via a conical curvature-dimension condition
- Optimization problems for weighted graphs and related correlation estimates
- Magnetic-sparseness and Schrödinger operators on graphs
- On the spectrum of the sum of generators for a finitely generated group
- The spectrum of Platonic graphs over finite fields
- Martingales, Poincaré type inequalities, and deviation inequalities
- Expanding and forwarding
- The clustering coefficient and the diameter of small-world networks
- LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
- Testing Expansion in Bounded-Degree Graphs
- Design of highly synchronizable and robust networks
- Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
- Simplicial complexes: spectrum, homology and random walks
- Discrete quantitative nodal theorem
- The limit of first eigenfunctions of the \(p\)-Laplacian on graphs
- Synchronization of coupled chaotic maps
- Secure fast evaluation of iterative methods: with an application to secure PageRank
- Eigenvalues and diameter
- Isoperimetric numbers of graph bundles
- Metric uniformization and spectral bounds for graphs
- Strong isoperimetric inequality for tessellating quantum graphs
- A lattice point problem and additive number theory
- Diameters, distortion, and eigenvalues
- Evaluating performance of image segmentation criteria and techniques
- Logarithmic reduction of the level of randomness in some probabilistic geometric constructions
- Eigenvalues and separation in graphs
- Random Walks on Randomly Evolving Graphs
- A stability result for balanced dictatorships in \(S_n\)
- Random Latin square graphs
- On the structure of isometrically embeddable metric spaces
- The Cheeger cut and Cheeger problem in metric graphs
- Spectral and combinatorial properties of some algebraically defined graphs
- The alternating polynomials and their relation with the spectra and conditional diameters of graphs
- Spectral estimates for infinite quantum graphs
- Boundary graphs. II: The limit case of a spectral property
- Modular orientations of random and quasi-random regular graphs
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Graphs with given diameter maximizing the algebraic connectivity
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
- Dependence ordering for Markov processes on partially ordered spaces
- On testing expansion in bounded-degree graphs
- Concentration of normalized sums and a central limit theorem for noncorrelated random variables
- Some observations on the smallest adjacency eigenvalue of a graph
- On middle cube graphs
- On edge-rupture degree of graphs
- Intrinsic isoperimetry of the giant component of supercritical bond percolation in dimension two
- Shortest paths in distance-regular graphs
- Large degree covers and sharp resonances of hyperbolic surfaces
- Graph Laplacians, nodal domains, and hyperplane arrangements
- A quasi-stability result for dictatorships in \(S_n\)
- On Dinur’s proof of the PCP theorem
- Stochastic completeness of graphs: bounded Laplacians, intrinsic metrics, volume growth and curvature
- Property \(F\ell_q\) implies property \(F\ell_{p}\) for \(1<p<q<\infty\)
- Extremal results for odd cycles in sparse pseudorandom graphs
- Diffusion operator and spectral analysis for directed hypergraph Laplacian
- Spectral gap estimates in mean field spin glasses
- Spectrum and combinatorics of two-dimensional Ramanujan complexes
- Heegaard splittings, the virtually Haken conjecture and property \((\tau)\)
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- \(\lambda_{\infty}\), vertex isoperimetry and concentration
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- Concentration on the discrete torus using transportation
- Compressions and isoperimetric inequalities
- Expansion in finite simple groups of Lie type.
- Old and new results on algebraic connectivity of graphs
- Mixing in high-dimensional expanders
- The Ramanujan conjecture and its applications
- Cheeger inequalities for unbounded graph Laplacians
- Evolving sets, mixing and heat kernel bounds
- On the spectrum and linear programming bound for hypergraphs
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Cutoff on all Ramanujan graphs
- On the spectrum of the generalised Petersen graphs
- Intrinsic Metrics on Graphs: A Survey
- A Cheeger-type inequality on simplicial complexes
- The expansion and mixing time of skip graphs with applications
- The chromatic number of random Cayley graphs
- Linear programming bounds for regular graphs
- Isoperimetric inequalities in simplicial complexes
- A new upper bound for the isoperimetric number of de Bruijn networks
- Eigenvalues of Graphs and Sobolev Inequalities
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- A bipartite analogue of Dilworth's theorem
- Lower bounds of the Laplacian spectrum of graphs based on diameter
- Modified logarithmic Sobolev inequalities in discrete settings
- Tough Ramsey graphs without short cycles
- Coboundary expanders
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- On hyperboundedness and spectrum of Markov operators
- Variants of Kazhdan's property for subgroups of semisimple groups
- Algebraic connectivity of directed graphs
This page was built for publication: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800384)
