Sciweavers

1949 search results - page 239 / 390
» Random graphs on surfaces
Sort
View
ERCIMDL
2010
Springer
158views Education» more  ERCIMDL 2010»
15 years 7 months ago
Ranking Entities Using Web Search Query Logs
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 6 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...
JAL
2000
119views more  JAL 2000»
15 years 5 months ago
On Markov Chains for Independent Sets
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
Martin E. Dyer, Catherine S. Greenhill
PAMI
2007
196views more  PAMI 2007»
15 years 5 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
RSA
2010
107views more  RSA 2010»
15 years 4 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