Simulating weighted, directed small-world networks
From MaRDI portal
Publication:979306
DOI10.1016/j.amc.2010.03.045zbMath1221.05192MaRDI QIDQ979306
Publication date: 25 June 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.045
network; asymmetry; simulation; Dijkstra's algorithm; clustering coefficient; small-world; path length; weighted digraph; distance constrained; Watts-Strogatz model; weight constrained
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C22: Signed and weighted graphs
Related Items
Markov chain small-world model with asymmetry: a unified and multivariate perspective, Average case analysis of the Markov chain small-world model
Cites Work
- Phase transitions in social networks
- Triangles in random graphs
- Complex networks: structure and dynamics
- Matrix analysis of a Markov chain small-world model
- Markov chain small-world model with asymmetric transition probabilities
- A Matrix Perturbation View of the Small World Phenomenon
- Collective dynamics of ‘small-world’ networks
- Exploring complex networks
- A General Framework for Weighted Gene Co-Expression Network Analysis