Limits on Relief through Constrained Exchange on Random Graphs

Details Limits on Relief through Constrained Exchange on Random Graphs Limits on Relief through Constrained Exchange on Random Graphs

2006-12-09

arxiv.org/abs/physics/0612085v2

Physics

Data Analysis, Statistics and Probability

8 pages, 2 figures, 22 references Changes include name change for Lory A. Ellebracht (formerly Cooperstock, e-mail address sta

Scientific paper

10.1016/j.physa.2007.04.066

Agents are represented by nodes on a random graph (e.g., small world or truncated power law). Each agent is endowed with a zero-mean random value that may be either positive or negative. All agents attempt to find relief, i.e., to reduce the magnitude of that initial value, to zero if possible, through exchanges. The exchange occurs only between agents that are linked, a constraint that turns out to dominate the results. The exchange process continues until a Pareto equilibrium is achieved. Only 40%-90% of the agents achieved relief on small world graphs with mean degree between 2 and 40. Even fewer agents achieved relief on scale-free like graphs with a truncated power law degree distribution. The rate at which relief grew with increasing degree was slow, only at most logarithmic for all of the graphs considered; viewed in reverse, relief is resilient to the removal of links.

Affiliated with

Also associated with

No associations

Rating

Limits on Relief through Constrained Exchange on Random Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limits on Relief through Constrained Exchange on Random Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limits on Relief through Constrained Exchange on Random Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-645455