Delay of Social Search on Small-World Graphs

DOI10.1080/0022250X.2011.629062zbMath1288.91168OpenAlexW2077140556MaRDI QIDQ5411871

Hazer Inaltekin, H. Vincent Poor, Mung Chiang

Publication date: 25 April 2014

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0022250x.2011.629062

zbMATH Keywords

small world networksdelay of social searchsocial netwoks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Unnamed Item
• Could any graph be turned into a small-world?
• From the Cover: The structure of scientific collaboration networks
• Dynamic models of segregation†
• Empirical Analysis of an Evolving Social Network
• Networks Become Navigable as Nodes Move and Forget
• Communication over a wireless network with random connections
• The Structure and Function of Complex Networks
• Random Geometric Graphs
• The capacity of wireless networks
• Average Message Delivery Time for Small-World Networks in the Continuum Limit
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks
• Navigation in small-world networks: a scale-free continuum model

This page was built for publication: Delay of Social Search on Small-World Graphs