Related papers: Directed Hypercube Routing, a Generalized Lehman-R…
A metrized complex of algebraic curves is a finite metric graph together with a collection of marked complete nonsingular algebraic curves, one for each vertex, the marked points being in bijection with incident edges. We establish a…
This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…
We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…
We prove a new logarithmic epiperimetric inequality for multiplicity-one stationary cones with isolated singularity by flowing in the radial direction any given trace along appropriately chosen directions. In contrast to previous…
We derive transport-entropy inequalities for mixed binomial point processes, and for Poisson point processes. We show that when the finite intensity measure satisfies a Talagrand transport inequality, the law of the point process also…
One can describe isomorphism of two compact hyperbolic Riemann surfaces of the same genus by a measure-theoretic property: a chosen isomorphism of their fundamental groups corresponds to a homeomorphism on the boundary of the Poincar\'e…
In this article, we study acylindrical graphs of groups, local quasiconvexity, and Cannon-Thurston maps in the setting of totally disconnected locally compact (TDLC) hyperbolic groups, extending several fundamental notions and results from…
We study maximal length collections of disjoint paths, or 'disjoint optimizers', in the directed landscape. We show that disjoint optimizers always exist, and that their lengths can be used to construct an extended directed landscape. The…
The Hard Lefschetz theorem for intersection cohomology of nonrational polytopes was recently proved by K. Karu [Ka]. This theorem implies the conjecture of R. Stanley on the unimodularity of the generalized $h$-vector. In this paper we…
In this paper we develop a measure-theoretic method to treat problems in hypergraph theory. Our central theorem is a correspondence principle between three objects: An increasing hypergraph sequence, a measurable set in an ultraproduct…
We present a rigorous homogenization theorem for distributed dislocations. We construct a sequence of locally-flat Riemannian manifolds with dislocation-type singularities. We show that this sequence converges, as the dislocations become…
We consider random walk in a space-time random potential, also known as directed random polymer measures, on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices. We construct covariant cocycles…
Using Banchoff's discrete Morse Theory, in tandem with Bloch's result on the strong connection between the former and Forman's Morse Theory, and our own previous algorithm based on the later, we show that there exists a curvature-based,…
We study monotonicity testing of high-dimensional distributions on $\{-1,1\}^n$ in the model of subcube conditioning, suggested and studied by Canonne, Ron, and Servedio~\cite{CRS15} and Bhattacharyya and Chakraborty~\cite{BC18}. Previous…
Many of the tools developed for the theory of tree-decompositions of graphs do not work for directed graphs. In this paper we show that some of the most basic tools do work in the case where the model digraph is a directed path. Using these…
As a variant of the well-known hypercube, the balanced hypercube $BH_n$ was proposed as a novel interconnection network topology for parallel computing. It is known that $BH_n$ is bipartite. Assume that $S=\{s_1,s_2\}$ and $T=\{t_1,t_2\}$…
Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. This is one of the most important unsolved problems in graph theory. Let $H$ be a subgraph of a graph $G$. A vertex $v$ of $H$ is…
It follows from a general theorem of Bonk and Eremenko that closed plane curves which are contractible in the complement to the integral lattice satisfy a linear isoperimetric inequality. We give an alternative proof of this fact. Our…
The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…
We provide deficit estimates for Nelson's hypercontractivity inequality, the logarithmic Sobolev inequality, and Talagrand's transportation cost inequality under the restriction that the inputs are semi-log-subharmonic, semi-log-convex, or…