Related papers: Trees on hyperbolic honeycombs
Generative network models are extremely useful for understanding the mechanisms that operate in network formation and are widely used across several areas of knowledge. However, when it comes to bipartite networks -- a class of network…
We study coupled maps on a Cayley tree, with local (nearest-neighbor) interactions, and with a variety of boundary conditions. The homogeneous state (where every lattice site has the same value) and the node-synchronized state (where sites…
In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
Let $G$ be an acylindrically hyperbolic group on a $\delta$-hyperbolic space $X$. Assume there exists $M$ such that for any finite generating set $S$ of $G$, the set $S^M$ contains a hyperbolic element on $X$. Suppose that $G$ is…
We calculate exponential growth constants $\phi$ and $\sigma$ describing the asymptotic behavior of spanning forests and connected spanning subgraphs on strip graphs, with arbitrarily great length, of several two-dimensional lattices,…
We study the local profiles of trees. We show that, in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging…
Tropical geometry with the max-plus algebra has been applied to statistical learning models over tree spaces because geometry with the tropical metric over tree spaces has some nice properties such as convexity in terms of the tropical…
We consider a new IDLA - particle system model, on the upper half planar lattice, resulting in an infinite forest covering the half plane. We prove that almost surely all trees are finite.
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…
A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in…
We study topological properties of automorphisms of 4-dimensional torus generated by integer symplectic matrices. The main classifying element is the structure of the topology of a foliation generated by unstable leaves of the automorphism.…
We divide the circular boundary of a hyperbolic lattice into four equal intervals, and study the probability of a percolation crossing between an opposite pair, as a function of the bond occupation probability p. We consider the {7,3}…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
In this paper we give new requirements that a tree of $\delta$-hyperbolic spaces has to satisfy in order to be $\delta$-hyperbolic itself. As an application, we give a simple proof that limit groups are relatively hyperbolic.
We produce a large class of hyperbolic homology 3-spheres admitting arbitrarily many distinct tight contact structures. We also produce a sub-class admitting arbitrarily many distinct tight contact structures within the same homotopy class…
Natural language data exhibit tree-like hierarchical structures such as the hypernym-hyponym relations in WordNet. FastText, as the state-of-the-art text classifier based on shallow neural network in Euclidean space, may not model such…
We consider random energy landscapes constructed from d-dimensional lattices or trees. The distribution of the number of local minima in such landscapes follows a large deviation principle and we derive the associated law exactly for…
We introduce classes of edge-colourings of the complete graph -- that we call nice and beautiful -- and study how many heterochromatic spanning trees appear under such colourings. We prove that if the colouring is nice, there is at least a…