A Hit‐and‐Run approach for generating scale invariant Small World networks (Q5191130): Difference between revisions

@@ Property / cites work @@
+Solving convex programs by random walks
@@ Property / cites work: Solving convex programs by random walks / rank @@
+Normal rank
@@ Property / cites work @@
+Simulated Annealing for Convex Optimization
@@ Property / cites work: Simulated Annealing for Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+The small-world phenomenon
@@ Property / cites work: The small-world phenomenon / rank @@
+Normal rank
@@ Property / cites work @@
+Q5491023
@@ Property / cites work: Q5491023 / rank @@
+Normal rank
@@ Property / cites work @@
+Models of the small world.
@@ Property / cites work: Models of the small world. / rank @@
+Normal rank
@@ Property / cites work @@
+The Structure and Function of Complex Networks
@@ Property / cites work: The Structure and Function of Complex Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing pure adaptive search for global optimization using Markov chain sampling
+Normal rank
@@ Property / cites work @@
+Simulated annealing for constrained global optimization
+Normal rank
@@ Property / cites work @@
+Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
+Normal rank
@@ Property / cites work @@
+Collective dynamics of ‘small-world’ networks
@@ Property / cites work: Collective dynamics of ‘small-world’ networks / rank @@
+Normal rank
@@ Property / cites work @@
+Improving hit-and-run for global optimization
@@ Property / cites work: Improving hit-and-run for global optimization / rank @@
+Normal rank