The following pages link to Eigenvalues and expanders (Q1112844):
Displaying 50 items.
- Maximum flows and minimum cuts in the plane (Q989897) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Cryptographic hash functions from expander graphs (Q1027970) (← links)
- Censored Glauber dynamics for the mean field Ising model (Q1047946) (← links)
- Strong uniform times and finite random walks (Q1094756) (← links)
- Expanders obtained from affine transformations (Q1098859) (← links)
- Explicit construction of linear sized tolerant networks (Q1110541) (← links)
- Isoperimetric inequalities, growth, and the spectrum of graphs (Q1111573) (← links)
- Ramanujan graphs (Q1112836) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- On the power of two-point based sampling (Q1120201) (← links)
- Spectra of graphs and fractal dimensions. I (Q1123218) (← links)
- Expanders that beat the eigenvalue bound: Explicit construction and applications (Q1125612) (← links)
- Diameter, covering index, covering radius and eigenvalues (Q1174153) (← links)
- Eigenvalues, diameter, and mean distance in graphs (Q1175553) (← links)
- On the second eigenvalue and random walks in random \(d\)-regular graphs (Q1181012) (← links)
- On the second eigenvalue of a graph (Q1182585) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- A domain monotonicity theorem for graphs and Hamiltonicity (Q1192950) (← links)
- Lower bounds for the first eigenvalue of certain M-matrices associated with graphs (Q1194509) (← links)
- Approximating the permanent of graphs with large factors (Q1199692) (← links)
- Simple bounds on the convergence rate of an ergodic Markov chain (Q1209327) (← links)
- Some geometric aspects of graphs and their eigenfunctions (Q1261117) (← links)
- Constructing disjoint paths on expander graphs (Q1262782) (← links)
- On the spectra of certain graphs arising from finite fields (Q1273216) (← links)
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? (Q1296583) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- Spectra and optimal partitions of weighted graphs (Q1322166) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (Q1331949) (← links)
- A lower bound for tree resolution (Q1336637) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- Finite fields and Ramanujan graphs (Q1362096) (← links)
- Expansion properties of Cayley graphs of the alternating groups (Q1364234) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- The structure of trivalent graphs with minimal eigenvalue gap (Q1370464) (← links)
- On embedding expanders into \(\ell_p\) spaces (Q1376045) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Relative expanders or weakly relatively Ramanujan graphs. (Q1421136) (← links)
- Lower bounds for the eigenvalues of Laplacian matrices (Q1587270) (← links)
- Spectral concentration and greedy \(k\)-clustering (Q1624584) (← links)
- Spectral estimates for infinite quantum graphs (Q1633631) (← links)
- Isoperimetry in supercritical bond percolation in dimensions three and higher (Q1633918) (← links)
- Intrinsic isoperimetry of the giant component of supercritical bond percolation in dimension two (Q1663874) (← links)
- The spectral gap of dense random regular graphs (Q1731891) (← links)
- Some properties of graphs constructed from 2-designs (Q1733436) (← links)
- Size biased couplings and the spectral gap for random regular graphs (Q1747748) (← links)
