Related papers: Divide and color representations for threshold Gau…
Inertial particles suspended in many natural and industrial flows undergo coagulation upon collisions and fragmentation if their size becomes too large or if they experience large shear. Here we study this coagulation-fragmentation process…
We consider the task of Gaussian mean testing, that is, of testing whether a high-dimensional vector perturbed by white noise has large magnitude, or is the zero vector. This question, originating from the signal processing community, has…
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…
We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and systematic analytical study…
The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…
The time evolution of a Gaussian density matrix of a one dimensional particle, generated by a quadratic, ${\cal O}(\partial_t^2)$ effective Lagrangian, describing a harmonic potential, a friction force and decoherence, is studied within the…
Understanding the temporal evolution of sets of vectors is a fundamental challenge across various domains, including ecology, crime analysis, and linguistics. For instance, ecosystem structures evolve due to interactions among plants,…
We study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $d\geq 3$. Denoting by $h_\star$ the critical value, we obtain the following results: for $h>h_\star$ we derive estimates on conditional…
PDEs with periodic boundary conditions are frequently used to model processes in large spatial environments, assuming solutions to extend periodically beyond some bounded interval. However, solutions to these PDEs often do not converge to a…
We present a randomized algorithm which takes as input an undirected graph $G$ on $n$ vertices with maximum degree $\Delta$, and a number of colors $k \geq (8/3 + o_{\Delta}(1))\Delta$, and returns -- in expected time…
This paper explores the application of a new algebraic method of color exchanges to the edge coloring of simple graphs. Vizing's theorem states that the edge coloring of a simple graph $G$ requires either $\Delta$ or $\Delta+1$ colors,…
One of the fundamental open problems in the area of distributed graph algorithms is the question of whether randomization is needed for efficient symmetry breaking. While there are fast, $\text{poly}\log n$-time randomized distributed…
This paper presents a synthesis on the mathematical work done on level crossings of stationary Gaussian processes, with some extensions. The main results [(factorial) moments, representation into the Wiener Chaos, asymptotic results, rate…
We study joint eigenvector distributions for large symmetric matrices in the presence of weak noise. Our main result asserts that every submatrix in the orthogonal matrix of eigenvectors converges to a multidimensional Gaussian…
Modern power system is undergoing a paradigm shift from the synchronous generators-based system to the power electronics converters-dominated system. With the high penetration of converters, serious stability problems are provoked,…
The steady-state currents and densities of a one-dimensional totally asymmetric exclusion process (TASEP) with particles that occlude an integer number ($d$) of lattice sites are computed using various mean field approximations and Monte…
The color neutral two-flavor superconducting (2SC) phase of cold and dense quark matter is studied in the presence of constant magnetic fields and at moderate baryon densities. In the first part of the paper, a two-flavor effective…
The chromatic threshold $\delta_\chi(H,p)$ of a graph $H$ with respect to the random graph $G(n,p)$ is the infimum over $d > 0$ such that the following holds with high probability: the family of $H$-free graphs $G \subset G(n,p)$ with…
We study the statistical limits of testing and estimation for a rank one deformation of a Gaussian random tensor. We compute the sharp thresholds for hypothesis testing and estimation by maximum likelihood and show that they are the same.…
We consider stochastic differential equations of the form $dY_t=V(Y_t)\,dX_t+V_0(Y_t)\,dt$ driven by a multi-dimensional Gaussian process. Under the assumption that the vector fields $V_0$ and $V=(V_1,\ldots,V_d)$ satisfy H\"{o}rmander's…