Related papers: The moving particle lemma for the exclusion proces…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…
In the edge-2star model with hard constraints we prove the existence of an open set of constraint parameters, bisected by a line segment on which there are nonunique entropy-optimal graphons related by a symmetry. At each point in the open…
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the…
We consider the question of existence of a unique invariant probability distribution which satisfies some evolutionary property. The problem arises from the random graph theory but to answer it we treat it as a dynamical system in the…
This survey describes some recent rigidity results obtained by the authors for the prescribed mean curvature problem on graphs $u : M \rightarrow \mathbb{R}$. Emphasis is put on minimal, CMC and capillary graphs, as well as on graphical…
Let $\Gamma$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $\Gamma$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
For graph classification tasks, many traditional kernel methods focus on measuring the similarity between graphs. These methods have achieved great success on resolving graph isomorphism problems. However, in some classification problems,…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
We prove results for first-passage percolation on the configuration model with i.i.d. degrees having finite mean, infinite variance and i.i.d. weights with strictly positive support of the form Y=a+X, where a is a positive constant. We…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We consider the question of orienting the edges in a graph $G$ such that every vertex has bounded out-degree. For graphs of arboricity $\alpha$, there is an orientation in which every vertex has out-degree at most $\alpha$ and, moreover,…
Finding maximum-weight independent sets in graphs is an important NP-hard optimization problem. Given a vertex-weighted graph $G$, the task is to find a subset of pairwise non-adjacent vertices of $G$ with maximum weight. Most recently…
We show that for any $\Delta \geq 3$, there is no bound computable from $(\varepsilon, r)$ on the size of a graph required to approximate a graph of maximum degree at most $\Delta$ up to $\varepsilon$ error in $r$-neighborhood statistics.…
In this paper we study the motion of a charged particle on a Riemannian surface under the influence of a positive magnetic field B. Using Moser's Twist Theorem and ideas from classical pertubation theory we find sufficient conditions to…
As in algebraic geometry, an effective divisor class on a vertex-weighted graph is called special if also its residual class is effective. We study the question, when this is true already on the level of divisors; that is, when there exists…
Our previous paper applied a lopsided version of the Lov\'asz Local Lemma that allows negative dependency graphs to the space of random injections from an $m$-element set to an $n$-element set. Equivalently, the same story can be told about…