Related papers: Combinatorial models of rigidity and renormalizati…
Sparse models for high-dimensional linear regression and machine learning have received substantial attention over the past two decades. Model selection, or determining which features or covariates are the best explanatory variables, is…
In this paper we study the global regularity for the solution to the Dirichlet problem of the equation of minimal graphs over a convex domain in hyperbolic spaces. We find that the global regularity depends only on the convexity of the…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
We study a specific class of deformations of curve singularities: the case when the singular point splits to several ones, such that the total $\delta$ invariant is preserved. These are also known as equi-normalizable or equi-generic…
We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…
We address the issue of recovering the structure of large sparse directed acyclic graphs from noisy observations of the system. We propose a novel procedure based on a specific formulation of the l1-norm regularized maximum likelihood,…
We analyze renormalization group (RG) flows in two-dimensional quantum field theories in the presence of redundant directions. We use the operator picture in which redundant operators are total derivatives. Our analysis has three levels of…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We review some recent results in the generic rigidity theory of planar frameworks with forced symmetry, giving a uniform treatment to the topic. We also give new combinatorial characterizations of minimally rigid periodic frameworks with…
Key to successfully deal with complex contemporary datasets is the development of tractable models that account for the irregular structure of the information at hand. This paper provides a comprehensive and unifying view of several…
I am showing how the ideas behind the renormalisation group can be generalised in order to produce the desired reduction in the degrees of freedom other that the ones considered up to now. Instead of looking only at the renormalisation…
In an undirected graph, a proper (k,i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-coloring problem is to compute the minimum number of colors…
These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a fairly thorough treatment of this deeply original method due to Shi and Malik, including complete proofs. I include the necessary…
Disorder effects are especially pronounced around nodal points in linearly dispersing bandstructures as present in graphene or Weyl semimetals. Despite the enormous experimental and numerical progress, even a simple quantity like the…
In this paper, we study a nonlocal variational problem which consists of minimizing in $L^2$ the sum of a quadratic data fidelity and a regularization term corresponding to the $L^p$-norm of the nonlocal gradient. In particular, we study…
In this work, we address the solution of both linear and nonlinear ill-posed inverse problems by developing a novel graph-based regularization framework, where the regularization term is formulated through an iteratively updated graph…
The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…
A particular choice of renormalization, within the simplifications provided by the non-perturbative property of Effective Locality, leads to a completely finite, renormalized theory of QCD, in which all correlation functions can, in…
Let $\Omega\subseteq \mathbb{R}^N$ a bounded open set, $N\geq 2$, and let $p>1$; we prove existence of a renormalized solution for parabolic problems whose model is $$ \begin{cases} u_{t}-\Delta_{p} u=\mu & \text{in}\…
We present a geometric proof of the Poincar\'e-Dulac Normalization Theorem for analytic vector fields with singularities of Poincar\'e type. Our approach allows us to relate the size of the convergence domain of the linearizing…