Saved in:
| Main Author: | Nagel, Leonhard |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.14259 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
by: Nagel, Leonhard
Published: (2025)
by: Nagel, Leonhard
Published: (2025)
The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020)
by: Abbasizanjani, Hoda, et al.
Published: (2020)
On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026)
by: Barsukov, Alexey, et al.
Published: (2026)
Concentration via metastable mixing, with applications to the supercritical exponential random graph model
by: Winstein, Vilas
Published: (2025)
by: Winstein, Vilas
Published: (2025)
Quantitative central limit theorems for exponential random graphs
by: Winstein, Vilas
Published: (2025)
by: Winstein, Vilas
Published: (2025)
Metrics on Permutation Families Defined by a Restriction Graph
by: Tymoshenko, Danylo, et al.
Published: (2025)
by: Tymoshenko, Danylo, et al.
Published: (2025)
A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)
by: Kim, Jeong Han, et al.
Published: (2025)
Two approaches to low-parametric SimRank computation
by: Berezin, Egor P., et al.
Published: (2026)
by: Berezin, Egor P., et al.
Published: (2026)
Some Thoughts on Graph Similarity
by: Grohe, Martin
Published: (2024)
by: Grohe, Martin
Published: (2024)
Local iterative algorithms for approximate symmetry guided by network centralities
by: Hartman, David, et al.
Published: (2025)
by: Hartman, David, et al.
Published: (2025)
Extension property for partial automorphisms of the $n$-partite and semigeneric tournaments
by: Hubička, Jan, et al.
Published: (2024)
by: Hubička, Jan, et al.
Published: (2024)
The steady-states of splitter networks
by: Couëtoux, Basile, et al.
Published: (2024)
by: Couëtoux, Basile, et al.
Published: (2024)
Sparsification of Phylogenetic Covariance Matrices of $k$-Regular Trees
by: Svihla, Sean P., et al.
Published: (2024)
by: Svihla, Sean P., et al.
Published: (2024)
On Strict Brambles
by: Lardas, Emmanouil, et al.
Published: (2022)
by: Lardas, Emmanouil, et al.
Published: (2022)
Block coupling and rapidly mixing k-heights
by: Felsner, Stefan, et al.
Published: (2024)
by: Felsner, Stefan, et al.
Published: (2024)
On λ-backbone coloring of cliques with tree backbones in linear time
by: Michalik, Krzysztof, et al.
Published: (2021)
by: Michalik, Krzysztof, et al.
Published: (2021)
The bunkbed conjecture is false
by: Gladkov, Nikita, et al.
Published: (2024)
by: Gladkov, Nikita, et al.
Published: (2024)
REM universality for linear random energy
by: Concetti, Francesco, et al.
Published: (2026)
by: Concetti, Francesco, et al.
Published: (2026)
Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
by: Rose, Valentino Delle, et al.
Published: (2023)
by: Rose, Valentino Delle, et al.
Published: (2023)
Enumeration of Polyominoes up to Size N=59
by: Shirakawa, Toshihiro
Published: (2025)
by: Shirakawa, Toshihiro
Published: (2025)
Wasserstein distances between ERGMs and Erdős-Rényi models
by: Winstein, Vilas
Published: (2026)
by: Winstein, Vilas
Published: (2026)
The Collatz function as an automorphic Cayley colour graph:decidability of $an+b$ conjectures, proof of the $3n + 1$ conjecture
by: Kleinnijenhuis, Jan, et al.
Published: (2020)
by: Kleinnijenhuis, Jan, et al.
Published: (2020)
GMSNP and Finite Structures
by: Guzmán-Pro, Santiago
Published: (2024)
by: Guzmán-Pro, Santiago
Published: (2024)
An Improved Drift Theorem for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)
by: Los, Dimitrios, et al.
Published: (2023)
Graph Parameters, Universal Obstructions, and WQO
by: Paul, Christophe, et al.
Published: (2023)
by: Paul, Christophe, et al.
Published: (2023)
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
by: De Meyer, Lucas, et al.
Published: (2025)
by: De Meyer, Lucas, et al.
Published: (2025)
Compact Representation of Semilinear and Terrain-like Graphs
by: Cardinal, Jean, et al.
Published: (2025)
by: Cardinal, Jean, et al.
Published: (2025)
Reconstructing graphs and their connectivity using graphlets
by: Hartman, David, et al.
Published: (2025)
by: Hartman, David, et al.
Published: (2025)
Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
by: Patzner, Julian, et al.
Published: (2024)
by: Patzner, Julian, et al.
Published: (2024)
Permanental Energy of Graphs
by: Pant, Priyanshu, et al.
Published: (2026)
by: Pant, Priyanshu, et al.
Published: (2026)
The frequency $K_i$s for symmetrical traveling salesman problem
by: Wang, Yong
Published: (2025)
by: Wang, Yong
Published: (2025)
Facet-Hamiltonicity
by: Akitaya, Hugo, et al.
Published: (2024)
by: Akitaya, Hugo, et al.
Published: (2024)
Determining Factorial Speed Fast
by: Feng, Zhidan, et al.
Published: (2026)
by: Feng, Zhidan, et al.
Published: (2026)
Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
by: Masařík, Tomáš, et al.
Published: (2026)
by: Masařík, Tomáš, et al.
Published: (2026)
Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)
by: Liang, Kai
Published: (2025)
Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)
by: Shaw, Benedict Randall
Published: (2024)
Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)
by: Jartoux, Bruno
Published: (2022)
Likelihood-based Inference for Random Networks with Changepoints
by: Cirkovic, Daniel, et al.
Published: (2022)
by: Cirkovic, Daniel, et al.
Published: (2022)
Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2023)
by: Blanco, Saúl A., et al.
Published: (2023)
Similar Items
-
Quantitative Edge Eigenvector Universality for Random Regular Graphs: Berry-Esseen Bounds with Explicit Constants
by: Nagel, Leonhard
Published: (2025) -
The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020) -
On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026) -
Concentration via metastable mixing, with applications to the supercritical exponential random graph model
by: Winstein, Vilas
Published: (2025) -
Quantitative central limit theorems for exponential random graphs
by: Winstein, Vilas
Published: (2025)