The degree-restricted random process is far from uniform

DOI10.1016/J.JCTB.2025.08.001MaRDI QIDQ6862420zbMATH OpenFDO

Authors Mike Molloy, Lutz Warnke

Publication date 9 February 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2025.08.001

zbMATH Keywords

randomized algorithmsapproximationgreedy algorithmsrandom graph process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• scientific article; zbMATH DE number 434917 (Why is no real title available?)
• scientific article; zbMATH DE number 3878944 (Why is no real title available?)
• scientific article; zbMATH DE number 4081614 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 617586 (Why is no real title available?)
• scientific article; zbMATH DE number 1033851 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• scientific article; zbMATH DE number 932188 (Why is no real title available?)
• scientific article; zbMATH DE number 1405894 (Why is no real title available?)
• scientific article; zbMATH DE number 4196022 (Why is no real title available?)
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A transition of limiting distributions of large matchings in random graphs
• Almost all regular graphs are hamiltonian
• Approximate counting of regular hypergraphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration of Latin rectangles
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Asymptotic enumeration of sparse multigraphs with given degrees
• Asymptotic equivalence and contiguity of some random graphs
• Connectedness of graphs generated by a random d-process
• Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
• Differential equations for random processes and random graphs
• Dynamic concentration of the triangle‐free process
• Dynamics of random graphs with bounded degrees
• Enumeration of graphs with a heavy-tailed degree sequence
• Hamiltonicity of random graphs produced by 2‐processes
• How to determine if a random graph with a fixed degree sequence has a giant component
• Intercalates and discrepancy in random Latin squares
• Introduction to Random Graphs
• Julius Petersen's theory of regular graphs
• Large deviations in random latin squares
• Large girth approximate Steiner triple systems
• Lectures on Complex Networks
• Network science. With Márton Pósfai
• Networks
• On the method of typical bounded differences
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Preferential attachment without vertex growth: emergence of the giant component
• Random Graph Processes with Degree Restrictions
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Random graph processes with maximum degree 2
• Random hypergraph processes with degree restrictions
• Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
• Statistical mechanics of complex networks
• Subgraphs of random graphs with specified degrees
• The early evolution of the \(H\)-free process
• The theory of regular graphs
• The triangle-free process
• The triangle-free process and the Ramsey number \(R(3,k)\)

Cited in

(1)

• Local limit of the random degree constrained process

This page was built for publication: The degree-restricted random process is far from uniform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862420)