Related papers: Lipschitz functions on weak expanders
We study proximal random reshuffling for minimizing the sum of locally Lipschitz functions and a proper lower semicontinuous convex function without assuming coercivity or the existence of limit points. The algorithmic guarantees pertaining…
Given a convex set $C$ in a real vector space $E$ and two points $x,y\in C$, we investivate which are the possible values for the variation $f(y)-f(x)$, where $f:C\longrightarrow [m,M]$ is a bounded convex function. We then rewrite the…
For a given function from a set to itself, we can define a directed graph called the functional graph, where the vertices are the elements of the set, and the edges are all the pairs of inputs and outputs for the function. In this article…
We prove that a random group in the triangular density model has, for density larger than 1/3, fixed point properties for actions on $L^p$-spaces (affine isometric, and more generally $(2-2\epsilon)^{1/2p}$-uniformly Lipschitz) with $p$…
Given an arbitrary $1$-Lipschitz function $f$ on the torus $\mathbb{T}^n $, we find a $k$-dimensional subtorus $M \subseteq \mathbb{T}^n$, parallel to the axes, such that the restriction of $f$ to the subtorus $M$ is nearly a constant…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
Fix a metric space $M$ and let $\mathrm{Lip}_0(M)$ be the Banach space of complex-valued Lipschitz functions defined on $M$. A weighted composition operator on $\mathrm{Lip}_0(M)$ is an operator of the kind $wC_f : g \mapsto w \cdot g \circ…
We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also…
A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…
This paper discusses, certain algebraic, analytic, and topological results on partial iterated function systems($IFS_p$'s). Also, the article proves the Collage theorem for partial iterated function systems. Further, it provides a method to…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
We show that for every Lipschitz function $f$ defined on a separable Riemannian manifold $M$ (possibly of infinite dimension), for every continuous $\epsilon:M\to (0,+\infty)$, and for every positive number $r>0$, there exists a $C^\infty$…
We study probabilistic iterated function systems (IFS), consisting of a finite or infinite number of average-contracting bi-Lipschitz maps on R^d. If our strong open set condition is also satisfied, we show that both upper and lower bounds…
Given integers $m$ and $f$, let $S_n(m,f)$ consist of all integers $e$ such that every $n$-vertex graph with $e$ edges contains an $m$-vertex induced subgraph with $f$ edges, and let $\sigma(m,f)=\limsup_{n\rightarrow\infty}…
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a giant component in random subgraphs of pseudo-random graphs. We study several typical properties of the giant component, most notably its expansion characteristics.…
We consider a class of graph-valued stochastic processes in which each vertex has a type that fluctuates randomly over time. Collectively, the paths of the vertex types up to a given time determine the probabilities that the edges are…
The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…