Related papers: Effective bounds for monochromatic connectivity me…
In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…
In this paper, we investigate the impact of the broadcast effect arising in filterless optical networks on the computational complexity of the wavelength assignment problem. We model conflicts using an appropriate interference digraph,…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
This paper concerns the convergence of empirical measures in high dimensions. We propose a new class of probability metrics and show that under such metrics, the convergence is free of the curse of dimensionality (CoD). Such a feature is…
Given a complete doubling metric measure space $X$ that supports a $2$-Poincar\'e inequality, we approximate harmonic functions on a bounded domain $\Omega$ with a prescribed Newton-Sobolev boundary data. Our approach is based on the…
By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…
In this work, a one-dimensional model of crystalline solids based on the Dirac comb limit of the Kronig-Penney model is considered. From the wave functions of the valence electrons, we calculate a statistical measure of complexity and the…
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein and studied in a number of articles. Our contribution is twofold. We…
We assume that $\Omega_1, \Omega_2 \subset \mathbb{R}^{n+1}$, $n \geq 1$ are two disjoint domains whose complements satisfy the capacity density condition and the intersection of their boundaries $F$ has positive harmonic measure. Then we…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
We consider the problem of minimizing the number of monochromatic subgraphs of a random graph, when each node of the host graph is assigned one of the two colors. Using a recently discovered contiguity between appearance of strictly…
We consider the nodal domains of Gaussian random waves in two dimensions. We present a method to calculate the distribution of the number of nodal domains and the average connectivity with the help of auxiliary Potts-spins. An analytical…
We study the invariant measure of a discretized stochastic Allen-Cahn equation in d+1 dimensions in the low noise limit. We consider a cuboidal domain and impose the two stable phases as boundary conditions at two opposite faces. We then…
We study monochromatic random waves on $\mathbb{R}^n$ defined by Gaussian variables whose variances tend to zero sufficiently fast. This has the effect that the Fourier transform of the monochromatic wave is an absolutely continuous measure…
Let $D \subset \mathbb{C}$ be a domain with $0 \in D$. For $R>0$, let ${{\hat \omega }_D}\left( {R} \right)$ denote the harmonic measure of $ D \cap \left\{ {\left| z \right| = R} \right\}$ at $0$ with respect to the domain $ D \cap \left\{…
Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…
We study the boundary control of solutions of the Helmholtz and Maxwell equations to enforce local non-zero constraints. These constraints may represent the local absence of nodal or critical points, or that certain functionals depending on…
We establish a threshold for the connectivity of certain random graphs whose (dependent) edges are determined by the uniform distributions on generalized Orlicz balls, crucially using their negative correlation properties. We also show the…
We consider the canonical ensemble of multilayered constrained Erdos-Renyi networks (CERN) and regular random graphs (RRG), where each layer represents graph vertices painted in a specific color. We study the critical behavior in such…
We propose a measurement-based entanglement propagation strategy for networks in which all nodes except two are initially occupied by a suitably chosen single-qubit system and the two nodes share a bipartite noisy entangled state. The…