Related papers: Asymptotic Behavior of Spanning Forests and Connec…
Two-dimensional $CP^{N-1}$ models are investigated by Monte Carlo methods on the lattice, for values of $N$ ranging from 2 to 21. Scaling and rotation invariance are studied by comparing different definitions of correlation length $\xi$.…
Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…
We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…
We study the connections between volume growth, spectral properties and stochastic completeness of locally finite graphs. For a class of graphs with a very weak spherical symmetry we give a condition which implies both stochastic…
It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface S_g of genus g grows asymptotically like $c^{(g)}n^{5(g-1)/2-1}\gamma^n n!$ where $c^{(g)}>0$, and $\gamma \approx 27.23$ is the…
We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…
We conduct the multifractal analysis of the level sets of the asymptotic behavior of almost additive continuous potentials $(\phi_n)_{n=1}^\infty$ on a topologically mixing subshift of finite type $X$ endowed itself with a metric associated…
Consider the nearest neighbor graph for the integer lattice Z^d in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphs that are spanning trees. As the piece…
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…
Growth-fragmentation processes describe the evolution of systems of cells which grow continuously and fragment suddenly; they are used in models of cell division and protein polymerisation. Typically, we may expect that in the long run, the…
We prove that every connected graph with $s$ vertices of degree~1 and 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}$ leaves. We present infinite series of graphs showing that…
We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R, n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in the unit cube in $d$ dimensions and edge weights are the…
Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$…
Many processes and models --in biological, physical, social, and other contexts-- produce trees whose depth scales logarithmically with the number of leaves. Phylogenetic trees, describing the evolutionary relationships between biological…
We study the asymptotic behavior of the maximum degree in the evolving tree model with a choice based on both degree and fitness of a vertex. The tree is constructed in the following recursive way. Each vertex is assigned a parameter to it…
Invariant correlation functions for ${\rm SO}(1,N)$ hyperbolic sigma-models are investigated. The existence of a large $N$ asymptotic expansion is proven on finite lattices of dimension $d \geq 2$. The unique saddle point configuration is…
We investigate the properties of the Lyman alpha forest as predicted by numerical simulations for a range of currently viable cosmological models. This is done in order to understand the dependencies of the forest on cosmological…
We investigate the behavior of the dichotomy spectrum of nonautonomous linear systems under general growth rates. By introducing comparison criteria we clarify how $\mu$-dichotomy and $\mu$-bounded growth interact. We also study the…
The Contact Process has been studied on complex networks exhibiting different kinds of quenched disorder. Numerical evidence is found for Griffiths phases and other rare region effects, in Erd\H os R\'enyi networks, leading rather…
We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square grid or a row of a hexagonal lattice. We assign the graph…