Related papers: Birational transformations of weighted graphs
We introduce equivariant Burnside groups, new invariants in equivariant birational geometry, generalizing birational symbols groups for actions of finite abelian groups, due to Kontsevich, Pestun, and the second author, and study their…
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by…
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…
A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
A birational map from a projective space onto a not too much singular projective variety with a single irreducible non-singular base locus scheme (special birational transformation) is a rare enough phenomenon to allow meaningful and…
A natural generalization of a regular (or equitable) partition of a graph, which makes sense also for non-regular graphs, is the so-called weight-regular partition, which gives to each vertex $u\in V$ a weight that equals the corresponding…
In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues…
Neural networks that process the parameters of other neural networks find applications in domains as diverse as classifying implicit neural representations, generating neural network weights, and predicting generalization errors. However,…
We study equivariant birationality from the perspective of derived categories. We produce examples of nonlinearizable but stably linearizable actions of finite groups on smooth cubic fourfolds.
We initiate a statistical study of Kalai's exterior algebraic shifting, focusing on concentration phenomena for random triangulations of a fixed space. First, for a uniform $n$-vertex refinement of any given graph $G$, we show that…
This article deals with the study of the birational transformations of the projective complex plane which leave invariant an irreducible algebraic curve. We try to describe the state of art and provide some new results on this subject.
The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…
We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…
The exponential family of random graphs represents an important and challenging class of network models. Despite their flexibility, conventionally used exponential random graphs have one shortcoming. They cannot directly model weighted…
This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called algebraic connectivity)…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…