Random Regular Graphs: Asymptotic Distributions and Contiguity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Almost all cubic graphs are Hamiltonian
- Almost all regular graphs are hamiltonian
- Asymptotic methods in statistical decision theory
- Contiguity of Probability Measures
- Counting the Number of Hamilton Cycles in Random Digraphs
- Hamilton Cycles in Random Regular Digraphs
- Orthogonal decompositions and functional limit theorems for random graph statistics
- Small cliques in random graphs
- The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
- The asymptotic distribution of short cycles in random regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- The number of matchings in random regular graphs and bipartite graphs
Cited in
(73)- Local geometry of NAE-SAT solutions in the condensation regime
- Random graphs, geometry and asymptotic structure
- Contiguity and non-reconstruction results for planted partition models: the dense case
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
- Edge correlations in Random regular hypergraphs and applications to subgraph testing
- Random amenable C*-algebras
- On the number of spanning trees in random regular graphs
- Statistical limits of spiked tensor models
- On the minimum bisection of random 3-regular graphs
- Deterministic counting of graph colourings using sequences of subgraphs
- Sprinkling with random regular graphs
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- A likelihood-ratio type test for stochastic block models with bounded degrees
- Optimal signal detection in some spiked random matrix models: likelihood ratio tests and linear spectral statistics
- Spanning trees in random regular uniform hypergraphs
- Circular law for the sum of random permutation matrices
- Testing community structure for hypergraphs
- 3-star factors in random d-regular graphs
- Rigid colorings of hypergraphs and contiguity
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- Regular graphs with no homomorphisms onto cycles
- Fluctuation of the free energy of Sherrington-Kirkpatrick model with Curie-Weiss interaction: the paramagnetic regime
- Cycle factors and renewal theory
- The number of Euler tours of random directed graphs
- The distribution of sandpile groups of random regular graphs
- scientific article; zbMATH DE number 7731163 (Why is no real title available?)
- On the number of circuits in random graphs
- The circular law for random regular digraphs with random edge weights
- Charting the replica symmetric phase
- Planting colourings silently
- Limiting distribution of short cycles in inhomogeneous random uniform hypergraph
- Exchangeable pairs, switchings, and random regular graphs
- The replica symmetric phase of random constraint satisfaction problems
- Random 4-regular graphs have 3-star decompositions asymptotically almost surely
- Nonreconstruction of high-dimensional stochastic block model with bounded degree
- Discrepancy properties for random regular digraphs
- On the chromatic number of random regular graphs
- The degree-restricted random process is far from uniform
- Permutation Pseudographs and Contiguity
- On the number of solutions in random hypergraph 2-colouring
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- The circular law for random regular digraphs
- The number of perfect matchings, and the nesting properties, of random regular graphs
- Charting the replica symmetric phase
- Satisfiability thresholds for regular occupation problems
- Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
- scientific article; zbMATH DE number 1335045 (Why is no real title available?)
- Hamilton cycles containing randomly selected edges in random regular graphs
- A transition of limiting distributions of large matchings in random graphs
- Edge rigidity and universality of random regular graphs of intermediate degree
- Small maximal matchings of random cubic graphs
- The number of satisfying assignments of random regular k-SAT formulas
- Optimal linear‐Vizing relationships for (total) domination in graphs
- Distribution of the number of spanning regular subgraphs in random graphs
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Satisfiability thresholds for regular occupation problems
- Asymptotic equivalence and contiguity of some random graphs
- On the modularity of 3‐regular random graphs and random graphs with given degree sequences
- On the number of solutions in random graph \(k\)-colouring
- Decomposing random regular graphs into stars
- Minors in random regular graphs
- Reconstruction and estimation in the planted partition model
- The first-order contiguity of sparse random graphs with prescribed degrees
- Random regular graphs with edge faults: Expansion through cores
- Local resilience and hamiltonicity maker-breaker games in random regular graphs
- The generalized acyclic edge chromatic number of random regular graphs
- Triangles and subgraph probabilities in random regular graphs
- Modulo k-orientations of random regular graphs
- The asymptotic distribution of the number of 3-star factors in random d-regular graphs
- Almost all 9-regular graphs have a modulo-5 orientation
- Cycle lengths in sparse random graphs
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Hamilton cycles in the union of random permutations
This page was built for publication: Random Regular Graphs: Asymptotic Distributions and Contiguity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868737)
