Pages that link to "Item:Q3514498"
From MaRDI portal
The following pages link to Expander graphs and their applications (Q3514498):
Displaying 50 items.
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices (Q260016) (← links)
- Expansion of building-like complexes (Q260106) (← links)
- Quantum ergodicity for quantum graphs without back-scattering (Q295517) (← links)
- Isoperimetric inequalities for Ramanujan complexes and topological expanders (Q295848) (← links)
- Graph-theoretic design and analysis of key predistribution schemes (Q306046) (← links)
- \(\mathrm{SL}_2\) homomorphic hash functions: worst case to average case reduction and short collision search (Q306055) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Adjacency matrices of random digraphs: singularity and anti-concentration (Q313537) (← links)
- Book review of: T. Tao, Expansion in finite simple groups of Lie type (Q335012) (← links)
- Cutoff on all Ramanujan graphs (Q343522) (← links)
- Expansion in SL\(_2(\mathbb R)\) and monotone expanders (Q352121) (← links)
- Amenability, locally finite spaces, and bi-Lipschitz embeddings (Q392144) (← links)
- Constructing uniquely realizable graphs (Q393739) (← links)
- Spanders: distributed spanning expanders (Q395654) (← links)
- Integral circulant Ramanujan graphs of prime power order (Q396862) (← links)
- Algebraic Cayley graphs over finite fields (Q402539) (← links)
- A Cheeger-type inequality on simplicial complexes (Q402582) (← links)
- On the spectrum of Wenger graphs (Q403368) (← links)
- Discrepancy inequalities for directed graphs (Q403560) (← links)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
- Shaping bursting by electrical coupling and noise (Q420952) (← links)
- Expansion in \(\text{SL}_d(\mathbb Z/q\mathbb Z)\), \(q\) arbitrary. (Q421012) (← links)
- Expander graphs, gonality, and variation of Galois representations (Q428158) (← links)
- Fighting constrained fires in graphs (Q428868) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Almost-Ramanujan graphs and prime gaps (Q458598) (← links)
- Efficient structure of noisy communication networks (Q459416) (← links)
- Ramanujan complexes and high dimensional expanders (Q466822) (← links)
- Concentration of the Kirchhoff index for Erdős-Rényi graphs (Q473412) (← links)
- Regular graphs of large girth and arbitrary degree (Q485001) (← links)
- The road to deterministic matrices with the restricted isometry property (Q485193) (← links)
- Random Latin squares and 2-dimensional expanders (Q488979) (← links)
- Expansion of random graphs: new proofs, new results (Q496208) (← links)
- Construction of graphs with exactly \(k\) main eigenvalues (Q498314) (← links)
- On eigenvalues of random complexes (Q503252) (← links)
- Hypercube percolation (Q520736) (← links)
- Cubic polyhedral Ramanujan graphs with face size no larger than six (Q535313) (← links)
- Spectra of lifted Ramanujan graphs (Q555601) (← links)
- Strong uniform expansion in \(\text{SL}(2,p)\). (Q607667) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- Design of highly synchronizable and robust networks (Q620598) (← links)
- On the optimality of gluing over scales (Q635762) (← links)
- Cheeger constants, growth and spectrum of locally tessellating planar graphs (Q636774) (← links)
- Cayley graph expanders and groups of finite width. (Q640936) (← links)
- Majority dynamics on trees and the dynamic cavity method (Q655579) (← links)
- Cleaning random \(d\)-regular graphs with brooms (Q659724) (← links)
- Beyond the expanders (Q666522) (← links)
- Spectral and combinatorial properties of some algebraically defined graphs (Q668032) (← links)
- Minimal multiple blocking sets (Q668041) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
