Related papers: Normal Approximation and Fourth Moment Theorems fo…
A new type of stochastic dependence for a sequence of random variables is introduced and studied. Precisely, (X_n)_{n\geq 1} is said to be conditionally identically distributed (c.i.d.), with respect to a filtration (G_n)_{n\geq 0}, if it…
In this paper, we analyze the limiting spectral distribution of the adjacency matrix of a random graph ensemble, proposed by Chung and Lu, in which a given expected degree sequence $\overline{w}_n^{^{T}} = (w^{(n)}_1,\ldots,w^{(n)}_n)$ is…
A result of Gy\'arf\'as says that for every $3$-coloring of the edges of the complete graph $K_n$, there is a monochromatic component of order at least $\frac{n}{2}$, and this is best possible when $4$ divides $n$. Furthermore, for all…
We prove a central limit theorem (CLT) for the product of a class of random singular matrices related to a random Hill's equation studied by Adams$\unicode{x2013}$Bloch$\unicode{x2013}$Lagarias. The CLT features an explicit formula for the…
Erdos and Sos proposed a problem of determining the maximum number F(n) of rainbow triangles in 3-edge-colored complete graphs on n vertices. They conjectured that F(n) = F(a)+ F(b)+F(c)+F(d)+abc+abd+acd+bcd, where a+b+c+d = n and a, b, c,…
We investigate the problem of determining how many monochromatic trees are necessary to cover the vertices of an edge-coloured random graph. More precisely, we show that for $p\gg n^{-1/6}{(\ln n)}^{1/6}$, in any $3$-edge-colouring of the…
Erd\H{o}s and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at least 1/2log(n) vertices. The famous Erd\H{o}s-Hajnal…
We compute the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates, when both qubit and measurement errors are present. By mapping the problem onto a…
The total chromatic number, $\chi''(G)$ is the minimum number of colors which need to be assigned to obtain a total coloring of the graph $G$. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph,…
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that the random 2-edge-coloring minimizes the number of…
Nualart & Pecatti ([Nualart and Peccati, 2005, Thm 1]) established the first fourth-moment theorem for random variables in a fixed Wiener chaos, i.e. they showed that convergence of the sequence of fourth moments to the fourth moment of the…
Consider a graph G with n nodes and m edges, which represents a social network, and assume that initially each node is blue or white. In each round, all nodes simultaneously update their color to the most frequent color in their…
Let G be a simple connected plane graph and let C_1 and C_2 be cycles in G bounding distinct faces f_1 and f_2. For a positive integer l, let r(l) denote the number of integers n such that -l<=n<=l, n is divisible by 3, and n has the same…
We discuss a central limit theorem in the framework of the group algebra of the Thompson group $F$. We consider the sequence of self-adjoint elements given by $a_n=\frac{g_n+g_n^{*}}{\sqrt{2}}$ in the noncommutative probability space…
Recent theoretical works have characterized the dynamics of wide shallow neural networks trained via gradient descent in an asymptotic mean-field limit when the width tends towards infinity. At initialization, the random sampling of the…
Ramsey's theorem, in the version of Erd\H{o}s and Szekeres, states that every 2-coloring of the edges of the complete graph on {1, 2,...,n} contains a monochromatic clique of order 1/2\log n. In this paper, we consider two well-studied…
We give a randomized algorithm that properly colors the vertices of a triangle-free graph G on n vertices using O(\Delta(G)/ log \Delta(G)) colors, where \Delta(G) is the maximum degree of G. The algorithm takes O(n\Delta2(G)log\Delta(G))…
Given an $r$-edge-coloured complete graph $K_n$, how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well-known essentially equivalent formulation of the classical Ryser's…
A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs. It will show that it is NP-complete in case…
We study the number of monochromatic solution to linear equation in $\{1,\dots,n\}$ when we color the set by at least three colors. We consider the $r$-commonness for $r\geq 3$ of linear equation with odd number of terms, and we also prove…