#### Filter Results:

#### Publication Year

1999

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We consider Markovian models on graphs with local dynamics. We show that, under suitable conditions, such Markov chains exhibit both rapid convergence to equilibrium and strong concentration of measure in the stationary distribution. We illustrate our results with applications to some known chains from computer science and statistical mechanics.

- Svante Janson, Malwina J. Luczak
- Random Struct. Algorithms
- 2007

We study the k-core of a random (multi)graph on n ver-tices with a given degree sequence. We let n → ∞. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree sequence that imply that with high probability the k-core is empty, and other conditions that imply that with high probability the… (More)

- Svante Janson, Malwina J. Luczak
- Random Struct. Algorithms
- 2009

We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n → ∞. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree sequence that imply that with high probability all the components are small, and other conditions that imply that with high… (More)

We consider a random sequence of calls between nodes in a complete network with link capacities. Each call first tries the direct link. If that link is saturated, then the 'first-fit dynamic alternative routing algorithm' sequentially selects up to d random two-link alternative routes, and assigns the call to the first route with spare capacity on each… (More)

There are n queues, each with a single server. Customers arrive in a Poisson process at rate λn, where 0 < λ < 1. Upon arrival each customer selects d ≥ 2 servers uniformly at random, and joins the queue at a least-loaded server among those chosen. Service times are independent exponentially distributed random variables with mean 1. We show that the system… (More)

A. We study the Glauber dynamics for the Ising model on the complete graph, also known as the Curie-Weiss Model. For β < 1, we prove that the dynamics exhibits a cutoff: the distance to stationarity drops from near 1 to near 0 in a window of order n centered at [2(1 − β)] −1 n log n. For β = 1, we prove that the mixing time is of order n 3/2. For β >… (More)

- Malwina J. Luczak, Colin McDiarmid
- Discrete Mathematics
- 2003

Talagrand (Publ. Math. Inst. Hautes Etudes Sci. 81 (1995) 73) gave a concentration inequality concerning permutations picked uniformly at random from a symmetric group, and this was extended in McDiarmid (Combin. Probab. Comput. 11 (2002) 163) to handle permutations picked uniformly at random from a direct product of symmetric groups. Here we extend these… (More)

In the supermarket model there are n queues, each with a unit rate server. Customers arrive in a Poisson process at rate λn, where 0 < λ < 1. Each customer chooses d ≥ 2 queues uniformly at random, and joins a shortest one. It is known that the equilibrium distribution of a typical queue length converges to a certain explicit limiting distribution as n → ∞.… (More)

We study the k-core of a random (multi)graph on n ver-tices with a given degree sequence. In our previous paper [18] we used properties of empirical distributions of independent random variables to give a simple proof of the fact that the size of the giant k-core obeys a law of large numbers as n → ∞. Here we develop the method further and show that the… (More)

Suppose that there are n bins, and balls arrive in a Poisson process at rate λn, where λ > 0 is a constant. Upon arrival, each ball chooses a fixed number d of random bins, and is placed into one with least load. Balls have independent exponential lifetimes with unit mean. We show that the system converges rapidly to its equilibrium distribution; and when d… (More)