Related papers: Directed Hypercube Routing, a Generalized Lehman-R…
We present a detailed probabilistic and structural analysis of the set of weighted homomorphisms from the discrete torus $\mathbb{Z}_m^n$, where $m$ is even, to any fixed graph: we show that the corresponding probability distribution on…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undirected graphs [Chuzhoy and Li 2016] and [Chekuri and Ene…
We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and probability theory communities, with recent connections made to…
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…
In weighted graphs the shortest path between two nodes is often reached through an indirect path, out of all possible connections, leading to structural redundancies which play key roles in the dynamics and evolution of complex networks. We…
In the Directed Disjoint Paths problem, we are given a digraph $D$ and a set of requests $\{(s_1, t_1), \ldots, (s_k, t_k)\}$, and the task is to find a collection of pairwise vertex-disjoint paths $\{P_1, \ldots, P_k\}$ such that each…
We study a class of measures on the real line with a kind of self-similar structure, which we call dynamically driven self-similar measures, and contain proper self-similar measures such as Bernoulli convolutions as special cases. Our main…
We prove the sharp isoperimetric inequality $$ \mathbb{E} \,h_{A}^{\log_{2}(3/2)} \geq \mu(A)^{*} (\log_{2}(1/\mu(A)^{*}))^{\log_{2}(3/2)} $$ for all sets $A \subseteq \{0,1\}^n$, where $\mu$ denotes the uniform probability measure,…
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…
We prove analogues of classical results for higher homotopy groups and singular homology groups of pseudotopological spaces. Pseudotopological spaces are a generalization of (\v{C}ech) closure spaces which are in turn a generalization of…
Classical results on the statistical complexity of linear models have commonly identified the norm of the weights $\|w\|$ as a fundamental capacity measure. Generalizations of this measure to the setting of deep networks have been varied,…
We establish two results concerning a class of geometric rough paths $\mathbf{X}$ which arise as Markov processes associated to uniformly subelliptic Dirichlet forms. The first is a support theorem for $\mathbf{X}$ in $\alpha$-H\"older…
Using Talagrand's concentration inequality on the discrete cube {0,1}^m we show that given a real-valued function Z(x)on {0,1}^m that satisfies certain monotonicity conditions one can control the deviations of Z(x) above its median by a…
Various properties of isoperimetric, functional, Transport-Entropy and concentration inequalities are studied on a Riemannian manifold equipped with a measure, whose generalized Ricci curvature is bounded from below. First, stability of…
These notes are focused on three recent results in discrete random geometry, namely: the proof by Duminil-Copin and Smirnov that the connective constant of the hexagonal lattice is \sqrt{2+\sqrt 2}; the proof by the author and Manolescu of…
We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…
We develop a generalized resistance geometry based on Kron reduction and effective resistance for directed graphs, paralleling classical undirected graph theory. For strongly connected directed graphs, we prove a Fiedler--Bapat identity…
A linear flow on the torus $\mathbb{R}^d / \mathbb{Z}^d$ is uniformly distributed in the Weyl sense if the direction of the flow has linearly independent coordinates over $\mathbb{Q}$. In this paper we combine Fourier analysis and the…