Related papers: Multicoloured Hardcore Model: Fast Mixing and Queu…
A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time…
Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with…
We give conditions under which a Markov chain constructed via parallel or simulated tempering is guaranteed to be rapidly mixing, which are applicable to a wide range of multimodal distributions arising in Bayesian statistical inference and…
Multi-server queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospitals, queues in contact centers, data buffers in wireless…
Graph clustering is a central topic in unsupervised learning with a multitude of practical applications. In recent years, multi-view graph clustering has gained a lot of attention for its applicability to real-world instances where one has…
We consider the problem of online graph multi-coloring with advice. Multi-coloring is often used to model frequency allocation in cellular networks. We give several nearly tight upper and lower bounds for the most standard topologies of…
Large datasets with interactions between objects are common to numerous scientific fields (i.e. social science, internet, biology...). The interactions naturally define a graph and a common way to explore or summarize such dataset is graph…
A conflict-free $k$-coloring of a graph $G=(V,E)$ assigns one of $k$ different colors to some of the vertices such that, for every vertex $v$, there is a color that is assigned to exactly one vertex among $v$ and $v$'s neighbors. Such…
A simple but empirically efficient heuristic algorithm for the edge-coloring of graphs is presented. Its basic idea is the displacement of "conflicts" (repeated colors in the edges incident to a vertex) along paths of adjacent vertices…
Adaptive management of traffic congestion in the Internet is a complex problem that can gain useful insights from a dynamical approach. In this paper we propose and analyze a one-dimensional, discrete-time nonlinear model for Internet…
Congestion is an important issue which researchers focus on in the Transmission Control Protocol (TCP) network environment. To keep the stability of the whole network, congestion control algorithms have been extensively studied. Queue…
The supermarket model is a system of $n$ queues each with serving rates $1$ and arrival rates $\lambda$ per vertex, where tasks will move on arrival to the shortest adjacent queue. We consider the supermarket model in the small $\lambda$…
The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible. This can be naturally modeled as…
Traffic-light modelling is a complex task, because many factors have to be taken into account. In particular, capturing all traffic flows in one model can significantly complicate the model. Therefore, several realistic features are…
In this paper we investigate the relationship between the mixing times of the Glauber dynamics of a statistical mechanical system with its thermodynamic equilibrium structure. For this we consider the mean-field Blume-Capel model, one of…
We begin by reviewing some probabilistic results about the Dirichlet Process and its close relatives, focussing on their implications for statistical modelling and analysis. We then introduce a class of simple mixture models in which…
We study the equilibrium phase diagram of binary mixtures of hard spheres as well as of parallel hard cubes. A superior cluster algorithm allows us to establish and to access the demixed phase for both systems and to investigate the subtle…
In the hard-core model on a finite graph we are given a parameter lambda>0, and an independent set I arises with probability proportional to lambda^|I|. On infinite graphs a Gibbs distribution is defined as a suitable limit with the correct…
Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…
We present a generalized hypercube queueing model extending Larson's (1974) framework to overlapping service regions such as police beats. Traditional hypercube models effectively capture light-traffic systems by tracking each server's busy…