Related papers: Some criteria for circle packing types and combina…

Given $D$ and $\gamma>0$, whenever $c>0$ is sufficiently small and $n$ sufficiently large, if $\mathcal{G}$ is a family of $D$-degenerate graphs of individual orders at most $n$, maximum degrees at most $\tfrac{cn}{\log n}$, and total…

We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in ${\cal D}(n,p)$ for nearly optimal $p$ (up to a $\log ^cn$ factor). In particular, we show that given $t = (1-o(1))np$ Hamilton cycles $C_1,\ldots ,C_{t}$,…

We investigate the disordered copolymer and pinning models, in the case of a correlated Gaussian environment with summable correlations, and when the return distribution of the underlying renewal process has a polynomial tail. As far as the…

We formulate the most general gravitational models with constant negative curvature ("hyperbolic gravity") on an arbitrary orientable two-dimensional surface of genus $g$ with $b$ circle boundaries in terms of a $\text{PSL}(2,\mathbb…

We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and…

We have studied the packing of congruent disks on a spherical cap, for caps of different size and number of disks, $N$. This problem has been considered before only in the limit cases of circle packing inside a circle and on a sphere…

For triangulated surfaces and any $p>1$, we introduce the combinatorial $p$-th Calabi flow which precisely equals the combinatorial Calabi flows first introduced in H. Ge's thesis when $p=2$. The difficulties for the generalizations come…

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n…

Based on a geometric interpretation of Brotbek's symmetric differential forms, for the intersection family $\mathcal{X}$ of generalized Fermat-type hypersurfaces in $\mathbb{P}_{\mathbb{K}}^N$ defined over any field $\mathbb K$, we…

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…

Thurston's circle packing approximation of the Riemann Mapping (proven to give the Riemann Mapping in the limit by Rodin-Sullivan) is largely based on the theorem that any topological disk with a circle packing metric can be deformed into a…

In this paper we introduce a class of polygonal complexes for which we can define a notion of sectional combinatorial curvature. These complexes can be viewed as generalizations of 2-dimensional Euclidean and hyperbolic buildings. We focus…

Let $\Sigma$ be a compact, orientable surface of negative Euler characteristic, and let $h$ be a complete hyperbolic metric on $\Sigma$. A geodesic curve $\gamma$ in $\Sigma$ is filling, if it cuts the surface into topological disks and…

We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…

We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…

We define discrete constant mean curvature (cmc) surfaces in the three-dimensional Euclidean and Lorentz spaces in terms of sphere packings with orthogonally intersecting circles. These discrete cmc surfaces can be constructed from…

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

In this thesis we consider a way to construct a rich family of compact Riemann Surfaces in a combinatorial way. Given a 3-regualr graph with orientation, we construct a finite-area hyperbolic Riemann surface by gluing triangles according to…

We formulate weighted graph clustering as a prediction problem: given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. This formulation enables practical and theoretical comparison…