Skip to main content
Post Reopened by David White, Todd Trimble
added 1010 characters in body; edited tags
Source Link
David White
  • 30.3k
  • 9
  • 154
  • 250

I just start an independent study about small world network and clusters and I try to find papers about decentralized search and clusters.

Can anyone give me some references? Thanks!

EDIT (David White): This question is from my student, and I encouraged her to ask it here. We are just starting research on decentralized search in social networks, and she had the idea to form a graph where the nodes are sets of individuals and you put an edge between two sets if there is any overlap. We'd like to write down some decentralized search algorithms (e.g. greedy, random) and analyze them. I think this is a great starting project, but I don't know enough about the literature. Has someone else already done this? Is there a name for graphs of the form above? Has anyone studied a version where you weight each edge by the size of the intersection of the two sets?

Joonas is correct that googling "decentralized search and cluster" yields many articles. I can't seem to find any which do what we're thinking of doing, but that doesn't mean they don't exist. I'd hate to steer my student in a bad direction in her first research project. Any help you can provide would be much appreciated.

I just start an independent study about small world network and clusters and I try to find papers about decentralized search and clusters.

Can anyone give me some references? Thanks!

I just start an independent study about small world network and clusters and I try to find papers about decentralized search and clusters.

Can anyone give me some references? Thanks!

EDIT (David White): This question is from my student, and I encouraged her to ask it here. We are just starting research on decentralized search in social networks, and she had the idea to form a graph where the nodes are sets of individuals and you put an edge between two sets if there is any overlap. We'd like to write down some decentralized search algorithms (e.g. greedy, random) and analyze them. I think this is a great starting project, but I don't know enough about the literature. Has someone else already done this? Is there a name for graphs of the form above? Has anyone studied a version where you weight each edge by the size of the intersection of the two sets?

Joonas is correct that googling "decentralized search and cluster" yields many articles. I can't seem to find any which do what we're thinking of doing, but that doesn't mean they don't exist. I'd hate to steer my student in a bad direction in her first research project. Any help you can provide would be much appreciated.

Post Closed as "Not suitable for this site" by Noah Schweber, Stefan Waldmann, Ryan Budney, Ian Morris, Stefan Kohl
Source Link

Papers about decentralized search and cluster

I just start an independent study about small world network and clusters and I try to find papers about decentralized search and clusters.

Can anyone give me some references? Thanks!