Cover Image

Efficient generation of expected-degree graphs via edge-arrivals

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	D'Angelo, Gianlorenzo, Michielan, Riccardo
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Mathematical Software Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Planted clique recovery in random geometric graphs
by: Avrachenkov, Konstantin, et al.
Published: (2025)

Optimizing Distances for Multi-Broadcast in Temporal Graphs
by: Carnevale, Daniele, et al.
Published: (2026)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
by: D'Angelo, Gianlorenzo, et al.
Published: (2025)

Instability of backoff protocols with arbitrary arrival rates
by: Goldberg, Leslie Ann, et al.
Published: (2022)

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

Rumors on evolving graphs through stationary times
by: Bonasorte, Vicenzo
Published: (2025)

Phase Transitions via Complex Extensions of Markov Chains
by: Liu, Jingcheng, et al.
Published: (2024)

Fast mixing in Ising models with a negative spectral outlier via Gaussian approximation
by: Mikulincer, Dan, et al.
Published: (2025)

On the tractability of sampling from the Potts model at low temperatures via random-cluster dynamics
by: Blanca, Antonio, et al.
Published: (2023)

Approximating Optimal Labelings for Temporal Connectivity
by: Carnevale, Daniele, et al.
Published: (2025)

Spectral Independence via Stability and Applications to Holant-Type Problems
by: Chen, Zongchen, et al.
Published: (2021)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
by: Feng, Weiming, et al.
Published: (2025)

On quantum to classical comparison for Davies generators
by: Basso, Joao, et al.
Published: (2025)

Efficiently matching random inhomogeneous graphs via degree profiles
by: Ding, Jian, et al.
Published: (2023)

Zero-free regions and concentration inequalities for hypergraph colorings in the local lemma regime
by: Liu, Jingcheng, et al.
Published: (2026)

A Tight Bound on Localization of Electrical Flows
by: Gurel-Gurevich, Ori, et al.
Published: (2026)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026)

Kawasaki dynamics beyond the uniqueness threshold
by: Bauerschmidt, Roland, et al.
Published: (2023)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024)

Fast relaxation of the random field Ising dynamics
by: Alaoui, Ahmed El, et al.
Published: (2023)

Faster Mixing of the Jerrum-Sinclair Chain
by: Chen, Xiaoyu, et al.
Published: (2025)

Sink-free orientations: a local sampler with applications
by: Anand, Konrad, et al.
Published: (2025)

Pirogov--Sinai Theory Beyond Lattices
by: Cannon, Sarah, et al.
Published: (2024)

Towards an Optimal Contention Resolution Scheme for Matchings
by: Nuti, Pranav, et al.
Published: (2022)

Perfect Sampling for Hard Spheres from Strong Spatial Mixing
by: Anand, Konrad, et al.
Published: (2023)

Constructive l2-Discrepancy Minimization with Additive Deviations
by: Dutta, Kunal
Published: (2025)

Trickle-Down in Localization Schemes and Applications
by: Anari, Nima, et al.
Published: (2024)

Cycling in the forest with Wilson's algorithm
by: Fanuel, Michaël, et al.
Published: (2024)

Log-Sobolev inequality for near critical Ising models
by: Bauerschmidt, Roland, et al.
Published: (2022)

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

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

Efficient Online Random Sampling via Randomness Recycling
by: Draper, Thomas L., et al.
Published: (2025)

Packing $K_r$s in bounded degree graphs
by: McKay, Michael, et al.
Published: (2022)

Decay of correlation for edge colorings when $q>3Δ$
by: Chen, Zejia, et al.
Published: (2025)

Permutation-Avoiding FFT-Based Convolution
by: Venkovic, Nicolas, et al.
Published: (2025)

A square root algorithm faster than Newton's method for multiprecision numbers, using floating-point arithmetic
by: Romano, Fabio
Published: (2024)

A New Initial Approximation Bound in the Durand Kerner Algorithm for Finding Polynomial Zeros
by: Sanjoyo, B. A., et al.
Published: (2025)

Boltzmann Sampling for Powersets without an Oracle
by: Peyen, Jean
Published: (2026)

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

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