Sciweavers

966 search results - page 128 / 194
» Small Alliances in Graphs
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 10 months ago
Theory of Rumour Spreading in Complex Social Networks
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
Maziar Nekovee, Yamir Moreno, G. Bianconi, M. Mars...
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 10 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
RSA
2010
107views more  RSA 2010»
13 years 8 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 5 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
12 years 11 days ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri