The small-world phenomenon
From MaRDI portal
Publication:3191982
DOI10.1145/335305.335325zbMath1296.05181OpenAlexW2128678576WikidataQ55899226 ScholiaQ55899226MaRDI QIDQ3191982
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
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Related Items
Graph distances in scale-free percolation: the logarithmic case ⋮ Unnamed Item ⋮ Temporal network modeling with online and hidden vertices based on the birth and death process ⋮ Modeling spatial networks by contact graphs of disk packings ⋮ On tree equilibria in max-distance network creation games ⋮ Speeding up random walk mixing by starting from a uniform vertex ⋮ Learning the Structural Vocabulary of a Network ⋮ Depth of Field and Cautious-Greedy Routing in Social Networks ⋮ Advances in metric embedding theory ⋮ First-Order Model-Checking in Random Graphs and Complex Networks ⋮ Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size ⋮ Routing complexity of faulty networks ⋮ Ultra-small scale-free geometric networks ⋮ Efficient routeing in Poisson small-world networks ⋮ A Hit‐and‐Run approach for generating scale invariant Small World networks ⋮ Navigation in small-world networks: a scale-free continuum model ⋮ On the connectivity and diameter of small-world networks ⋮ Local embeddings of metric spaces ⋮ Expansion and Lack Thereof in Randomly Perturbed Graphs ⋮ How to Burn a Graph ⋮ A Theory of Network Security: Principles of Natural Selection and Combinatorics ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network ⋮ Simulations on Correlated Behavior and Social Learning ⋮ 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? ⋮ Signal propagation in small-world biological networks with weak noise ⋮ The Small Community Phenomenon in Networks: Models, Algorithms and Applications ⋮ Core Size and Densification in Preferential Attachment Networks ⋮ Depths in hooking networks ⋮ SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS ⋮ Eclecticism shrinks even small worlds ⋮ Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information ⋮ How to use spanning trees to navigate in graphs ⋮ Average geodesic distance on stretched Sierpiński gasket ⋮ How to Use Spanning Trees to Navigate in Graphs ⋮ Observability of lattice graphs ⋮ Information diffusion in social sensing ⋮ How humans learn and represent networks ⋮ Orientation in social networks ⋮ The power grid as a complex network: a survey ⋮ The price of validity in dynamic networks ⋮ On the Tree Conjecture for the Network Creation Game ⋮ Social context congestion games ⋮ Category-based routing in social networks: membership dimension and the small-world phenomenon ⋮ Kleinberg's grid unchained ⋮ RANDOM WALKS IN HETEROGENEOUS WEIGHTED PSEUDO-FRACTAL WEBS WITH THE SAME WEIGHT SEQUENCE ⋮ Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web ⋮ Navigation on a Poisson point process ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Unnamed Item ⋮ Lack of Gromov-hyperbolicity in small-world networks ⋮ Techniques for analyzing dynamic random graph models of web-like networks: An overview ⋮ A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents ⋮ Local/Global Phenomena in Geometrically Generated Graphs ⋮ Araneola: a scalable reliable multicast system for dynamic environments ⋮ Graphical congestion games ⋮ Simple random walk on long-range percolation clusters. II: Scaling limits ⋮ OPTIMAL TEMPORAL PATH ON SPATIAL DECAYING NETWORKS ⋮ Distance-based index structures for fast similarity search ⋮ Distance estimation and object location via rings of neighbors ⋮ HyperTree for self-stabilizing peer-to-peer systems ⋮ Traffic dynamics on complex networks: a survey ⋮ Equilibria and efficiency loss in games on networks ⋮ Merging ring-structured overlay indices: toward network-data transparency ⋮ A study of how the Watts-Strogatz model relates to an economic system's utility ⋮ Data mining of social networks represented as graphs ⋮ Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks ⋮ Asymptotically optimal solutions for small world graphs ⋮ Network alignment by discrete Ollivier-Ricci flow ⋮ Optimal paths on the space-time SINR random graph ⋮ Boosting the Exploration of Huge Dynamic Graphs ⋮ Computing the eccentricity distribution of large graphs ⋮ Corona graphs as a model of small-world networks ⋮ On the tree conjecture for the network creation game ⋮ Content Search through Comparisons ⋮ A statistical construction of power-law networks ⋮ Approximation algorithm for partial positive influence problem in social network ⋮ The critical node detection problem in networks: a survey ⋮ 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 ⋮ Topology adaption for the quantum Internet ⋮ Neighbor selection and hitting probability in small-world graphs ⋮ Recovering the long-range links in augmented graphs ⋮ Distinct clusterings and characteristic path lengths in dynamic small-world networks with identical limit degree distribution ⋮ Greedy routing in small-world networks with power-law degrees ⋮ Application of complex networks theory in urban traffic network researches ⋮ Some Typical Properties of the Spatial Preferred Attachment Model ⋮ Shortest-path queries in static networks ⋮ Interval routing in reliability networks ⋮ Two-dimensional SIR epidemics with long range infection ⋮ Optimal information transmission in organizations: Search and congestion ⋮ Greedy pathlengths and small world graphs ⋮ Twitter financial community sentiment and its predictive relationship to stock market movement ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ The gravitational law of social interaction ⋮ Decentralized search on spheres using small-world Markov chains: expected hitting times and structural properties ⋮ A state-space mixed membership blockmodel for dynamic network tomography ⋮ Optimal routing in a small-world network ⋮ Decompositions of Triangle-Dense Graphs ⋮ FRACTALITY OF SUBSTITUTION NETWORKS ⋮ Modeling acquaintance networks based on balance theory ⋮ Efficient distributed computation of distance sketches in networks ⋮ The Routing of Complex Contagion in Kleinberg’s Small-World Networks ⋮ Universal augmentation schemes for network navigability ⋮ Modeling and Designing Real–World Networks ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ Estimating network size from local information ⋮ Graph Embedding through Random Walk for Shortest Paths Problems ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Navigable small-world networks with few random bits ⋮ Matrix analysis of a Markov chain small-world model ⋮ Analysis of Contagion Maps on a Class of Networks That Are Spatially Embedded in a Torus ⋮ Combinatorial properties of Farey graphs ⋮ 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 ⋮ Interactive proofs for social graphs ⋮ Graph construction and random graph generation for modeling protein structures
