Pages that link to "Item:Q3581308"

The following pages link to A proof of alon's second eigenvalue conjecture (Q3581308):

Displaying 41 items.

• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents (Q633812) (← links)
• Cleaning random \(d\)-regular graphs with brooms (Q659724) (← links)
• Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks (Q666208) (← links)
• The measurable Kesten theorem (Q726790) (← links)
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly (Q742585) (← links)
• Poisson-Dirichlet distribution for random Belyi surfaces (Q858984) (← links)
• The energy of graphs and matrices (Q865366) (← links)
• Complexity measures of sign matrices (Q949752) (← links)
• The Grothendieck constant of random and pseudo-random graphs (Q951106) (← links)
• More spectral bounds on the clique and independence numbers (Q1044204) (← links)
• Asymptotically optimal amplifiers for the Moran process (Q1755587) (← links)
• The spectral gap of sparse random digraphs (Q2041813) (← links)
• Spectra of random regular hypergraphs (Q2048572) (← links)
• On the spread of influence in graphs (Q2051833) (← links)
• New and explicit constructions of unbalanced Ramanujan bipartite graphs (Q2115273) (← links)
• High-girth near-Ramanujan graphs with localized eigenvectors (Q2130529) (← links)
• Cutoff on graphs and the Sarnak-Xue density of eigenvalues (Q2143397) (← links)
• The cover time of a biased random walk on a random regular graph of odd degree (Q2205123) (← links)
• \(L^p\)-expander graphs (Q2279956) (← links)
• Local law for eigenvalues of random regular bipartite graphs (Q2305637) (← links)
• Opinion forming in Erdős-Rényi random graph and expanders (Q2306607) (← links)
• Cutoff on hyperbolic surfaces (Q2334101) (← links)
• Lower bounds for boxicity (Q2341923) (← links)
• The expansion and mixing time of skip graphs with applications (Q2377266) (← links)
• Communication constraints in the average consensus problem (Q2440647) (← links)
• Kesten's theorem for invariant random subgroups. (Q2444651) (← links)
• Eigenvalues of graphs and a simple proof of a theorem of Greenberg (Q2496648) (← links)
• In a World of P=BPP (Q3088186) (← links)
• Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• Community Detection and Stochastic Block Models (Q4558502) (← links)
• The cover time of a biased random walk on a random cubic graph (Q4993538) (← links)
• (Q5009541) (← links)
• Graph Powering and Spectral Robustness (Q5027021) (← links)
• Opinion Forming in Erdös-Rényi Random Graph and Expanders (Q5090994) (← links)
• Sparse universal graphs for bounded‐degree graphs (Q5433254) (← links)
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems (Q5892351) (← links)
• Expansion and Lack Thereof in Randomly Perturbed Graphs (Q5900217) (← links)
• Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey (Q6073106) (← links)
• Many nodal domains in random regular graphs (Q6110149) (← links)
• Majority vote in social networks (Q6180001) (← links)