Uniform Sampling and Visualization of 3D Reluctant Walks
Fuente:
arXiv
Saved in:
| Main Authors: | Buckley, Benjamin, Mishna, Marni |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
$ε$-Uniform Mixing in Discrete Quantum Walks
by: Zhan, Hanmeng
Published: (2023)
by: Zhan, Hanmeng
Published: (2023)
The Balanced Up-Down Walk
by: Akitaya, Hugo A., et al.
Published: (2026)
by: Akitaya, Hugo A., et al.
Published: (2026)
Menger's Theorem for Temporal Paths (Not Walks)
by: Ibiapina, Allen, et al.
Published: (2022)
by: Ibiapina, Allen, et al.
Published: (2022)
Making Graphs Irregular through Irregularising Walks
by: Bensmail, Julien, et al.
Published: (2025)
by: Bensmail, Julien, et al.
Published: (2025)
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
by: Bentert, Matthias, et al.
Published: (2023)
by: Bentert, Matthias, et al.
Published: (2023)
Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
by: Galanis, Andreas, et al.
Published: (2026)
by: Galanis, Andreas, et al.
Published: (2026)
Making Walks Count: From Silent Circles to Hamiltonian Cycles
by: Alekseyev, Max A., et al.
Published: (2016)
by: Alekseyev, Max A., et al.
Published: (2016)
Gathering Information about a Graph by Counting Walks from a Single Vertex
by: Fuhlbrück, Frank, et al.
Published: (2024)
by: Fuhlbrück, Frank, et al.
Published: (2024)
Multidimensional Quantum Walks, with Application to $k$-Distinctness
by: Jeffery, Stacey, et al.
Published: (2022)
by: Jeffery, Stacey, et al.
Published: (2022)
Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)
by: Arras, Patrick, et al.
Published: (2024)
Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs
by: Dutta, Supriyo
Published: (2024)
by: Dutta, Supriyo
Published: (2024)
Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026)
by: Jain, Vishesh, et al.
Published: (2026)
The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
by: Berrebi, Shoham Shimon, et al.
Published: (2025)
by: Berrebi, Shoham Shimon, et al.
Published: (2025)
Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric
by: Carlson, Charlie, et al.
Published: (2024)
by: Carlson, Charlie, et al.
Published: (2024)
Sampling Simultaneous Edge-Colorings
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)
by: Furtado-Tiwari, Ezra, et al.
Published: (2026)
Pseudorandomness of Expander Walks via Fourier Analysis on Groups
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
Spatio-Causal Patterns of Sample Growth
by: Ribeiro, Andre F.
Published: (2022)
by: Ribeiro, Andre F.
Published: (2022)
Uniform density in matroids, matrices and graphs
by: Devriendt, Karel, et al.
Published: (2023)
by: Devriendt, Karel, et al.
Published: (2023)
Decision problems on geometric tilings
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)
Conditional Separation as a Binary Relation. A Coq Assisted Proof
by: Chancelier, Jean-Philippe, et al.
Published: (2021)
by: Chancelier, Jean-Philippe, et al.
Published: (2021)
Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)
by: Bourneuf, Romain, et al.
Published: (2026)
Inflation of 2D boundary ghosts and digital watermarking
by: Svalbe, Imants, et al.
Published: (2024)
by: Svalbe, Imants, et al.
Published: (2024)
Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
by: Mohan, Amulya, et al.
Published: (2024)
by: Mohan, Amulya, et al.
Published: (2024)
Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2026)
by: Bläsius, Thomas, et al.
Published: (2026)
Approximate weighted 3-coloring
by: Erzin, Adil, et al.
Published: (2025)
by: Erzin, Adil, et al.
Published: (2025)
On arc-density of pushably $3$-critical oriented graphs
by: Das, Tapas, et al.
Published: (2025)
by: Das, Tapas, et al.
Published: (2025)
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
by: Galanis, Andreas, et al.
Published: (2023)
by: Galanis, Andreas, et al.
Published: (2023)
Sample compression schemes for balls in graphs
by: Chalopin, Jérémie, et al.
Published: (2022)
by: Chalopin, Jérémie, et al.
Published: (2022)
A Uniformly Random Solution to Algorithmic Redistricting
by: Cai, Jin-Yi, et al.
Published: (2024)
by: Cai, Jin-Yi, et al.
Published: (2024)
Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)
by: Crew, Logan, et al.
Published: (2026)
Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026)
by: Groenland, Carla, et al.
Published: (2026)
Block encoding the 3D heterogeneous Poisson equation with application to fracture flow
by: Pechan, Austin, et al.
Published: (2025)
by: Pechan, Austin, et al.
Published: (2025)
3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)
by: Gonçalves, Daniel
Published: (2025)
3-Colouring Planar Graphs
by: Dujmović, Vida, et al.
Published: (2025)
by: Dujmović, Vida, et al.
Published: (2025)
Intersecting families with covering number $3$
by: Kupavskii, Andrey
Published: (2024)
by: Kupavskii, Andrey
Published: (2024)
The 1/3-conjectures for domination in cubic graphs
by: Dorbec, Paul, et al.
Published: (2024)
by: Dorbec, Paul, et al.
Published: (2024)
Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)
by: Dippel, Jack, et al.
Published: (2025)
The Avoider-Enforcer game on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2025)
by: Galliot, Florian, et al.
Published: (2025)
Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
by: Schneider, Samuel, et al.
Published: (2025)
by: Schneider, Samuel, et al.
Published: (2025)
Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2022)
by: Galliot, Florian, et al.
Published: (2022)
Similar Items
-
$ε$-Uniform Mixing in Discrete Quantum Walks
by: Zhan, Hanmeng
Published: (2023) -
The Balanced Up-Down Walk
by: Akitaya, Hugo A., et al.
Published: (2026) -
Menger's Theorem for Temporal Paths (Not Walks)
by: Ibiapina, Allen, et al.
Published: (2022) -
Making Graphs Irregular through Irregularising Walks
by: Bensmail, Julien, et al.
Published: (2025) -
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
by: Bentert, Matthias, et al.
Published: (2023)