Results 1  10
of
257,173
On the Evolution of Random Graphs
 PUBLICATION OF THE MATHEMATICAL INSTITUTE OF THE HUNGARIAN ACADEMY OF SCIENCES
, 1960
"... ..."
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 507 (8 self)
 Add to MetaCart
Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0
A Random Graph Model for Massive Graphs
 STOC 2000
, 2000
"... We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize and loglog growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from t ..."
Abstract

Cited by 406 (26 self)
 Add to MetaCart
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize and loglog growth rate. These parameters capture some universal characteristics of massive graphs. Furthermore, from
Random graph models of social networks
"... We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predic ..."
Abstract

Cited by 252 (1 self)
 Add to MetaCart
We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare
Random Graph Dynamics
, 2007
"... Chapter 1 will explain what this book is about. Here I will explain why I chose to write the book, how it is written, where and when the work was done, and who helped. Why. It would make a good story if I was inspired to write this book by an image of Paul Erdös magically appearing on a cheese ques ..."
Abstract

Cited by 203 (2 self)
 Add to MetaCart
quesadilla, which I later sold for thousands on dollars on eBay. However, that is not true. The three main events that led to this book were (i) the use of random graphs in the solution of a problem that was part of Nathanael Berestycki’s thesis, (ii) a talk that I heard Steve Strogatz give on the CHKNS
and random graphs.
, 2006
"... Abstract. – We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparse random graphs. When applied to realworld networks, it allows to estimate exponentially large ..."
Abstract
 Add to MetaCart
Abstract. – We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparse random graphs. When applied to realworld networks, it allows to estimate exponentially
The phase transition in inhomogeneous random graphs
, 2005
"... The ‘classical’ random graph models, in particular G(n, p), are ‘homogeneous’, in the sense that the degrees (for example) tend to be concentrated around a typical value. Many graphs arising in the real world do not have this property, having, for example, powerlaw degree distributions. Thus there ..."
Abstract

Cited by 180 (29 self)
 Add to MetaCart
The ‘classical’ random graph models, in particular G(n, p), are ‘homogeneous’, in the sense that the degrees (for example) tend to be concentrated around a typical value. Many graphs arising in the real world do not have this property, having, for example, powerlaw degree distributions. Thus
Spectral Partitioning of Random Graphs
, 2001
"... Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all ..."
Abstract

Cited by 165 (3 self)
 Add to MetaCart
Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all
Results 1  10
of
257,173