arXiv research

In L^3, cuspidal edges can have bounded mean curvature under specific conditions.

Paper detects anomalous edges in social networks using edge exchangeability.

We establish bounds on the KL divergence between two multivariate Gaussian distributions in terms of the Hamming distance between the edge sets of the corresponding graphical models. We show that the KL divergence is bounded below by a constant when the graphs differ by at least one edge; this is essentially the tighte…

Suppose $C$ is a compact, $n$-edged two-cell of the centered dual decomposition of a locally finite set in the hyperbolic plane, a coarsening of the Delaunay tessellation which was introduced in the author's prior work. We describe an effectively computable lower bound on the area of $C$, given an $n$-tuple of positive…

The PC algorithm allows investigators to estimate a complete partially directed acyclic graph (CPDAG) from a finite dataset, but few groups have investigated strategies for estimating and controlling the false discovery rate (FDR) of the edges in the CPDAG. In this paper, we introduce PC with p-values (PC-p), a fast al…

Approximates cycles in planar and bounded-genus graphs.

Paper proposes efficient weight updates for edge nodes with minimal communication.

Edge augmentation connects disconnected graphs by elevating eigenvalues.

We present a graph-based semi-supervised learning (SSL) method for learning edge flows defined on a graph. Specifically, given flow measurements on a subset of edges, we want to predict the flows on the remaining edges. To this end, we develop a computational framework that imposes certain constraints on the overall fl…

We show that any two geometric triangulations of a closed hyperbolic, spherical or Euclidean manifold are related by a sequence of Pachner moves and barycentric subdivisions of bounded length. This bound is in terms of the dimension of the manifold, the number of top dimensional simplexes and bound on the lengths of ed…

Study designs experiments to identify causal graph structure with cycles and latent confounders.

Critical nets in $\mathbb{R}^k$ (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices (leaves) have a fixed position. In contrast to what happens on generic manifolds, w…

New bounds on maximal linkless graphs with improved edge-to-vertex ratios.

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an \emph{approximate recovery} criterion that allows for a number of missed edges or incorrectly-included edges, in contrast with the widel…

We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not be replaced by a subexponential bound. However, if T is polytopal (resp. shellab…

In this paper, we study the sensitivity of the spectral clustering based community detection algorithm subject to a Erdos-Renyi type random noise model. We prove phase transitions in community detectability as a function of the external edge connection probability and the noisy edge presence probability under a general…

Let $X$ be an infinite Riemann surface equipped with its conformal hyperbolic metric such that the action of the covering group $π_1(X)$ on $\tilde{X}$ is of the first kind-i.e., the surface $X$ is equal to its convex core. We first prove that any geodesic lamination on $X$ is nowhere dense. Given a fixed geodesic pant…

Differentially private graph learning via bounded sensitivity PPR.

Polynomial-time algorithm estimates edge density of random graphs with privacy and robustness.

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

New protocol identifies impossible edge orientations in causal graphs.

We consider the problem of model selection in Gaussian Markov fields in the sample deficient scenario. The benchmark information-theoretic results in the case of d-regular graphs require the number of samples to be at least proportional to the logarithm of the number of vertices to allow consistent graph recovery. When…

This article presents an analysis of the normalized Yamabe flow starting at and preserving a class of compact Riemannian manifolds with incomplete edge singularities and negative Yamabe invariant. Our main results include uniqueness, long-time existence and convergence of the edge Yamabe flow starting at a metric with …

This work estimates edge weights of edge-reinforced random walks using observed data.

If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by I. A. Dynnikov. Using this, Henrich and Kauffman gave an up…

The study finds the bounds of vertex orbits in maps derived from specific lattices.

The study explores maps of 2- and 3-uniform tilings on the torus.

Study detects edge correlation between unlabeled random graphs.

New statistical mechanics analysis shows edge pruning outperforms node pruning in neural networks.

We give algorithms with provable guarantees that learn a class of deep nets in the generative model view popularized by Hinton and others. Our generative model is an $n$ node multilayer neural net that has degree at most $n^γ$ for some $γ<1$ and each edge has a random edge weight in $[-1,1]$. Our algorithm learns {\em …

Study reveals limits of detecting local geometry in random graphs.

Federated learning technique improves convergence speed with communication delays.

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface is connected. We give upper bounds on the number of edge f…

We introduce a novel type of stabilization map on the configuration spaces of a graph, which increases the number of particles occupying an edge. There is an induced action on homology by the polynomial ring generated by the set of edges, and we show that this homology module is finitely generated. An analogue of class…

Bounds on conformal dimension for certain Coxeter group boundaries.

New method for online learning IC models with node-level feedback.

ACERL embeds networks into a low-dimensional space preserving structural and semantic properties.

In \cite{rigidity}, Luo introduced a $ψ_λ$ edge invariant which turns out to be a coordinate of the Teichmüller space of a surface with boundary. And he proved that for $λ\geq 0$, the image of the Teichmüller space under $ψ_λ$ edge invariant coordinate is an open cell. In this paper we verify his conjecture that for $λ…

We study the problem of learning Bayesian network structures from data. Koivisto and Sood (2004) and Koivisto (2006) presented algorithms that can compute the exact marginal posterior probability of a subnetwork, e.g., a single edge, in O(n2n) time and the posterior probabilities for all n(n-1) potential edges in O(n2n…

We study singularities of Gauss maps of fronts and give characterizations of types of singularities of Gauss maps by geometric properties of fronts which are related to behavior of bounded principal curvatures. Moreover, we investigate relation between a kind of boundedness of Gaussian curvatures near cuspidal edges an…

The study characterizes 3-pseudomanifolds with up to two singularities.

The study examines how gamma positivity and PL homeomorphism types affect simplicial spheres.

VL finds flatter solutions at edge of stability, matching theory with practice.

Paper provides statistical guarantees for GNNs in link prediction.

Proof of Knot Entropy Conjecture for tube lattice polygons.

Higher-order motif structures and multi-vertex interactions are becoming increasingly important in studies that aim to improve our understanding of functionalities and evolution patterns of networks. To elucidate the role of higher-order structures in community detection problems over complex networks, we introduce the…

We study the eleven dimensional supergravity equations which describe a low energy approximation to string theories and are related to M-theory under the AdS/CFT correspondence. These equations take the form of a non-linear differential system, on $\mathbb{B}^7\times\mathbb{S}^4$ with the characteristic degeneracy at t…

Recovering edge activities from node activity data in temporal networks.