Sciweavers

320 search results - page 4 / 64
» Rigorous Result for the CHKNS Random Graph Model
Sort
View
RSA
2010
118views more  RSA 2010»
13 years 3 months ago
Asymptotic equivalence and contiguity of some random graphs
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
Svante Janson
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 8 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
ICIP
2003
IEEE
14 years 10 months ago
A probabilistic framework for image segmentation
A new probabilistic image segmentation model based on hypothesis testing and Gibbs Random Fields is introduced. First, a probabilistic difference measure derived from a set of hyp...
Slawo Wesolkowski, Paul W. Fieguth
RSA
2011
124views more  RSA 2011»
13 years 3 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
12 years 12 months ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann