Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Degree-preserving randomization

Known as: Degree Preserving Randomization 
Degree Preserving Randomization is a technique used in Network Science that aims to assess whether or not variations observed in a given graph could… Expand
Wikipedia

Related topics

Related topics

4 relations
Erdős–Rényi modelExponential random graph modelsNetwork controllability

Broader (1)

Network theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Preserving T-Transitivity
This contribution deals with the problem of aggregating T-equivalence relations, in the sense that we are looking for functions… Expand
Highly Cited
2007
Highly Cited
2007
A sub-cell based indicator for troubled zones in RKDG schemes and a novel class of hybrid RKDG+HWENO schemes
Abstract Runge–Kutta Discontinuous Galerkin (RKDG) schemes can provide highly accurate solutions for a large class of important… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
2007
2007
A note on 3 iet preserving morphisms
An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet… Expand
  • figure 1
2007
2007
A note on 3iet preserving morphisms
An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE