Cost-allocation problems for fuzzy agents in a fixed-tree network

Cost-allocation problems in a fixed network are concerned with distributing the costs for use by a group of clients who cooperate in order to reduce such costs. We work only with tree networks and we assume that a minimum cost spanning tree network has already been constructed and now we are interested in the maintenance costs. The classic problem supposes that each agent stays for the entire time in the same node of the network. This paper introduces cost-allocation problems in a fixed-tree network with a set of agents whose activity over the nodes is fuzzy. Agent’s needs to pay for each period of time may differ. Moreover, the agents do not always remain in the same node for each period. We propose the extension of a very well-known solution for these problems: Bird’s rule.

Generalized Planar Turán Numbers

In a generalized Turán problem, we are given graphs $H$ and $F$ and seek to maximize the number of copies of $H$ in an $n$-vertex graph not containing $F$ as a subgraph. We consider generalized Turán problems where the host graph is planar. In particular, we obtain the order of magnitude of the maximum number of copies of a fixed tree in a planar graph containing no even cycle of length at most $2\ell$, for all $\ell$, $\ell \geqslant 1$. We also determine the order of magnitude of the maximum number of cycles of a given length in a planar $C_4$-free graph. An exact result is given for the maximum number of $5$-cycles in a $C_4$-free planar graph. Multiple conjectures are also introduced.

Quiver Grassmannians of Type $\widetilde {D}_{n}$, Part 2: Schubert Decompositions and F-polynomials

Extending the main result of Lorscheid and Weist (2015), in the first part of this paper we show that every quiver Grassmannian of an indecomposable representation of a quiver of type $\tilde D_{n}$ D ~ n has a decomposition into affine spaces. In the case of real root representations of small defect, the non-empty cells are in one-to-one correspondence to certain, so called non-contradictory, subsets of the vertex set of a fixed tree-shaped coefficient quiver. In the second part, we use this characterization to determine the generating functions of the Euler characteristics of the quiver Grassmannians (resp. F-polynomials). Along these lines, we obtain explicit formulae for all cluster variables of cluster algebras coming from quivers of type $\tilde D_{n}$ D ~ n .

Semi-Dynamic Hypergraph Neural Network for 3D Pose Estimation

This paper proposes a novel Semi-Dynamic Hypergraph Neural Network (SD-HNN) to estimate 3D human pose from a single image. SD-HNN adopts hypergraph to represent the human body to effectively exploit the kinematic constrains among adjacent and non-adjacent joints. Specifically, a pose hypergraph in SD-HNN has two components. One is a static hypergraph constructed according to the conventional tree body structure. The other is the semi-dynamic hypergraph representing the dynamic kinematic constrains among different joints. These two hypergraphs are combined together to be trained in an end-to-end fashion. Unlike traditional Graph Convolutional Networks (GCNs) that are based on a fixed tree structure, the SD-HNN can deal with ambiguity in human pose estimation. Experimental results demonstrate that the proposed method achieves state-of-the-art performance both on the Human3.6M and MPI-INF-3DHP datasets.

Testing for dependence on tree structures

Tree structures, showing hierarchical relationships and the latent structures between samples, are ubiquitous in genomic and biomedical sciences. A common question in many studies is whether there is an association between a response variable measured on each sample and the latent group structure represented by some given tree. Currently, this is addressed on an ad hoc basis, usually requiring the user to decide on an appropriate number of clusters to prune out of the tree to be tested against the response variable. Here, we present a statistical method with statistical guarantees that tests for association between the response variable and a fixed tree structure across all levels of the tree hierarchy with high power while accounting for the overall false positive error rate. This enhances the robustness and reproducibility of such findings.

Using RAxML-NG in Practice

RAxML-NG is a new phylogentic inference tool that replaces the widely-used RAxML and ExaMLtree inference codes. Compared to its predecessors, RAxML-NG offers improvements in accur-acy, flexibility, speed, scalability, and user-friendliness. In this chapter, we provide practicalrecommendations for the most common use cases of RAxML-NG: tree inference, branch supportestimation via non-parametric bootstrapping, and parameter optimization on a fixed tree topo-logy. We also describe best practices for achieving optimal performance with RAxML-NG, inparticular, with respect to parallel tree inferences on computer clusters and supercomputers. AsRAxML-NG is continuously updated, the most up-to-date version of the tutorial described inthis chapter is available online at: https://cme.h-its.org/exelixis/raxml-ng/tutorial .

Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in $m$-ary Search Trees and Preferential Attachment Trees

We study fringe subtrees of random $m$-ary search trees and of preferential attachment trees, by putting them in the context of generalised Pólya urns. In particular we show that for the random $m$-ary search trees with $ m\leq 26 $ and for the linear preferential attachment trees, the number of fringe subtrees that are isomorphic to an arbitrary fixed tree $ T $ converges to a normal distribution; more generally, we also prove multivariate normal distribution results for random vectors of such numbers for different fringe subtrees. Furthermore, we show that the number of protected nodes in random $m$-ary search trees for $m\leq 26$ has asymptotically a normal distribution.

Graph Homomorphisms between Trees

In this paper we study several problems concerning the number of homomorphisms of trees. We begin with an algorithm for the number of homomorphisms from a tree to any graph. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees. These applications include a far reaching generalization and a dual of Bollobás and Tyomkyn's result concerning the number of walks in trees.Some other main results of the paper are the following. Denote by $\hom(H,G)$ the number of homomorphisms from a graph $H$ to a graph $G$. For any tree $T_m$ on $m$ vertices we give a general lower bound for $\hom(T_m,G)$ by certain entropies of Markov chains defined on the graph $G$. As a particular case, we show that for any graph $G$, $$\exp(H_{\lambda}(G))\lambda^{m-1}\leq\hom(T_m,G),$$ where $\lambda$ is the largest eigenvalue of the adjacency matrix of $G$ and $H_{\lambda}(G)$ is a certain constant depending only on $G$ which we call the spectral entropy of $G$. We also show that if $T_m$ is any fixed tree and$$\hom(T_m,P_n)>\hom(T_m,T_n),$$for some tree $T_n$ on $n$ vertices, then $T_n$ must be the tree obtained from a path $P_{n-1}$ by attaching a pendant vertex to the second vertex of $P_{n-1}$.All the results together enable us to show that among all trees with fixed number of vertices, the path graph has the fewest number of endomorphisms while the star graph has the most.