Imagen de Portada

Pseudorandomness of the Sticky Random Walk

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Anand, Emile, Umans, Chris
Formato:	Preprint
Publicado:	2023
Materias:	Probability Computational Complexity Combinatorics Spectral Theory F.0; G.2.2; G.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Rankwidth of Graphs with Balanced Separations: Expansion for Dense Graphs
por: Anand, Emile
Publicado: (2025)

Towards the Pseudorandomness of Expander Random Walks for Read-Once ACC0 circuits
por: Anand, Emile
Publicado: (2025)

Block-weighted random graphs: planar and beyond
por: Kang, Mihyun, et al.
Publicado: (2026)

Asymptotic Transfer in Critical Recursive Composition Schemes
por: Drmota, Michael, et al.
Publicado: (2026)

Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
por: Nagel, Leonhard
Publicado: (2025)

On Minimum Maximal Distance-k Matchings
por: Kartynnik, Yury, et al.
Publicado: (2016)

A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers
por: Burke, Kyle, et al.
Publicado: (2024)

Small Shadow Partitions
por: Kopparty, Swastik, et al.
Publicado: (2024)

Sharp Square Root Bounds for Edge Eigenvector Universality in Sparse Random Regular Graphs
por: Nagel, Leonhard
Publicado: (2025)

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph
por: Bhandari, Kritika, et al.
Publicado: (2025)

Col is PSPACE-complete on Triangular Grids
por: Burke, Kyle, et al.
Publicado: (2025)

The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions
por: Pavlov, Gorgi
Publicado: (2026)

Thin Tree Verification is coNP-Complete
por: Moayyedi, Alice
Publicado: (2025)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
por: Knop, Dušan, et al.
Publicado: (2017)

On the number of spanning trees of bicirculant graphs
por: Yang, Jing, et al.
Publicado: (2026)

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands
por: Shalaby, Ahmed, et al.
Publicado: (2024)

On the Complexity of Problems on Graphs Defined on Groups
por: Das, Bireswar, et al.
Publicado: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
por: Bougeret, Marin, et al.
Publicado: (2024)

Kernelization dichotomies for hitting minors under structural parameterizations
por: Bougeret, Marin, et al.
Publicado: (2025)

The Bit Complexity of Dynamic Algebraic Formulas and their Determinants
por: Anand, Emile, et al.
Publicado: (2024)

The characteristic polynomials of $r$-uniform hypercycles with length $l$
por: Bo, Dong, et al.
Publicado: (2025)

On the hull and interval numbers of oriented graphs
por: Araujo, J., et al.
Publicado: (2022)

On Sampling Lower Bounds for Polynomials
por: Khodabandeh, Mohammad Mahdi, et al.
Publicado: (2026)

Classifying extrema using intervals
por: Gutowski, Marek W.
Publicado: (2006)

Polymer Dynamics via Cliques: New Conditions for Approximations
por: Friedrich, Tobias, et al.
Publicado: (2020)

On the complexity of Sandwich Problems for $M$-partitions
por: Barsukov, Alexey, et al.
Publicado: (2026)

Realizing temporal graphs from fastest travel times
por: Klobas, Nina, et al.
Publicado: (2023)

Graph Threading with Turn Costs
por: Demaine, Erik D., et al.
Publicado: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
por: Dvořák, Pavel, et al.
Publicado: (2017)

A Piecewise Approach for the Analysis of Exact Algorithms
por: Clinch, Katie, et al.
Publicado: (2024)

On the Min-Max Star Partitioning Number
por: Feldmann, Sarah, et al.
Publicado: (2024)

Transient Acceleration and Cross-Dissipation Interference in Fisher-Regularized Wasserstein Gradient Flows
por: Farmer, Michael, et al.
Publicado: (2026)

PosSLP and Sum of Squares
por: Bläser, Markus, et al.
Publicado: (2024)

New bounds on the modularity of $G(n,p)$
por: Rybarczyk, Katarzyna, et al.
Publicado: (2025)

Pauli measurements are not optimal for single-copy tomography
por: Acharya, Jayadev, et al.
Publicado: (2025)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

Action convergence of general hypergraphs and tensors
por: Zucal, Giulio
Publicado: (2023)

Complexity of Firefighting on Graphs
por: Althoetmar, Julius, et al.
Publicado: (2025)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
por: Könen, David, et al.
Publicado: (2023)

Label propagation on binomial random graphs
por: Kiwi, Marcos, et al.
Publicado: (2023)