Pages that link to "Item:Q3514498"
From MaRDI portal
The following pages link to Expander graphs and their applications (Q3514498):
Displaying 50 items.
- Robustness of regular ring lattices based on natural connectivity (Q3102805) (← links)
- Expander graphs in pure and applied mathematics (Q3109810) (← links)
- Braess's paradox in expanders (Q3145837) (← links)
- KAZHDAN CONSTANTS OF GROUP EXTENSIONS (Q3162714) (← links)
- Expanding Generating Sets for Solvable Permutation Groups (Q3176493) (← links)
- Graphs, Vectors, and Matrices (Q3178747) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- Some physical and chemical indices of clique-inserted lattices (Q3301409) (← links)
- Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735) (← links)
- The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
- ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS (Q3397509) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- A Novel Compressed Sensing Scheme for Photoacoustic Tomography (Q3452594) (← links)
- Cyclic Inclusion-Exclusion (Q3455243) (← links)
- Updating and Downdating Techniques for Optimizing Network Communicability (Q3460271) (← links)
- Edge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi Functions (Q3461984) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Graph coloring with no large monochromatic components (Q3503460) (← links)
- Tail Estimates for Sums of Variables Sampled by a Random Walk (Q3512608) (← links)
- ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS (Q3526528) (← links)
- Expander graphs and gaps between primes (Q3529867) (← links)
- An Elementary Construction of Constant-Degree Expanders (Q3545900) (← links)
- Interactive Communication, Diagnosis and Error Control in Networks (Q3637318) (← links)
- Compression functions of uniform embeddings of groups into Hilbert and Banach spaces (Q3647067) (← links)
- Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
- Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes (Q4562281) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Hereditary quasirandomness without regularity (Q4575307) (← links)
- Snowflake universality of Wasserstein spaces (Q4584312) (← links)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q4625692) (← links)
- On constructing expander families of G-graphs (Q4629557) (← links)
- Moments of the inverse participation ratio for the Laplacian on finite regular graphs (Q4629616) (← links)
- High Dimensional Random Walks and Colorful Expansion (Q4638053) (← links)
- Outlaw distributions and locally decodable codes (Q4638069) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- Measure expanding actions, expanders and warped cones (Q4644954) (← links)
- Quasirandom Cayley graphs (Q4645011) (← links)
- Explicit Bounds from the Alon–Boppana Theorem (Q4646705) (← links)
- (Q4676810) (← links)
- (Q4890703) (← links)
- VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH (Q4902887) (← links)
- COBOUNDARY EXPANDERS (Q4908234) (← links)
- Testing Expansion in Bounded-Degree Graphs (Q4911108) (← links)
- Counting problems in Apollonian packings (Q4918439) (← links)
- Ramanujan Graphs for Post-Quantum Cryptography (Q4964366) (← links)
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
- Robustness of randomized rumour spreading (Q4993120) (← links)
