Pages that link to "Item:Q3514498"
From MaRDI portal
The following pages link to Expander graphs and their applications (Q3514498):
Displaying 50 items.
- Some ``good'' properties of LDA lattices (Q1752293) (← links)
- Better path-finding algorithms in LPS Ramanujan graphs (Q1755951) (← links)
- Generalizations of the Kolmogorov-Barzdin embedding estimates (Q1759766) (← links)
- Sums and products along sparse graphs (Q1760337) (← links)
- Fast scramblers, horizons and expander graphs (Q1795837) (← links)
- Universal traversal sequences for expander graphs (Q1802060) (← links)
- The geometry of spontaneous spiking in neuronal networks (Q1928239) (← links)
- Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors (Q1928497) (← links)
- Cops and Robber game with a fast robber on expander graphs and random graphs (Q1929738) (← links)
- Expansion in perfect groups. (Q1934651) (← links)
- An introduction to the Ribe program (Q1936714) (← links)
- Parameterized random complexity (Q1946497) (← links)
- The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844) (← links)
- Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae (Q1947116) (← links)
- Groups of oscillating intermediate growth. (Q1955951) (← links)
- Phase transition of the 2-choices dynamics on core-periphery networks (Q1981807) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- On some cycles in Wenger graphs (Q1987600) (← links)
- The second eigenvalue of some normal Cayley graphs of highly transitive groups (Q2001976) (← links)
- Super-approximation. II: The \(p\)-adic case and the case of bounded powers of square-free integers (Q2002838) (← links)
- Improved approximation for fractionally subadditive network design (Q2011025) (← links)
- Quantum expanders and growth of group representations (Q2012082) (← links)
- Counting sum-free sets in abelian groups (Q2017119) (← links)
- Ricci curvature, graphs and eigenvalues (Q2020691) (← links)
- Super-expanders and warped cones (Q2027748) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- Cycle lengths in expanding graphs (Q2036619) (← links)
- Extremal eigenvalues of critical Erdős-Rényi graphs (Q2039437) (← links)
- Fluctuations of extreme eigenvalues of sparse Erdős-Rényi graphs (Q2041657) (← links)
- The spectral gap of sparse random digraphs (Q2041813) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
- Remarks on partitions into expanders (Q2042969) (← links)
- An average John theorem (Q2048458) (← links)
- On the spread of influence in graphs (Q2051833) (← links)
- Prevalence expansion in NIMFA (Q2067170) (← links)
- Square \((1,-1)\)-matrices with large determinants and near-Hadamard matrices (Q2080241) (← links)
- Random Schreier graphs and expanders (Q2082534) (← links)
- Accelerated information dissemination on networks with local and global edges (Q2097337) (← links)
- Expansion in supercritical random subgraphs of the hypercube and its consequences (Q2105142) (← links)
- Poisson statistics and localization at the spectral edge of sparse Erdős-Rényi graphs (Q2105145) (← links)
- Cycle lengths modulo \(k\) in expanders (Q2111188) (← links)
- Long time dynamics for interacting oscillators on graphs (Q2117446) (← links)
- On the hierarchical community structure of practical Boolean formulas (Q2118321) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- Cutoff for random lifts of weighted graphs (Q2119212) (← links)
- On atomic registers and randomized consensus in m\&m systems (Q2121060) (← links)
- Linear random walks on the torus (Q2130503) (← links)
- High-girth near-Ramanujan graphs with localized eigenvectors (Q2130529) (← links)
- On the second largest eigenvalue of some Cayley graphs of the symmetric group (Q2137073) (← links)