# Preprints

A full list is also available, with details of how to submit relevant papers and how to acknowledge INI.

Search preprint archive
Authors Title Attachments
G Grimmett; S Winkler Negative correlation of edge events on uniform spanning forests
G Grimmett; S Janson On smallest triangles
G Grimmett The random-cluster model
B Bollobás; GR Brightwell; et al How many graphs are unions of ${\it k}$-cliques?
M Jerrum; JB Son; P Tetali; et al Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
GR Brightwell; p Winkler A second threshold for the hard-core model on a Bethe lattice
N Fountoulakis On the structure of the core of sparse random graphs
A Járai Invasion percolation and the incipient infinite cluster in 3D
L Lovásv; S Vempala Hit-and-run is fast and fun
L Lovásv; S Vempala The geometry of logoncave functions and an ${\it 0*(n^3)}$ sampling algorithm
W Fernandez de la Vega; M Karpinski 9/8-Approximation Algorithm for Random MAX-3SAT
M Karpinski On approximability of minimum bisection problem
W Fernandez de la Vega; M Karpinski; C Kenyon; et al Approximation schemes for clustering problems in finite metrics and high dimensional spaces
D Stark The vertex degree distribution of random intersection graphs
J Van den Heuvel; L Stougie A quadratic bound on the diameter of the transportation polytope
LA Goldberg; R Martin; M Paterson Random Sampling of 3-colourings in $\mathbb{Z}^2$
W Fernandez de la Vega; M Karpinski; C Kenyon Polynomial time approximation schemes for metric MIN-BISECTION
C Greenhill; A Ruciński; NC Wormald Random hypergraph processes with degree restrictions
S Janson; K Oleszkiewicz; A Ruciński Upper tails for subgraph counts in random graphs
L Stougie A polynomial bound on the diameter of the transportation polytope
S Janson Large deviations for sums of partly dependent random variables