The following pages link to Ramanujan graphs (Q1112836):
Displaying 50 items.
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Quantum ergodicity for quantum graphs without back-scattering (Q295517) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Symmetric unique neighbor expanders and good LDPC codes (Q335354) (← links)
- Cutoff on all Ramanujan graphs (Q343522) (← links)
- Affine extractors over large fields with exponential error (Q347127) (← links)
- Expansion in SL\(_2(\mathbb R)\) and monotone expanders (Q352121) (← links)
- Functional limit theorems for random regular graphs (Q365705) (← links)
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966) (← links)
- Constructing uniquely realizable graphs (Q393739) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Integral circulant Ramanujan graphs of prime power order (Q396862) (← links)
- On the spectrum of Wenger graphs (Q403368) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Extremal edge polytopes (Q405274) (← links)
- Low-distortion embeddings of graphs with large girth (Q413201) (← 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)
- CAT(0) spaces and expanders. (Q431271) (← links)
- A concentration theorem of expanders on Hadamard manifolds (Q435855) (← links)
- The extremal symmetry of arithmetic simplicial complexes (Q452048) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Almost-Ramanujan graphs and prime gaps (Q458598) (← links)
- Ramanujan complexes and high dimensional expanders (Q466822) (← links)
- Regular graphs of large girth and arbitrary degree (Q485001) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Expansion of random graphs: new proofs, new results (Q496208) (← links)
- Optimal topological design for distributed estimation over sensor networks (Q497910) (← links)
- Corrigendum to: ``Almost-Ramanujan graphs and prime gaps'' (Q499505) (← links)
- On eigenvalues of random complexes (Q503252) (← links)
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\) (Q514531) (← links)
- Box representations of embedded graphs (Q527439) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Probability of graphs with large spectral gap by multicanonical Monte Carlo (Q546962) (← links)
- Spectra of lifted Ramanujan graphs (Q555601) (← links)
- Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\). (Q557608) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Colorings of the \(d\)-regular infinite tree (Q598463) (← links)
- Strong uniform expansion in \(\text{SL}(2,p)\). (Q607667) (← links)
- Design of highly synchronizable and robust networks (Q620598) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Classical Kloosterman sums: representation theory, magic squares, and Ramanujan multigraphs (Q627626) (← links)
- Graph spectra in computer science (Q627958) (← links)
- A quantitative version of the non-Abelian idempotent theorem (Q633235) (← links)
- Some topics in the dynamics of group actions on rooted trees. (Q641942) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- Higher dimensional Moore bounds (Q659717) (← links)
- Higher index theory for certain expanders and Gromov monster groups. I (Q664746) (← links)
- Matching nuts and bolts faster (Q671403) (← links)
