Related papers: Generalized Splines and Graphic Arrangements
In network science, collective dynamics of complex systems are typically modelled as (nonlinear, often including many-body) vertex-level update rules evolving over a graph interaction structure. In recent years, frameworks that explicitly…
For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…
Clustering is a commonplace problem in many areas of data science, with applications in biology and bioinformatics, understanding chemical structure, image segmentation, building recommender systems, and many more fields. While there are…
The string splicing was introduced by Tom Head which stands as an abstract model for the DNA recombination under the influence of restriction enzymes. The complex chemical process of three dimensional molecules in three dimensional space…
In the present article we work out a relative setup of generic structures on surface singularities. We fix an analytic type on a subgraph of a rational homology sphere resolution graph $\mathcal{T}$ and we choose a relatively generic normal…
We introduce the notion of strip complex. A strip complex is a special type of complex obtained by gluing "strips" along their natural boundaries according to a given graph structure. The most familiar example is the one dimensional complex…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. In this article we prove a sufficient numerical condition on the splice diagram for a graph manifold to be a singularity link.…
We explore connections between the generalized multiplicities of square-free monomial ideals and the combinatorial structure of the underlying hypergraphs using methods of commutative algebra and polyhedral geometry. For instance, we show…
With the renewed and growing interest in geometric continuity in mind, this article gives a general definition of geometrically continuous polygonal surfaces and geometrically continuous spline functions on them. Polynomial splines defined…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…
The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalization, which we call higher-order spectral clustering. It…
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
This paper studies linear generalised complex structures over vector bundles, as a generalised geometry version of holomorphic vector bundles. In an adapted linear splitting, a linear generalised complex structure on a vector bundle $E\to…
We provide several results on splice-quotient singularities: a combinatorial expression of the dimension of the first cohomology of all `natural' line bundles, an equivariant Campillo-Delgado-Gusein-Zade type formula about the dimension of…
Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…
In this paper, we present a hybrid graph-drawing algorithm (GDA) for layouting large, naturally-clustered, disconnected graphs. We called it a hybrid algorithm because it is an implementation of a series of already known graph-drawing and…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…