A Hit‐and‐Run approach for generating scale invariant Small World networks
From MaRDI portal
Publication:5191130
DOI10.1002/net.20262zbMath1175.90063OpenAlexW4255780954MaRDI QIDQ5191130
Publication date: 28 July 2009
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/61434
Deterministic network models in operations research (90B10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov and semi-Markov decision processes (90C40)
Cites Work
- Unnamed Item
- Simulated annealing for constrained global optimization
- Improving hit-and-run for global optimization
- The small-world phenomenon
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- The Structure and Function of Complex Networks
- Collective dynamics of ‘small-world’ networks
- Simulated Annealing for Convex Optimization
- Solving convex programs by random walks
- Models of the small world.
- Implementing pure adaptive search for global optimization using Markov chain sampling
This page was built for publication: A Hit‐and‐Run approach for generating scale invariant Small World networks