activity
19982010
most citedTolerating the Community Detection Resolution Limit with Edge Weighting

192 citations · 307 across the 10 of their papers we have counts for

collaborators

10 papers

q-fin.TR2010

Sensitivity of the Performance of a Simple Exchange Model to its Topology

Vitus J. Leung, Randall A. LaViolette

We study a simple exchange model in which price is fixed and the amount of a good transferred between actors depends only on the actors' respective budgets and the existence of a l…

q-fin.TR2009★ 1 cited

Emergence of Price Divergence in a Model Short-Term Electric Power Market

Randall A. LaViolette, Lory A. Ellebracht, Kevin L. Stamber +2

A minimal model of a market of myopic non-cooperative agents who trade bilaterally with random bids reproduces qualitative features of short-term electric power markets, such as th…

physics.soc-ph2009★ 192 cited

Tolerating the Community Detection Resolution Limit with Edge Weighting

Jonathan W. Berry, Bruce Hendrickson, Randall A. LaViolette +1

Communities of vertices within a giant network such as the World-Wide Web are likely to be vastly smaller than the network itself. However, Fortunato and Barthélemy have proved tha…

physics.soc-ph2007★ 4 cited

Community Detection via Facility Location

Jonathan W. Berry, Bruce Hendrickson, Randall A. LaViolette +2

In this paper we apply theoretical and practical results from facility location theory to the problem of community detection in networks. The result is an algorithm that computes b…

physics.data-an2006★ 2 cited

Limits on Relief through Constrained Exchange on Random Graphs

Randall A. LaViolette, Lory A. Ellebracht, Charles J. Gieseler

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 neg…

cs.NI2005

Parameters Affecting the Resilience of Scale-Free Networks to Random Failures

Hamilton Link, Randall A. LaViolette, Jared Saia +1

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. study scale-free networks including some which ap…