Sciweavers

CPC
2007
125views more  CPC 2007»
13 years 11 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 11 months ago
A Formal Treatment of Generalized Preferential Attachment and its Empirical Validation
Abstract.
Amac Herdagdelen, Eser Aygün, Haluk Bingol
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 11 months ago
Modeling the structure and evolution of discussion cascades
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...
Vicenç Gómez, Hilbert J. Kappen, And...
BMCBI
2007
110views more  BMCBI 2007»
13 years 11 months ago
Analysis of feedback loops and robustness in network evolution based on Boolean models
Background: Many biological networks such as protein-protein interaction networks, signaling networks, and metabolic networks have topological characteristics of a scale-free degr...
Yung-Keun Kwon, Kwang-Hyun Cho
SODA
2003
ACM
130views Algorithms» more  SODA 2003»
14 years 24 days ago
Directed scale-free graphs
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...
Béla Bollobás, Christian Borgs, Jenn...
AC
2003
Springer
14 years 4 months ago
The Importance of Aggregation
Abstract—The dynamics of the survival of recruiting fish are analyzed as evolving random processes of aggregation and mortality. The analyses draw on recent advances in the phys...
Robbert van Renesse
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 11 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...