Báo cáo toán học: "Logconcave Random Graphs" ppsx

... weights in some random instance of a combinatorial optimization problem. By choosing suitable distributions, we can capture random graphs with interesting properties such as triangle-free random graphs ... combinatorics 17 (2010), #R108 22 Logconcave Random Graphs Alan Frieze ∗ Department of Mathematical Sciences Carnegie Mellon University Pittsburgh PA15213 alan @random. math.cmu.edu...

Ngày tải lên: 08/08/2014, 12:22

Ngày tải lên: 07/08/2014, 13:21

Ngày tải lên: 07/08/2014, 13:21

Ngày tải lên: 05/08/2014, 15:21

Ngày tải lên: 07/08/2014, 06:20

Ngày tải lên: 07/08/2014, 06:20

Ngày tải lên: 07/08/2014, 06:20

Ngày tải lên: 07/08/2014, 06:20

... Asymptotic packing and the random greedy algorithm, Random Struc- tures and Algorithms 8 (1996), 161–177. [13] J. Spencer, Asymptotic packing via a branching process, Random Structures and Algorithms 7 ... triples. To make the connection to the random greedy algorithm, consider the version of the random greedy algorithm where all possible triples are first randomly ordered and then t...

Ngày tải lên: 07/08/2014, 06:20

... (1) Equivalently, one can consider a random graph G = G(V,E)where|V | = n and E is a uniformly random m-subset of all  n 2  possible edges on V , i.e. the G(n, m) model of random graphs. If n is an index ... for random graphs with a given degree sequence, Random Structures & Algorithms, 6 (1995), 161–179. [16] B. Pittel, J.H. Spencer, and N.C. Wormald, Sudden emergence of a gi...

Ngày tải lên: 07/08/2014, 06:20