Imagen de Portada

Optimal factor matchings for point processes on non-amenable unimodular graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Spinka, Yinon, Yakir, Oren
Formato:	Preprint
Publicado:	2026
Materias:	Probability Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal matchings of randomly perturbed lattices
por: Elboim, Dor, et al.
Publicado: (2025)

A noisy min-max game on trees
por: Angel, Omer, et al.
Publicado: (2026)

Finitary codings and stochastic domination for Poisson representable processes
por: Spinka, Yinon
Publicado: (2025)

Spectral non-concentration near the top for unimodular random graphs
por: Fraczyk, Mikolaj, et al.
Publicado: (2024)

A new proof of finitary isomorphism for Markov chains
por: Spinka, Yinon
Publicado: (2025)

Long-range order in discrete spin systems
por: Peled, Ron, et al.
Publicado: (2020)

On the local convergence of integer-valued Lipschitz functions on regular trees
por: Butler, Nathaniel, et al.
Publicado: (2024)

Optimally building spanning graphs in semirandom graph processes
por: Anastos, Michael, et al.
Publicado: (2025)

Universality of the matching number in percolated regular graphs
por: Diskin, Sahar, et al.
Publicado: (2025)

A lower bound on the spectrum of unimodular networks
por: Rahman, Mustazee
Publicado: (2016)

A central limit theorem for the matching number of a sparse random graph
por: Glasgow, Margalit, et al.
Publicado: (2024)

Random walks on regular trees can not be slowed down
por: Angel, Omer, et al.
Publicado: (2023)

The Moran process on a random graph
por: Frieze, Alan, et al.
Publicado: (2024)

The random graph process is globally synchronizing
por: Jain, Vishesh, et al.
Publicado: (2025)

Fixation of leadership in non-Markovian growth processes
por: Iyer, Tejas
Publicado: (2024)

The Gelfand-Tsetlin graph and Markov processes
por: Olshanski, Grigori
Publicado: (2014)

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
por: Diskin, Sahar, et al.
Publicado: (2024)

Optimal graph joining with applications to isomorphism detection and identification
por: Hoàng, Phuong N., et al.
Publicado: (2025)

Universal geometric non-embedding of random regular graphs
por: Altschuler, Dylan J., et al.
Publicado: (2025)

Fixed points of non-uniform permutations and representation theory of the symmetric group
por: Fulman, Jason
Publicado: (2024)

Critical threshold for regular graphs
por: Bhadoo, Ishaan
Publicado: (2024)

Clique packings in random graphs
por: Griffiths, Simon, et al.
Publicado: (2024)

Large charge fluctuations in the hierarchical Coulomb gas
por: Nishry, Alon, et al.
Publicado: (2024)

Correlation decay for U(1) lattice Higgs theory: the case of small mass
por: Chatterjee, Sourav, et al.
Publicado: (2025)

A simple proof of local universality for roots of Kac polynomials
por: Michelen, Marcus, et al.
Publicado: (2025)

A determinantal point process approach to scaling and local limits of random Young tableaux
por: Borga, Jacopo, et al.
Publicado: (2023)

Thresholds for colouring the random Borsuk graph
por: Montero, Álvaro Acitores, et al.
Publicado: (2026)

On the $H$-space of a random graph
por: Dubroff, Quentin, et al.
Publicado: (2024)

Tree tilings in random regular graphs
por: Diskin, Sahar, et al.
Publicado: (2024)

Hitting times in the binomial random graph
por: Granet, Bertille, et al.
Publicado: (2024)

Eigenvalue gaps of the Laplacian of random graphs
por: Christoffersen, Nicholas, et al.
Publicado: (2024)

The Lovász number of random circulant graphs
por: Bandeira, Afonso S., et al.
Publicado: (2025)

On the geometry of exponential random graphs and applications
por: Tarkeshian, Mohabat
Publicado: (2024)

Stability of large cuts in random graphs
por: Hoshen, Ilay, et al.
Publicado: (2024)

The hypergraph removal process
por: Joos, Felix, et al.
Publicado: (2024)

On the intersecting family process
por: Bennett, Patrick, et al.
Publicado: (2023)

Note on the trace of random walks on pseudorandom graphs
por: Chen, Yaobin, et al.
Publicado: (2026)

The geometry of the giant component of random geometric graphs
por: Dubin, Karoline, et al.
Publicado: (2026)

The critical Karp--Sipser core of random graphs
por: Budzinski, Thomas, et al.
Publicado: (2022)

Singularity of the k-core of a random graph
por: Ferber, Asaf, et al.
Publicado: (2021)