Random Regular Graphs: Asymptotic Distributions and Contiguity
From MaRDI portal
Publication:4868737
DOI10.1017/S0963548300001735zbMath0846.05076OpenAlexW2037114373MaRDI QIDQ4868737
Publication date: 29 September 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300001735
Related Items
Testing community structure for hypergraphs, A likelihood-ratio type test for stochastic block models with bounded degrees, Spanning trees in random regular uniform hypergraphs, On the number of circuits in random graphs, The Number of Satisfying Assignments of Random Regulark-SAT Formulas, Some remarks on rainbow connectivity, 3-star factors in random \(d\)-regular graphs, Random 4-regular graphs have 3-star decompositions asymptotically almost surely, On the number of solutions in random hypergraph 2-colouring, Statistical limits of spiked tensor models, The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees, The number of Euler tours of random directed graphs, Discrepancy properties for random regular digraphs, On the modularity of 3‐regular random graphs and random graphs with given degree sequences, Cycle lengths in sparse random graphs, On the number of spanning trees in random regular graphs, The number of perfect matchings, and the nesting properties, of random regular graphs, A transition of limiting distributions of large matchings in random graphs, On the chromatic number of random regular graphs, On the minimum bisection of random 3-regular graphs, Random amenable C*-algebras, Triangles and subgraph probabilities in random regular graphs, Cycle Factors and Renewal Theory, The circular law for random regular digraphs with random edge weights, Optimal linear‐Vizing relationships for (total) domination in graphs, Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models, Planting Colourings Silently, The distribution of sandpile groups of random regular graphs, Reconstruction and estimation in the planted partition model, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, Charting the replica symmetric phase, Limiting distribution of short cycles in inhomogeneous random uniform hypergraph, Contiguity and non-reconstruction results for planted partition models: the dense case, Circular law for the sum of random permutation matrices, Charting the replica symmetric phase, Hamilton cycles containing randomly selected edges in random regular graphs, Hamilton cycles in the union of random permutations, Unnamed Item, Minors in random regular graphs, Asymptotic equivalence and contiguity of some random graphs, Unnamed Item, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Nonreconstruction of high-dimensional stochastic block model with bounded degree, The circular law for random regular digraphs, Optimality and sub-optimality of PCA. I: Spiked random matrix models, Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs, Fluctuation of the free energy of Sherrington-Kirkpatrick model with Curie-Weiss interaction: the paramagnetic regime, On the Number of Solutions in Random Graphk-Colouring, THE ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF 3-STAR FACTORS IN RANDOM d-REGULAR GRAPHS, Rigid Colorings of Hypergraphs and Contiguity, Small maximal matchings of random cubic graphs, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, The replica symmetric phase of random constraint satisfaction problems, Deterministic counting of graph colourings using sequences of subgraphs, The generalized acyclic edge chromatic number of random regular graphs, Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results, Optimal signal detection in some spiked random matrix models: likelihood ratio tests and linear spectral statistics, Distribution of the number of spanning regular subgraphs in random graphs, Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs, Regular graphs with no homomorphisms onto cycles
Cites Work
- Unnamed Item
- The number of matchings in random regular graphs and bipartite graphs
- Asymptotic methods in statistical decision theory
- The asymptotic distribution of short cycles in random regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- Small cliques in random graphs
- Almost all cubic graphs are Hamiltonian
- Counting the Number of Hamilton Cycles in Random Digraphs
- Almost all regular graphs are hamiltonian
- Hamilton Cycles in Random Regular Digraphs
- The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
- Orthogonal decompositions and functional limit theorems for random graph statistics
- Contiguity of Probability Measures
