Related papers: Left-cut-percolation and induced-Sidorenko bigraph…

We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…

A recent result of Condon, Kim, K\"{u}hn and Osthus implies that for any $r\geq (\frac{1}{2}+o(1))n$, an $n$-vertex almost $r$-regular graph $G$ has an approximate decomposition into any collections of $n$-vertex bounded degree trees. In…

Graphons $W$ can be used as stochastic models to sample graphs $G_n$ on $n$ nodes for $n$ arbitrarily large. A graphon $W$ is said to have the $H$-property if $G_n$ admits a decomposition into disjoint cycles with probability one as $n$…

We apply the new method for constructing integrable Hamiltonian hierarchies of Lax type equations developed in our previous paper, to show that all W-algebras W(gl_N,f) carry such a hierarchy. As an application, we show that all vector…

We develop the deformations theory of a Dirac--Jacobi structure within a fixed Courant--Jacobi algebroid. Using the description of split Courant--Jacobi algebroids as degree $2$ contact $\mathbb{N} Q$ manifolds and Voronov's higher derived…

This paper initiates the study of the "Laplacian simplex" $T_G$ obtained from a finite graph $G$ by taking the convex hull of the columns of the Laplacian matrix for $G$. Basic properties of these simplices are established, and then a…

In high-energy physics, particles produced in collision events decay in a format of a hierarchical tree structure, where only the final decay products can be observed using detectors. However, the large combinatorial space of possible tree…

In this paper, we develop a new approach to the deformation theory of restricted Lie-Rinehart algebras in positive characteristic, based on the deformation theory of restricted morphisms introduced in our earlier work. We provide a full…

Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded…

Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…

In recent years, there have been intense research efforts to develop efficient methods for probabilistic inference in probabilistic influence diagrams or belief networks. Many people have concluded that the best methods are those based on…

Surface Patterson Functions have been derived by direct inversion of experimental Low-Energy Electron Diffraction I-V spectra measured at multiple incident angles. The direct inversion is computationally simple and can be used to…

Let F be a p-adic field and n a positive integer. The local Langlands conjecture asserts the existence of a bijection between irreducible admissible representations of GL(n,F) and n-dimensional admissible representations of the Weil-Deligne…

Let $H$ be a subdigraph of a digraph $D$. An ear of $H$ in $D$ is a path or a cycle in $D$ whose ends lie in $H$ but whose internal vertices do not. An \emph{ear decomposition} of a strong digraph $D$ is a nested sequence $(D_0,D_1,\ldots ,…

This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…

Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…

We consider a general method of deprojecting 2D images to reconstruct the 3D structure of the projected object, assuming axial symmetry. The method consists of the application of the Fourier Slice Theorem to the general case where the axis…

In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete…

Many material response functions depend strongly on microstructure, such as inhomogeneities in phase or orientation. Homogenization presents the task of predicting the mean response of a sample of the microstructure to external loading for…

We combine the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings. Furthermore, it is easier to understand the structures of graphs from the mixed style drawings. The…