Random induced subgraphs of generalized n-cubes
From MaRDI portal
Asymptotic results are given for connected components of the random subgraph induced by independently selected vertices from a generalized \(n\)-cube.
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Generic properties of combinatory maps: Neutral networks of RNA secondary structures
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 1870235 (Why is no real title available?)
- scientific article; zbMATH DE number 874694 (Why is no real title available?)
- scientific article; zbMATH DE number 3190745 (Why is no real title available?)
- Largest random component of a k-cube
- Probabilistic methods in group theory
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Strong uniform times and finite random walks
Cited in
(9)- On induced subgraphs of the cube
- Random subgraphs of Cayley graphs over p-groups
- Fast Fourier transform for fitness landscapes
- Neutral networks of sequence to shape maps
- Loop homology of bi-secondary structures
- scientific article; zbMATH DE number 747047 (Why is no real title available?)
- Neutrality in fitness landscapes.
- Local connectivity of neutral networks
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
This page was built for publication: Random induced subgraphs of generalized \(n\)-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373443)