Short cycles in random regular graphs
From MaRDI portal
Recommendations
Cited in
(48)- On quantum percolation in finite regular graphs
- The Marčenko-Pastur law for sparse random bipartite biregular graphs
- A randomized construction of high girth regular graphs
- Cycles of given lengths in unicyclic components in sparse random graphs
- Short cycle distribution in random regular graphs recursively generated by pegging
- Subgraph distributions in dense random regular graphs
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- Local Kesten-McKay law for random regular graphs
- On coupon colorings of graphs
- Causal Structural Learning via Local Graphs
- Bipartite independence number in graphs with bounded maximum degree
- Quantum ergodicity for quantum graphs without back-scattering
- (Dis)assortative partitions on random regular graphs
- Limiting distribution of short cycles in inhomogeneous random uniform hypergraph
- Exchangeable pairs, switchings, and random regular graphs
- Poisson approximation of the length spectrum of random surfaces
- Two notions of unit distance graphs
- ``Immunetworks, intersecting circuits and dynamics
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
- Sparse regular random graphs: spectral density and eigenvectors
- The number of perfect matchings, and the nesting properties, of random regular graphs
- Geodesics and almost geodesic cycles in random regular graphs
- Simple versus nonsimple loops on random regular graphs
- Global eigenvalue fluctuations of random biregular bipartite graphs
- On the second eigenvalue of random bipartite biregular graphs
- Random cluster model on regular graphs
- Evaluations of Tutte polynomials of regular graphs
- Discrete graphs -- a paradigm model for quantum chaos
- Counting triangles in power-law uniform random graphs
- The length of closed geodesics on random Riemann surfaces
- Circuits in random graphs: from local trees to global loops
- Quantum ergodicity on large regular graphs
- Non-localization of eigenfunctions on large regular graphs
- Functional limit theorems for random regular graphs
- Threshold functions for small subgraphs in simple graphs and multigraphs
- Counting short cycles of \((c,d)\)-regular bipartite graphs
- Predicting Feynman periods in \(\phi^4\)-theory
- Size biased couplings and the spectral gap for random regular graphs
- High-dimensional structure estimation in Ising models: local separation criterion
- On the number of paths and cycles for almost all graphs and digraphs
- Triangles and subgraph probabilities in random regular graphs
- Expanders with respect to Hadamard spaces and random graphs
- Regular graphs whose subgraphs tend to be acyclic
- Exactly solvable random graph ensemble with extensively many short cycles
- Poisson eigenvalue statistics for random Schrödinger operators on regular graphs
- Cycle lengths in sparse random graphs
- L^p norms and support of eigenfunctions on graphs
- Kissing numbers of regular graphs
This page was built for publication: Short cycles in random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773189)
