Related papers: Fractional Isomorphism of Graphons
We use the Graph Minor Theorem to characterize infinite sequences of finite subsets of factorial and commutative semigroups (here semigroups have a unity element), e.g. the multiplicative semigroup of a unique factorization domain.
We introduce a counterpart to the notion of vertex disjoint tilings by copy of a fixed graph F to the setting of graphons. The case F=K_2 gives the notion of matchings in graphons. We give a transference statement that allows us to switch…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-behaved equational theory for our graph probabilistic…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
Iterated Graph Systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous…
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding notions in finite graphs. Combinatorial optimization studies the…
We highlight a topological aspect of the graph limit theory. Graphons are limit objects for convergent sequences of dense graphs. We introduce the representation of a graphon on a unique metric space and we relate the dimension of this…
This paper is devoted to the study of generalized differentiation properties of the infimal convolution. This class of functions covers a large spectrum of nonsmooth functions well known in the literature. The subdifferential formulas…
The categorical distribution is a natural representation of uncertainty in multi-class segmentations. In the two-class case the categorical distribution reduces to the Bernoulli distribution, for which grayscale morphology provides a range…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
Subgraph densities have been defined, and served as basic tools, both in the case of graphons (limits of dense graph sequences) and graphings (limits of bounded-degree graph sequences). While limit objects have been described for the…
Directed acyclic graphical models (DAGs) are often used to describe common structural properties in a family of probability distributions. This paper addresses the question of classifying DAGs up to an isomorphism. By considering Gaussian…
We study incommensurate fractional variational problems in terms of a generalized fractional integral with Lagrangians depending on classical derivatives and generalized fractional integrals and derivatives. We obtain necessary optimality…
In this paper we consider the gravitational field of fractal distribution of particles. To describe fractal distribution, we use the fractional integrals. The fractional integrals are considered as approximations of integrals on fractals.…
We study the structure of generalized Baumslag-Solitar groups from the point of view of their (usually non-unique) splittings as fundamental groups of graphs of infinite cyclic groups. We find and characterize certain decompositions of…
We consider general convolutional derivatives and related fractional statistical dynamics of continuous interacting particle systems. We apply the subordination principle to construct kinetic fractional statistical dynamics in the continuum…
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a…
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic…