Navigation in spatial networks: a survey
From MaRDI portal
Publication:1782452
DOI10.1016/j.physa.2013.09.014zbMath1395.90060OpenAlexW2014173443WikidataQ68953394 ScholiaQ68953394MaRDI QIDQ1782452
Wei Huang, Sheng-Yong Chen, Wan-Liang Wang
Publication date: 20 September 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2013.09.014
Social networks; opinion dynamics (91D30) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items
Biased random walks on Kleinberg's spatial networks, OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS, Fractional diffusion on circulant networks: emergence of a dynamical small world, Random walks with long-range steps generated by functions of Laplacian matrices, Greedy routing and the algorithmic small-world phenomenon
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Random walks and flights over connected graphs and complex networks
- \(k\)-core architecture and \(k\)-core percolation on complex networks
- Recovering the long-range links in augmented graphs
- Dynamical aspects of macroscopic and quantum transitions due to coherence function and time series events
- Renormalization group analysis of the small-world network model
- Lectures on analysis on metric spaces
- Information transfer and phase transitions in a model of internet traffic
- Self-organized critical traffic in parallel computer networks
- Edge vulnerability in neural and metabolic networks
- An algorithm for drawing general undirected graphs
- Metric structure of random networks
- Traffic dynamics on complex networks: a survey
- Complex networks: structure and dynamics
- On a conjecture related to geometric routing
- Close to optimal decentralized routing in long-range contact networks
- A Guide to First-Passage Processes
- Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
- Statistical mechanics of complex networks
- A Lower Bound for Network Navigability
- Emergence of Scaling in Random Networks
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Convex Representations of Graphs
- On the strength of connectedness of a random graph
- Networks Become Navigable as Nodes Move and Forget
- Dynamical Processes on Complex Networks
- Know thy neighbor's neighbor
- Plongements lipschitziens dans ${\bbfR}\sp n$
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- The restaurant at the end of the random walk: recent developments in the description of anomalous transport by fractional dynamics
- Algorithms and Models for the Web-Graph
- Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
- Collective dynamics of ‘small-world’ networks
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Eclecticism shrinks even small worlds
- Analyzing Kleinberg's (and other) small-world Models
- An evolving network model with community structure
- Networks
- Communication and optimal hierarchical networks
- Routing with guaranteed delivery in ad hoc wireless networks
