Related papers: Lifting for Arbitrary Gadgets
This work is an application of the second order gauge theory for the Lorentz group, where a description of the gravitational interaction is obtained which includes derivatives of the curvature. We analyze the form of the second field…
We analyze two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size $n$, up to accuracy $\varepsilon$. For the first algorithm, which is based on the celebrated Sinkhorn's…
Let $G$ be a connected graph, and let $\lambda_1$ and $\rho$ denote the spectral radius of $G$ and the universal cover of $G$, respectively. In \cite{Fri03}, Friedman has shown that almost every $n$-lift of $G$ has all of its new…
We investigate the group irregularity strength ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge labels at…
The Sensitivity Conjecture, posed in 1994, states that the fundamental measures known as the sensitivity and block sensitivity of a Boolean function f, s(f) and bs(f) respectively, are polynomially related. It is known that bs(f) is…
Let $(X,T)$ be a topological dynamical system, and $\mathcal{F}$ be a family of subsets of $\mathbb{Z}_+$. $(X,T)$ is strongly $\mathcal{F}$-sensitive, if there is $\delta>0$ such that for each non-empty open subset $U$, there are $x,y\in…
An independent broadcast on a connected graph $G$ is a function $f:V(G)\to \mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex…
What is the space of weakly-coupled, gravitational theories which contain massive, higher-spin particles? This class of theories is highly constrained and it is conjectured their ultraviolet completion must be string theory. We provide more…
Due to the high communication cost in distributed and federated learning problems, methods relying on compression of communicated messages are becoming increasingly popular. While in other contexts the best performing gradient-type methods…
We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…
We prove a quantitative deterministic equivalence theorem for the logarithmic potentials of deterministic complex $N\times N$ matrices subject to small random perturbations. We show that with probability close to $1$ this log-potential is,…
Given a finite set S of points in the plane and a real value d > 0, the d-radius disk graph G^d contains all edges connecting pairs of points in S that are within distance d of each other. For a given graph G with vertex set S, the Yao…
For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…
In this paper we consider the formally symmetric differential expression $M[\cdot]$ of any order (odd or even) $\geq 2$. We characterise the dimension of the quotient space $D(T_{\max})/D(T_{\min})$ associated with $M[\cdot]$ in terms of…
The distributed subgradient method (DSG) is a widely discussed algorithm to cope with large-scale distributed optimization problems in the arising machine learning applications. Most exisiting works on DSG focus on ideal communication…
In the Flexible Graph Connectivity (FGC) problem, we are given an undirected multigraph on $n$ vertices with nonnegative edge costs, where each edge is classified as either safe or unsafe. Given integer parameters $p$ and $q$, the goal in…
We prove a result about extension of a minimal AF-equivalence relation R on the Cantor set X, the extension being `small' in the sense that we modify R on a thin closed subset Y of X. We show that the resulting extended equivalence relation…
Interstellar communication transmitters, intended to be discovered and decoded to information bits, are expected to transmit signals that contain message symbols quantized in at least one of the degrees of freedom of the transmitted signal.…
The corrections to finite-size scaling in the critical two-point correlation function G(r) of 2D Ising model on a square lattice have been studied numerically by means of exact transfer-matrix algorithms. The systems of square geometry with…
The aim of decentralized gradient descent (DGD) is to minimize a sum of $n$ functions held by interconnected agents. We study the stability of DGD in open contexts where agents can join or leave the system, resulting each time in the…