The small-world phenomenon: an algorithmic perspective
From MaRDI portal
Publication:3191982
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- How to Burn a Graph
- HyperTree for self-stabilizing peer-to-peer systems
- Models of the small world.
- Navigation in real-world complex networks through embedding in latent spaces
- A Matrix Perturbation View of the Small World Phenomenon
- Optimal path search in small worlds, dimension matters
- Analysis of Contagion Maps on a Class of Networks That Are Spatially Embedded in a Torus
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
- A statistical construction of power-law networks
- Graph distances in scale-free percolation: the logarithmic case
- Highway preferential attachment models for geographic routing
- Could any graph be turned into a small-world?
- Mathematical programming models for some smallest-world problems
- How to Use Spanning Trees to Navigate in Graphs
- Estimating network size from local information
- Low-distortion inference of latent similarities from a multiplex social network
- Broadcasting in unstructured peer-to-peer overlay networks
- Reconstruction of random geometric graphs: breaking the \(\varOmega (r)\) distortion barrier
- Equilibria and efficiency loss in games on networks
- Complex networks and decentralized search algorithms
- Merging ring-structured overlay indices: toward network-data transparency
- Local/Global Phenomena in Geometrically Generated Graphs
- Modeling acquaintance networks based on balance theory
- Efficient distributed computation of distance sketches in networks
- How to use spanning trees to navigate in graphs
- Advances in metric embedding theory
- Observability of lattice graphs
- The price of validity in dynamic networks
- Fractality of substitution networks
- Finding cliques in social networks: a new distribution-free model
- The gravitational law of social interaction
- Content search through comparisons
- Lack of Gromov-hyperbolicity in small-world networks
- Twitter financial community sentiment and its predictive relationship to stock market movement
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications
- Computing the eccentricity distribution of large graphs
- Data mining of social networks represented as graphs
- Temporal network modeling with online and hidden vertices based on the birth and death process
- Automata, Languages and Programming
- Weighted message passing and minimum energy flow for heterogeneous stochastic block models with side information
- Traffic dynamics on complex networks: a survey
- Information diffusion in social sensing
- Contributions of modern network science to the cognitive sciences: revisiting research spirals of representation and process
- Random walks in heterogeneous weighted pseudo-fractal webs with the same weight sequence
- Shortest-path queries in static networks
- Navigable small-world networks with few random bits
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
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)
