Related papers: Understand Slope Limiter -- Graphically
Mapper graphs are widely used tools in topological data analysis and visualization. They can be understood as discrete approximations of Reeb graphs, providing insight into the shape and connectivity of complex data. Given a…
Consider a graph G with an assignment of costs to vertices. Even if G and all its subgraphs admit balanced separators of sublinear size, G may only admit a balanced separator of sublinear cost after deleting a small set Z of exceptional…
Graph transformations definable in logic can be described using the notion of transductions. By understanding transductions as a basic embedding mechanism, which captures the possibility of encoding one graph in another graph by means of…
We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$.…
Linear-width is a well-known and highly regarded graph parameter. The concept of Single Ideal and Linear obstacle serves as an obstruction to linear-width on a connectivity sysem. In this concise paper, we present an alternative proof for…
We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
The collective dynamics of interacting dynamical units on a network crucially depends on the properties of the network structure. Rather than considering large but finite graphs to capture the network, one often resorts to graph limits and…
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…
We study the problem of variance estimation in general graph-structured problems. First, we develop a linear time estimator for the homoscedastic case that can consistently estimate the variance in general graphs. We show that our estimator…
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a…
We observe a realization of a stationary generalized weighted Voronoi tessellation of the d-dimensional Euclidean space within a bounded observation window. Given a geometric characteristic of the typical cell, we use the minus-sampling…
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…
Switching between finitely many continuous-time autonomous steepest descent dynamics for convex functions is considered. Convergence of complete solutions to common minimizers of the convex functions, if such minimizers exist, is shown. The…
We explicitly compute the limiting slope gap distribution for saddle connections on any 2n-gon. Our calculations show that the slope gap distribution for a translation surface is not always unimodal, answering a question of Athreya. We also…
For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…
A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
Convergence of the solutions of nonhomogeneous linear singularly perturbed systems to that of the corresponding reduced singular system on the half-line [0, $\infty $) is considered. To include the situation on a neighborhood of initial…