Pages that link to "Item:Q3502774"

The following pages link to NON-BACKTRACKING RANDOM WALKS MIX FASTER (Q3502774):

Displaying 50 items.

• Cutoff on all Ramanujan graphs (Q343522) (← links)
• Functional limit theorems for random regular graphs (Q365705) (← links)
• Hypercube percolation (Q520736) (← links)
• The spectral edge of some random band matrices (Q624933) (← links)
• An estimate for the average spectral measure of random band matrices (Q637518) (← links)
• Deterministic walks with choice (Q741725) (← links)
• Cutoff phenomena for random walks on random regular graphs (Q984454) (← links)
• On the exponential generating function for non-backtracking walks (Q1669018) (← links)
• Random walks and diffusion on networks (Q1687598) (← links)
• Spectral measures of factor of i.i.d. processes on vertex-transitive graphs (Q1700413) (← links)
• Non-backtracking random walk (Q1942293) (← links)
• Some spectral properties of the non-backtracking matrix of a graph (Q2020643) (← links)
• Characterizing limits and opportunities in speeding up Markov chain mixing (Q2029783) (← links)
• Spectra of random regular hypergraphs (Q2048572) (← links)
• Mixing time of fractional random walk on finite fields (Q2084834) (← links)
• Markov chains on finite fields with deterministic jumps (Q2119672) (← links)
• A new method for quantifying network cyclic structure to improve community detection (Q2143282) (← links)
• Expander graphs -- both local and global (Q2226628) (← links)
• Approximate Moore graphs are good expanders (Q2284745) (← links)
• Reversibility of the non-backtracking random walk (Q2291971) (← links)
• Recent results of quantum ergodicity on graphs and further investigation (Q2292302) (← links)
• Some observations on the smallest adjacency eigenvalue of a graph (Q2295999) (← links)
• Comparing mixing times on sparse random graphs (Q2320396) (← links)
• Non-backtracking PageRank (Q2330663) (← links)
• A new weighted Ihara zeta function for a graph (Q2419016) (← links)
• On the almost eigenvectors of random regular graphs (Q2421826) (← links)
• On the spectral analysis of second-order Markov chains (Q2452089) (← links)
• Mean-field conditions for percolation on finite graphs (Q2655449) (← links)
• Poisson approximation for non-backtracking random walks (Q2655782) (← links)
• Balanced Allocation on Graphs: A Random Walk Approach (Q2817876) (← links)
• Spectral redemption in clustering sparse networks (Q2962184) (← links)
• Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time (Q3176187) (← links)
• Ramanujan graphings and correlation decay in local algorithms (Q3452726) (← links)
• Correlation Bounds for Distant Parts of Factor of IID Processes (Q4601049) (← links)
• The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis (Q4604568) (← links)
• On the Number of Perfect Matchings in Random Lifts (Q4911113) (← links)
• The cover time of a biased random walk on a random cubic graph (Q4993538) (← links)
• Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization (Q4999399) (← links)
• The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
• (Q5009641) (← links)
• Analytical results for the distribution of cover times of random walks on random regular graphs (Q5049469) (← links)
• (Q5078597) (← links)
• CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS (Q5102213) (← links)
• A combinatorial proof of Bass's determinant formula for the zeta function of regular graphs (Q5136339) (← links)
• Beyond non-backtracking: non-cycling network centrality measures (Q5160872) (← links)
• Analysis of node2vec random walks on networks (Q5161172) (← links)
• Non-Backtracking Alternating Walks (Q5231195) (← links)
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
• The non-backtracking spectrum of the universal cover of a graph (Q5247000) (← links)
• Discrete Graphs – A Paradigm Model for Quantum Chaos (Q5265021) (← links)