The small-world phenomenon: an algorithmic perspective
From MaRDI portal
Publication:3191982
DOI10.1145/335305.335325zbMATH Open1296.05181OpenAlexW2128678576WikidataQ55899226 ScholiaQ55899226MaRDI QIDQ3191982FDOQ3191982
Authors: Jon M. Kleinberg 
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335325
Recommendations
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cited In (only showing first 100 items - show all)
- Neighbor selection and hitting probability in small-world graphs
- Recovering the long-range links in augmented graphs
- On the connectivity and diameter of small-world networks
- Universal augmentation schemes for network navigability
- Optimal paths on the space-time SINR random graph
- The power grid as a complex network: a survey
- 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
- D2B: A de Bruijn based content-addressable network
- Greedy pathlengths and small world graphs
- Optimal routing in a small-world network
- A state-space mixed membership blockmodel for dynamic network tomography
- Matrix analysis of a Markov chain small-world model
- Distance-based index structures for fast similarity search
- Topology adaption for the quantum Internet
- The small world phenomenon in hybrid power law graphs
- Corona graphs as a model of small-world networks
- Thresholding random geometric graph properties motivated by ad hoc sensor networks
- Local embeddings of metric spaces
- On the searchability of small-world networks with arbitrary underlying structure
- Analyzing Kleinberg's (and other) small-world models
- Distributed routing in small-world networks
- Graphical congestion games
- Araneola: a scalable reliable multicast system for dynamic environments
- Core size and densification in preferential attachment networks
- How to Burn a Graph
- Models of the small world.
- HyperTree for self-stabilizing peer-to-peer systems
- A Matrix Perturbation View of the Small World Phenomenon
- A statistical construction of power-law networks
- Could any graph be turned into a small-world?
- Estimating network size from local information
- Complex networks and decentralized search algorithms
- Equilibria and efficiency loss in games on networks
- Advances in metric embedding theory
- Merging ring-structured overlay indices: toward network-data transparency
- Modeling acquaintance networks based on balance theory
- Efficient distributed computation of distance sketches in networks
- The price of validity in dynamic networks
- Observability of lattice graphs
- Automata, Languages and Programming
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications
- Lack of Gromov-hyperbolicity in small-world networks
- Data mining of social networks represented as graphs
- Traffic dynamics on complex networks: a survey
- Shortest-path queries in static networks
- Information diffusion in social sensing
- Navigable small-world networks with few random bits
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- Signal propagation in small-world biological networks with weak noise
- Title not available (Why is that?)
- Techniques for analyzing dynamic random graph models of web-like networks: An overview
- Efficient routeing in Poisson small-world networks
- Optimal information transmission in organizations: Search and congestion
- On the typical case complexity of graph optimization
- 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
- Interval routing in reliability networks
- Approximation algorithm for partial positive influence problem in social network
- The critical node detection problem in networks: a survey
- Ultra-small scale-free geometric networks
- Navigation in small-world networks: a scale-free continuum model
- Network alignment by discrete Ollivier-Ricci flow
- Eclecticism shrinks even small worlds
- On the tree conjecture for the network creation game
- Navigating Low-Dimensional and Hierarchical Population Networks
- Modeling the Small-World Phenomenon with Local Network Flow
- Category-based routing in social networks: membership dimension and the small-world phenomenon
- Social context congestion games
- A decomposition approach for stochastic shortest-path network interdiction with goal threshold
- Close to optimal decentralized routing in long-range contact networks
- Trust management for \(e\)-transactions
- On the tree conjecture for the network creation game
- Greedy routing and the algorithmic small-world phenomenon
- Algorithms and Models for the Web-Graph
- Interactive proofs for social graphs
- Combinatorial properties of Farey graphs
- First-Order Model-Checking in Random Graphs and Complex Networks
- Modeling and Designing Real–World Networks
- On tree equilibria in max-distance network creation games
- Finding cliques in social networks: a new distribution-free model
- Application of complex networks theory in urban traffic network researches
- Brief announcement: The small world of curious beings
- Expansion and Lack Thereof in Randomly Perturbed Graphs
- The Routing of Complex Contagion in Kleinberg’s Small-World Networks
- A Theory of Network Security: Principles of Natural Selection and Combinatorics
- Graph Embedding through Random Walk for Shortest Paths Problems
- Modeling spatial networks by contact graphs of disk packings
- Decentralized search on spheres using small-world Markov chains: expected hitting times and structural properties
- Average geodesic distance on stretched Sierpiński gasket
- Structure and function in human and primate social networks: implications for diffusion, network stability and health
- 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
- Simulations on correlated behavior and social learning
- Navigation in real-world complex networks through embedding in latent spaces
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
- Optimal path search in small worlds, dimension matters
- Analysis of Contagion Maps on a Class of Networks That Are Spatially Embedded in a Torus
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)
