Imagen de Portada

The Horton-Strahler number of butterfly trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Peca-Medlin, John
Formato:	Preprint
Publicado:	2025
Materias:	Probability Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Heights of butterfly trees
por: Peca-Medlin, John, et al.
Publicado: (2025)

Burning rooted graph products
por: Peca-Medlin, John
Publicado: (2026)

On the longest increasing subsequence and number of cycles of butterfly permutations
por: Peca-Medlin, John, et al.
Publicado: (2024)

Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential
por: Koehler, Frederic, et al.
Publicado: (2025)

Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
por: Shao, Shuai, et al.
Publicado: (2025)

An Easy Proof of a Weak Version of Chernoff inequality
por: Har-Peled, Sariel
Publicado: (2025)

Analysis of a Random Local Search Algorithm for Dominating Set
por: Higl, Hendrik
Publicado: (2026)

Mixing on Generalized Associahedra
por: Chang, William, et al.
Publicado: (2024)

Fast Mixing in Sparse Random Ising Models
por: Liu, Kuikui, et al.
Publicado: (2024)

Minimal spanning arborescence
por: Ray, Gourab, et al.
Publicado: (2024)

Strong spatial mixing for colorings on trees and its algorithmic applications
por: Chen, Zongchen, et al.
Publicado: (2023)

Polynomial-time sampling despite disorder chaos
por: Ma, Eric, et al.
Publicado: (2025)

Cycle-factors of regular graphs via entropy
por: Christoph, Micha, et al.
Publicado: (2025)

Approximate Counting in Local Lemma Regimes
por: Mann, Ryan L., et al.
Publicado: (2025)

Quality control in sublinear time: a case study via random graphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
por: Bansal, Nikhil, et al.
Publicado: (2025)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
por: Gaudio, Julia, et al.
Publicado: (2026)

Boltzmann Sampling for Powersets without an Oracle
por: Peyen, Jean
Publicado: (2026)

From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity
por: Shao, Shuai, et al.
Publicado: (2024)

Integrating High-Dimensional Functions Deterministically
por: Gamarnik, David, et al.
Publicado: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
por: Kunisky, Dmitriy, et al.
Publicado: (2023)

The Compilability Thresholds of 2-CNF to OBDD
por: de Colnet, Alexis, et al.
Publicado: (2026)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Some easy optimization problems have the overlap-gap property
por: Li, Shuangping, et al.
Publicado: (2024)

Probabilistic estimates of the diameters of the Rubik's Cube groups
por: Hirata, So
Publicado: (2024)

Local Limits of Small World Networks
por: Alimohammadi, Yeganeh, et al.
Publicado: (2025)

The Metric Dimension of Sparse Random Graphs
por: Díaz, Josep, et al.
Publicado: (2025)

Finding the diameter of a tree with distance queries
por: Gerbner, Dániel, et al.
Publicado: (2025)

Graph parameters that are coarsely equivalent to tree-length
por: Dragan, Feodor F.
Publicado: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
por: Yang, Chenxu, et al.
Publicado: (2023)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
por: Chudnovsky, Maria, et al.
Publicado: (2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
por: Bonamy, Marthe, et al.
Publicado: (2022)

A Method for Generating Connected Erdos-Renyi Random Graphs
por: Chinyaev, Boris
Publicado: (2025)

Sharp Online Hardness for Large Balanced Independent Sets
por: Dhawan, Abhishek, et al.
Publicado: (2025)

The Squishy Grid Problem
por: Cai, Zixi, et al.
Publicado: (2025)

The stochastic block model has the overlap graph property for modularity
por: Bhamidi, Shankar, et al.
Publicado: (2026)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
por: Kunisky, Dmitriy
Publicado: (2024)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
por: Dhawan, Abhishek, et al.
Publicado: (2024)

Inference of rankings planted in random tournaments
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Statistical inference of a ranked community in a directed graph
por: Kunisky, Dmitriy, et al.
Publicado: (2024)