The small-world phenomenon: an algorithmic perspective
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Universal augmentation schemes for network navigability
- Estimating network size from local information
- Navigable small-world networks with few random bits
- Harmony in the small-world
- Signal propagation in small-world biological networks with weak noise
- The power grid as a complex network: a survey
- Distance-based index structures for fast similarity search
- A study of how the Watts-Strogatz model relates to an economic system's utility
- Network alignment by discrete Ollivier-Ricci flow
- Computing the eccentricity distribution of large graphs
- The critical node detection problem in networks: a survey
- Interval routing in reliability networks
- The gravitational law of social interaction
- Simple random walk on long-range percolation clusters. II: Scaling limits
- Distance estimation and object location via rings of neighbors
- HyperTree for self-stabilizing peer-to-peer systems
- Traffic dynamics on complex networks: a survey
- On the tree conjecture for the network creation game
- Topology adaption for the quantum Internet
- Application of complex networks theory in urban traffic network researches
- Two-dimensional SIR epidemics with long range infection
- Greedy routing and the algorithmic small-world phenomenon
- Fellow travelers phenomenon present in real-world networks
- Factoring small world networks
- Interactive proofs for social graphs
- Average geodesic distance on stretched Sierpiński gasket
- Kleinberg's grid unchained
- Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
- Equilibria and efficiency loss in games on networks
- Greedy routing in small-world networks with power-law degrees
- Optimal information transmission in organizations: Search and congestion
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Combinatorial properties of Farey graphs
- Broadcasting in unstructured peer-to-peer overlay networks
- D2B: A de Bruijn based content-addressable network
- Could any graph be turned into a small-world?
- Eclecticism shrinks even small worlds
- How to use spanning trees to navigate in graphs
- Orientation in social networks
- Navigation on a Poisson point process
- Greedy pathlengths and small world graphs
- Optimal routing in a small-world network
- Matrix analysis of a Markov chain small-world model
- Trust management for \(e\)-transactions
- Mathematical programming models for some smallest-world problems
- Close to optimal decentralized routing in long-range contact networks
- On the typical case complexity of graph optimization
- The Routing of Complex Contagion in Kleinberg’s Small-World Networks
- Graph construction and random graph generation for modeling protein structures
- On the searchability of small-world networks with arbitrary underlying structure
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications
- Optimal paths on the space-time SINR random graph
- Content search through comparisons
- Simulations on correlated behavior and social learning
- How to Use Spanning Trees to Navigate in Graphs
- Observability of lattice graphs
- Boosting the exploration of huge dynamic graphs
- Corona graphs as a model of small-world networks
- Information diffusion in social sensing
- On the tree conjecture for the network creation game
- The small world phenomenon in hybrid power law graphs
- A Matrix Perturbation View of the Small World Phenomenon
- Core size and densification in preferential attachment networks
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Local/Global Phenomena in Geometrically Generated Graphs
- A statistical construction of power-law networks
- Decentralized search on spheres using small-world Markov chains: expected hitting times and structural properties
- Modeling and Designing Real–World Networks
- Graph Embedding through Random Walk for Shortest Paths Problems
- Social context congestion games
- Category-based routing in social networks: membership dimension and the small-world phenomenon
- Lack of Gromov-hyperbolicity in small-world networks
- Araneola: a scalable reliable multicast system for dynamic environments
- Merging ring-structured overlay indices: toward network-data transparency
- Data mining of social networks represented as graphs
- Twitter financial community sentiment and its predictive relationship to stock market movement
- scientific article; zbMATH DE number 1931809 (Why is no real title available?)
- Fractality of substitution networks
- Weighted message passing and minimum energy flow for heterogeneous stochastic block models with side information
- Some typical properties of the spatial preferred attachment model
- Stronger trust and privacy in social networks via local cooperation
- Analysis of Contagion Maps on a Class of Networks That Are Spatially Embedded in a Torus
- Finding cliques in social networks: a new distribution-free model
- Depths in hooking networks
- SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS
- How humans learn and represent networks
- Random walks in heterogeneous weighted pseudo-fractal webs with the same weight sequence
- Finding cliques in social networks: a new distribution-free model
- Approximation algorithm for partial positive influence problem in social network
- Optimal temporal path on spatial decaying networks
- The idemetric property: when most distances are (almost) the same
- Contributions of modern network science to the cognitive sciences: revisiting research spirals of representation and process
- Structure and function in human and primate social networks: implications for diffusion, network stability and health
- Shortest-path queries in static networks
- Search in social networks using MCMC algorithm
- A Hit‐and‐Run approach for generating scale invariant Small World networks
- The reduced PC-algorithm: improved causal structure learning in large random networks
- Distributed routing in small-world networks
- Navigation in real-world complex networks through embedding in latent spaces
This page was built for publication: The small-world phenomenon: an algorithmic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191982)
