activity
20042009
most citedVoter Models on Heterogeneous Networks

392 citations · 462 across the 6 of their papers we have counts for

collaborators

9 papers

cond-mat.stat-mech20096 cited

Random sampling vs. exact enumeration of attractors in random Boolean networks

Andrew Berdahl, Amer Shreim, Vishal Sood +2

We clarify the effect different sampling methods and weighting schemes have on the statistics of attractors in ensembles of random Boolean networks (RBNs). We directly measure cycl…

physics.bio-ph20081 cited

Avalanches, branching ratios, and clustering of attractors in Random Boolean Networks and in the segment polarity network of \emph{Drosophila}

Andrew Berdahl, Amer Shreim, Vishal Sood +2

We discuss basic features of emergent complexity in dynamical systems far from equilibrium by focusing on the network structure of their state space. We start by measuring the dist…

physics.soc-ph2007392 cited

Voter Models on Heterogeneous Networks

V. Sood, Tibor Antal, S. Redner

We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update ev…

cond-mat.stat-mech20078 cited

Complex Network Analysis of State Spaces for Random Boolean Networks

Amer Shreim, Andrew Berdahl, Vishal Sood +2

We apply complex network analysis to the state spaces of random Boolean networks (RBNs). An RBN contains Boolean elements each with inputs. A directed state space network (…

q-bio.MN20075 cited

Node similarity within subgraphs of protein interaction networks

Orion Penner, Vishal Sood, Gabe Musso +3

We propose a biologically motivated quantity, twinness, to evaluate local similarity between nodes in a network. The twinness of a pair of nodes is the number of connected, labeled…

cond-mat.stat-mech200750 cited

Localization Transition of Biased Random Walks on Random Networks

Vishal Sood, Peter Grassberger

We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength b_c exists such that most walks…