Related papers: The condensation phase transition in random graph …
As general theories, currently there are concentration inequalities (of random walk) only for the cases of independence and martingale differences. In this paper, the concentration inequalities are extended to more general situations. In…
Graphs are a fundamental abstraction in computer science and discrete mathematics, where information is encoded in their combinatorial structure. Graph-reduction techniques aim at simplifying graphs while preserving selected structural…
The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…
For $k\geq 1$, a $k$-colouring $c$ of $G$ is a mapping from $V(G)$ to $\{1,2,\ldots,k\}$ such that $c(u)\neq c(v)$ for any two non-adjacent vertices $u$ and $v$. The $k$-Colouring problem is to decide if a graph $G$ has a $k$-colouring. For…
Quantum phase transitions encompass a variety of phenomena that occur in quantum systems exhibiting several possible symmetries. Traditionally, these transitions are explored by continuously varying a control parameter that connects two…
Precondensation is a peculiar phenomenon in phase transitions, characterised by the occurrence of a condensate only over a finite range of length scales. It is closely connected to the emergence of domains, pseudo-gapped phases and spatial…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
Graph coloring is a problem with varied applications in industry and science such as scheduling, resource allocation, and circuit design. The purpose of this paper is to establish if a new gradient based iterative solver framework known as…
List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a…
We present a microscopic theory of the second order phase transition in an interacting Bose gas that allows one to describe formation of an ordered condensate phase from a disordered phase across an entire critical region continuously. We…
The origin of the non commutativity of the limits $t \to \infty$ and $N \to \infty$ in the dynamics of first order transitions is investigated. In the large-N model, i.e. $N \to \infty$ taken first, the low temperature phase is…
Color constancy is the problem of inferring the color of the light that illuminated a scene, usually so that the illumination color can be removed. Because this problem is underconstrained, it is often solved by modeling the statistical…
We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…
We introduce a simple zero-range process with constant rates and one fast rate for a particular occupation number, which diverges with the system size. Surprisingly, this minor modification induces a condensation transition in the…
We study the problem of coloring a given graph using a small number of colors in several well-established models of computation for big data. These include the data streaming model, the general graph query model, the massively parallel…
We reconsider model II of [J. Chem. Phys. 1968, 49, 1778--1783], a two-dimensional lattice-gas system featuring a crystalline phase and two distinct fluid phases (liquid and vapor). In this system, a particle prevents other particles from…
We study the position distribution $P(\vec{R},N)$ of a run-and-tumble particle (RTP) in arbitrary dimension $d$, after $N$ runs. We assume that the constant speed $v>0$ of the particle during each running phase is independently drawn from a…
The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge. In this paper we…
Approximate random $k$-colouring of a graph $G$ is a well studied problem in computer science and statistical physics. It amounts to constructing a $k$-colouring of $G$ which is distributed close to {\em Gibbs distribution} in polynomial…
Given a set of obstacles and two points, is there a path between the two points that does not cross more than $k$ different obstacles? This is a fundamental problem that has undergone a tremendous amount of work. It is known to be NP-hard,…