:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Simal, Cédric, Petit, Julien, Carletti, Timoteo
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2506.14353
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On cospectral graphons
by: Hladký, Jan, et al.
Published: (2024)

Hamiltonicity of Step-graphon
by: Chen, Xudong
Published: (2025)

Poisson-Dirichlet graphons and permutons
by: Stufler, Benedikt
Published: (2026)

Parameterized Shortest Path Reconfiguration
by: Bousquet, Nicolas, et al.
Published: (2024)

Large deviation principles for graphon sampling
by: Grebík, Jan, et al.
Published: (2023)

The dual Cheeger-Buser inequality for graphons
by: Pokharanakar, Mugdha Mahesh
Published: (2025)

Higher-order Cheeger inequalities for graphons
by: Pokharanakar, Mugdha Mahesh
Published: (2025)

Assisted Shortest Path Planning for a Convoy through a Repairable Network
by: Bhadoriya, Abhay Singh, et al.
Published: (2022)

Consistent sampling of Paley-Wiener functions on graphons
by: Führ, Hartmut, et al.
Published: (2025)

Optimal graphons in the edge-2star model
by: Radin, Charles, et al.
Published: (2023)

Graph sequences sampled from Robinson graphons
by: Ghandehari, Mahya, et al.
Published: (2020)

From flip processes to dynamical systems on graphons
by: Garbe, Frederik, et al.
Published: (2022)

Scaling limits and universality: Critical percolation on weighted graphs converging to an $L^3$ graphon
by: Baslingker, Jnaneshwar, et al.
Published: (2023)

Central limit theorems for linear spectral statistics of inhomogeneous random graphs with graphon limits
by: Zhu, Xiangyi, et al.
Published: (2024)

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

Finite rank kernel varieties: A variant of Hilbert's Nullstellensatz for graphons and applications to Hadamard matrices
by: Andersen, Madelyn
Published: (2021)

Mixed Steiner Triples Systems with Shortest Length
by: Etzion, Tuvi
Published: (2025)

Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths
by: Bodwin, Greg, et al.
Published: (2023)

A noncommutative approach to the graphon Fourier transform
by: Ghandehari, Mahya, et al.
Published: (2021)

Probability graphons: the right convergence point of view
by: Zucal, Giulio
Published: (2024)

Weak randomness in graphons and theons
by: Coregliano, Leonardo N., et al.
Published: (2022)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
by: Bonnet, Édouard, et al.
Published: (2026)

On the location and the strength of controllers to desynchronize coupled Kuramoto oscillators
by: Moriamé, Martin, et al.
Published: (2023)

Non-reciprocal interactions enhance heterogeneity
by: Carletti, Timoteo, et al.
Published: (2021)

Finite propagation enhances Turing patterns in reaction-diffusion networked systems
by: Carletti, Timoteo, et al.
Published: (2021)

Exponential odd-distance sets under the Manhattan metric
by: Díaz, Alberto Espuny, et al.
Published: (2024)

All-to-all Routing on Kautz Graphs: Regular Routing Beats Shortest Paths
by: Faber, Vance, et al.
Published: (2026)

The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024)

Up-down chains and scaling limits: application to permuton- and graphon-valued diffusions
by: Féray, Valentin, et al.
Published: (2025)

A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)

Codes with symmetric distances
by: Hegedüs, Gábor, et al.
Published: (2025)

The devil's staircase for chip-firing on random graphs and on graphons
by: Kiss, Viktor, et al.
Published: (2020)

Weakly distance-regular digraphs whose underlying graphs are distance-regular,II
by: Zeng, Qing, et al.
Published: (2024)

Weakly distance-regular digraphs whose underlying graphs are distance-regular, I
by: Yang, Yuefeng, et al.
Published: (2023)

Large deviations for probability graphons
by: Dionigi, Pierfrancesco, et al.
Published: (2025)

Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances
by: Barnes, Douglas, et al.
Published: (2024)

Shortest self-orthogonal embeddings of binary linear codes
by: An, Junmin, et al.
Published: (2025)

Diameter of 2-distance graphs
by: Jafari, S. H., et al.
Published: (2024)

Connectivity of $3$-distance graphs
by: Musawi, S. R., et al.
Published: (2024)

Improved bounds for the Fourier uniformity conjecture
by: Pilatte, Cédric
Published: (2026)