Related papers: Spanning Trees on Lattices and Integration Identit…
We study the phase-ordering kinetics following a temperature quench of O(N) continuous symmetry models with and 4 on graphs. By means of extensive simulations, we show that the global pattern of scaling behaviours is analogous to the one…
We show that for all $\gamma > 0$ and $\Delta \in \mathbb{N}$, there is some $n_0$ such that, if $n \geq n_0$, then every oriented graph on $n$ vertices with minimum semidegree at least $(3/8 + \gamma)n$ contains a copy of each oriented…
We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence $\boldsymbol{d}=(d_1,\ldots, d_n)$, provided that the number of edges is at least $n + \textstyle{\frac{1}{2}}…
We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields…
A contact map is a simple representation of the structure of proteins and other chain-like macromolecules. This representation is quite amenable to numerical studies of folding. We show that the number of contact maps corresponding to the…
In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…
In the present communication we consider the one-dimensional (1D) isotopically disordered lattice with the harmonic potential. Our analytical method is adequate for any 1D lattice where potential energy can be presented as the quadratic…
A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most…
Higher symmetries can emerge at low energies in a topologically ordered state with no symmetry, when some topological excitations have very high energy scales while other topological excitations have low energies. The low energy properties…
We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…
We show how methods of continuum perturbation theory can be used to simplify perturbative lattice calculations. We use the technique of asymptotic expansions to expand lattice loop integrals around the continuum limit. After the expansion,…
For any edge weight distribution, we consider the uniform spanning tree (UST) on finite graphs with i.i.d. random edge weights. We show that, for bounded degree expander graphs and finite boxes of ${\mathbb Z}^d$, the diameter of the UST is…
The aim of this study is tree-fold. First, we investigate the thermodynamics of the Ising models with respect to 2-multiple Hamiltonians. This extends the previous results of [Chazotte and Redig, Electron. J. Probably., 2014] to…
Let $T$ be a tree. A vertex of degree one is a \emph{leaf} of $T$ and a vertex of degree at least three is a \emph{branch vertex} of $T$. A graph is said to be \emph{$K_{1,4}$-free} if it does not contain $K_{1,4}$ as an induced subgraph.…
We study the height of the delta peak at 0 in the spectrum of random tree incidence matrices. We show that the average fraction of the spectrum occupied by the eigenvalue 0 in a large random tree is asymptotic to 2x-1 =…
We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parameters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper. Our…
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
For a $\mathbb{Z}_p$-covering of connected graphs, an analogue of Iwasawa's class number formula describes the growth of the number of spanning trees in terms of Iwasawa $\lambda$- and $\mu$-invariants. In this paper, we show that any pair…
We study semi-infinite paths of the radial spanning tree (RST) of a Poisson point process in the plane. We first show that the expectation of the number of intersection points between semi-infinite paths and the sphere with radius $r$ grows…