Pith. sign in

REVIEW 1 cited by

Towards random uniform sampling of bipartite graphs with given degree sequence

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1004.2612 v4 pith:ORKSJGWQ submitted 2010-04-15 math.CO

Péter L. Erdös , Istán Miklós , Lajos Soukup This is my paper · ORCID
classification math.CO
keywords degreesequencebipartitechaingivengraphsmarkovabove
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on $n$ vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in $n$ in case of {\em semi-regular} degree sequence. The novelty of our approach lays in the construction of the canonical paths in Sinclair's method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A scale invariant extension of the Georgi Machacek model

    hep-ph 2025-04 reject novelty 5.0 of 10

    By adding a gauge-singlet scalar to the Georgi-Machacek model and imposing classical scale invariance, the electroweak scale arises radiatively and the model predicts a scalon below 200 GeV and a heavier scalar below 600 GeV.

Pith tools