Zobrazeno 1 - 10
of 181
pro vyhledávání: '"Brightwell, Graham"'
We present new concentration of measure inequalities for Markov chains, generalising results for chains that are contracting in Wasserstein distance. These are particularly suited to establishing the cut-off phenomenon for suitable chains. We apply o
Externí odkaz:
http://arxiv.org/abs/1902.00822
Publikováno v:
In Stochastic Processes and their Applications October 2022 152:378-423
Autor:
Brightwell, Graham, Luczak, Malwina
The causal set approach to quantum gravity is based on the hypothesis that the underlying structure of spacetime is that of a random partial order. We survey some of the interesting mathematics that has arisen in connection with the causal set hypoth
Externí odkaz:
http://arxiv.org/abs/1510.05612
We analyse the size of an independent set in a random graph on $n$ vertices with specified vertex degrees, constructed via a simple greedy algorithm: order the vertices arbitrarily, and, for each vertex in turn, place it in the independent set unless
Externí odkaz:
http://arxiv.org/abs/1510.05560
Publikováno v:
Journal of Mathematical Biology, 2018
Many real epidemics of an infectious disease are not straightforwardly super- or sub-critical, and the understanding of epidemic models that exhibit such complexity has been identified as a priority for theoretical work. We provide insights into the
Externí odkaz:
http://arxiv.org/abs/1312.7449
Autor:
Brightwell, Graham, Luczak, Malwina
We use a method of Luczak (arXiv:1212.3231) to investigate the equilibrium distribution of a dynamic routing model on a network. In this model, there are $n$ nodes, each pair joined by a link of capacity $C$. For each pair of nodes, calls arrive for
Externí odkaz:
http://arxiv.org/abs/1306.5002
Autor:
Brightwell, Graham, Luczak, Malwina
In the supermarket model, there are $n$ queues, each with a single server. Customers arrive in a Poisson process with arrival rate $\lambda n$, where $\lambda = \lambda (n) \in (0,1)$. Upon arrival, a customer selects $d=d(n)$ servers uniformly at ra
Externí odkaz:
http://arxiv.org/abs/1201.5523
Autor:
Brightwell, Graham, Keller, Mitchel T.
Building on work by Zagier, Bousquet-M\'elou et al., and Khamis, we give an asymptotic formula for the number of labelled interval orders on an $n$-element set.
Comment: 6 pages
Comment: 6 pages
Externí odkaz:
http://arxiv.org/abs/1111.6766
Autor:
Brightwell, Graham, Keller, Mitchel T.
Publikováno v:
Order (2015) 32:43--52
Felsner and Reuter introduced the linear extension diameter of a partially ordered set $\mathbf{P}$, denoted $\mbox{led}(\mathbf{P})$, as the maximum distance between two linear extensions of $\mathbf{P}$, where distance is defined to be the number o
Externí odkaz:
http://arxiv.org/abs/1107.2846
Autor:
Brightwell, Graham, Luczak, Malwina J.
We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to its degree.
Externí odkaz:
http://arxiv.org/abs/1012.5550