The small-world phenomenon: an algorithmic perspective
From MaRDI portal
Publication:3191982
Recommendations
Cited in
(only showing first 100 items - show all)- Signal propagation in small-world biological networks with weak noise
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- scientific article; zbMATH DE number 1931809 (Why is no real title available?)
- Learning the structural vocabulary of a network
- Efficient routeing in Poisson small-world networks
- Optimal information transmission in organizations: Search and congestion
- Stronger trust and privacy in social networks via local cooperation
- Optimal temporal path on spatial decaying networks
- SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS
- Search in social networks using MCMC algorithm
- Orientation in social networks
- The idemetric property: when most distances are (almost) the same
- On the typical case complexity of graph optimization
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
- Distance estimation and object location via rings of neighbors
- Kleinberg's grid unchained
- Long-range connections, real-world networks and rates of diffusion
- A Hit‐and‐Run approach for generating scale invariant Small World networks
- Greedy routing and the algorithmic small-world phenomenon
- Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks
- Asymptotically optimal solutions for small world graphs
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Two-dimensional SIR epidemics with long range infection
- Greedy routing in small-world networks with power-law degrees
- Approximation algorithm for partial positive influence problem in social network
- Interval routing in reliability networks
- An MPI-based algorithm for mapping complex networks onto hierarchical architectures
- The critical node detection problem in networks: a survey
- Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
- Ultra-small scale-free geometric networks
- Navigation in small-world networks: a scale-free continuum model
- Fellow travelers phenomenon present in real-world networks
- Factoring small world networks
- Network alignment by discrete Ollivier-Ricci flow
- How humans learn and represent networks
- Some typical properties of the spatial preferred attachment model
- Eclecticism shrinks even small worlds
- On the tree conjecture for the network creation game
- Category-based routing in social networks: membership dimension and the small-world phenomenon
- Social context congestion games
- Boosting the exploration of huge dynamic graphs
- Navigation on a Poisson point process
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- Navigating Low-Dimensional and Hierarchical Population Networks
- Modeling the Small-World Phenomenon with Local Network Flow
- Close to optimal decentralized routing in long-range contact networks
- A study of how the Watts-Strogatz model relates to an economic system's utility
- Graph construction and random graph generation for modeling protein structures
- Neighbor selection and hitting probability in small-world graphs
- Delay of social search on small-world graphs
- Trust management for \(e\)-transactions
- Speeding up random walk mixing by starting from a uniform vertex
- On the tree conjecture for the network creation game
- Greedy routing and the algorithmic small-world phenomenon
- Recovering the long-range links in augmented graphs
- Interactive proofs for social graphs
- Universal augmentation schemes for network navigability
- Algorithms and Models for the Web-Graph
- On the connectivity and diameter of small-world networks
- The power grid as a complex network: a survey
- Optimal paths on the space-time SINR random graph
- Simple random walk on long-range percolation clusters. II: Scaling limits
- Distinct clusterings and characteristic path lengths in dynamic small-world networks with identical limit degree distribution
- Combinatorial properties of Farey graphs
- First-Order Model-Checking in Random Graphs and Complex Networks
- D2B: A de Bruijn based content-addressable network
- Modeling and Designing Real–World Networks
- Application of complex networks theory in urban traffic network researches
- A state-space mixed membership blockmodel for dynamic network tomography
- Greedy pathlengths and small world graphs
- Optimal routing in a small-world network
- On tree equilibria in max-distance network creation games
- Finding cliques in social networks: a new distribution-free model
- The Routing of Complex Contagion in Kleinberg’s Small-World Networks
- Brief announcement: The small world of curious beings
- Matrix analysis of a Markov chain small-world model
- Distance-based index structures for fast similarity search
- Expansion and Lack Thereof in Randomly Perturbed Graphs
- Topology adaption for the quantum Internet
- A Theory of Network Security: Principles of Natural Selection and Combinatorics
- Graph Embedding through Random Walk for Shortest Paths Problems
- The small world phenomenon in hybrid power law graphs
- Thresholding random geometric graph properties motivated by ad hoc sensor networks
- Modeling spatial networks by contact graphs of disk packings
- Decentralized search on spheres using small-world Markov chains: expected hitting times and structural properties
- Corona graphs as a model of small-world networks
- Harmony in the small-world
- On the searchability of small-world networks with arbitrary underlying structure
- Local embeddings of metric spaces
- Graphical congestion games
- Average geodesic distance on stretched Sierpiński gasket
- Araneola: a scalable reliable multicast system for dynamic environments
- Analyzing Kleinberg's (and other) small-world models
- Distributed routing in small-world networks
- Structure and function in human and primate social networks: implications for diffusion, network stability and health
- Simulations on correlated behavior and social learning
- Core size and densification in preferential attachment networks
- Depth of Field and Cautious-Greedy Routing in Social Networks
- The reduced PC-algorithm: improved causal structure learning in large random networks
- Depths in hooking networks
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)
