相关论文: Geometry of the uniform spanning forest components…

We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments…

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…

We give a new construction of the uniform infinite half-planar quadrangulation with a general boundary (or UIHPQ), analogous to the construction of the UIPQ presented by Chassaing and Durhuus, which allows us to perform a detailed study of…

The present lecture notes give an introduction to works of Garc\'{i}a Barroso, Gonz\'alez P\'erez, Ruggiero and the author. The starting point of those works is a theorem of P\l oski, stating that one defines an ultrametric on the set of…

We investigate a network model based on an infinite regular square lattice embedded in the Euclidean plane where the node connection probability is given by the geometrical distance of nodes. We show that the degree distribution in the…

One cannot yet point to any firm string prediction. While many approximate string ground states are known with interesting properties, we do not have any argument that one or another describes what we observe around us, and for reasons…

Spanners for metric spaces have been extensively studied, both in general metrics and in restricted classes, perhaps most notably in low-dimensional Euclidean spaces -- due to their numerous applications. Euclidean spanners can be viewed as…

Various different random graph models have been proposed in which the vertices of the graph are seen as members of a metric space, and edges between vertices are determined as a function of the distance between the corresponding metric…

We study the influence of the seed in random trees grown according to the uniform attachment model, also known as uniform random recursive trees. We show that different seeds lead to different distributions of limiting trees from a total…

We prove that any graph $G$ with $n$ points has a distribution $\mathcal{T}$ over spanning trees such that for any edge $(u,v)$ the expected stretch $E_{T \sim \mathcal{T}}[d_T(u,v)/d_G(u,v)]$ is bounded by $\tilde{O}(\log n)$. Our result…

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…

Just how many different connected shapes result from slicing a cube along some of its edges and unfolding it into the plane? In this article we answer this question by viewing the cube both as a surface and as a graph of vertices and edges.…

A spanning subgraph $F$ of a graph $G$ is called perfect if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. We provide a short proof of the following theorem of A.D.…

Let $G = (V,E)$ denote a simple graph with the vertex set $V$ and the edge set $E$. The profile of a vertex set $V'\subseteq V$ denotes the multiset of pairwise distances between the vertices of $V'$. Two disjoint subsets of $V$ are…

We study a family of tree-type diagrams that arise in studies of the cumulant expansion in discrete Erd\H os-R\'enyi random matrix models. Using a version of the Pr\" ufer code, we obtain an explicit expression for the number of tree-type…

We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…

The properties of scale-free random trees are investigated using both preconditioning on non-extinction and fixed size averages, in order to study the thermodynamic limit. The scaling form of volume probability is found, the connectivity…

The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…

Based on solid theoretical foundations, we present strong evidences that a number of real-life networks, taken from different domains like Internet measurements, biological data, web graphs, social and collaboration networks, exhibit…