Matchings on Random Regular Hypergraphs

08/25/2021
by   Zhongyang Li, et al.
0

We prove the convergence in probability of free energy for matchings on random regular, uniform hypergraphs and explicitly compute the limit. We also obtain a region on parameters where replica symmetry holds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/23/2021

Many nodal domains in random regular graphs

Let G be a random d-regular graph. We prove that for every constant α > ...
research
06/13/2021

On rainbow-free colourings of uniform hypergraphs

We study rainbow-free colourings of k-uniform hypergraphs; that is, colo...
research
12/28/2021

It is better to be semi-regular when you have a low degree

We study the algebraic connectivity for several classes of random semi-r...
research
11/30/2021

One-step replica symmetry breaking of random regular NAE-SAT II

Continuing our earlier work in <cit.>, we study the random regular k-NAE...
research
11/02/2022

The degree-restricted random process is far from uniform

The degree-restricted random process is a natural algorithmic model for ...
research
03/09/2021

Column randomization and almost-isometric embeddings

The matrix A:ℝ^n →ℝ^m is (δ,k)-regular if for any k-sparse vector x, ...
research
04/08/2016

A system of serial computation for classified rules prediction in non-regular ontology trees

Objects or structures that are regular take uniform dimensions. Based on...

Please sign up or login with your details

Forgot password? Click here to reset