相关论文: The 2d-directed spanning forest converges to the B…
Let $D$ be a multidigraph. We study the simplicial complex $\mathrm{Dlf}(D)$, whose vertices are the directed edges of $D$ and whose faces correspond to directed linear forests, that is, vertex-disjoint unions of directed paths. We also…
We investigate the directed random walk on hierarchic trees. Two cases are investigated: random variables on deterministic trees with a continuous branching, and random variables on the trees constructed trough the random branching process.…
We provide a new construction of Brownian disks in terms of forests of continuous random trees equipped with nonnegative labels corresponding to distances from a distinguished point uniformly distributed on the boundary of the disk. This…
Random forests on the one hand, and neural networks on the other hand, have met great success in the machine learning community for their predictive performance. Combinations of both have been proposed in the literature, notably leading to…
We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an…
In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power of the distance between…
We study the contact process on spatially embedded networks, consisting of a regular square lattice with long-range connections. To generate the networks, a long-range connection is randomly added to each node $i$ of a square lattice,…
We iterate Manolescu's unoriented skein exact triangle in knot Floer homology with coefficients in the field of rational functions over $\mathbb{Z}/2\mathbb{Z}$. The result is a spectral sequence which converges to a stabilized version of…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
In this paper, the time-varying formation and time-varying formation tracking problems are solved for linear multi-agent systems over digraphs without the knowledge of the eigenvalues of the Laplacian matrix associated to the digraph. The…
Hypergraphs provide a natural way to represent higher-order interactions among multiple entities. While undirected hypergraphs have been extensively studied, the case of directed hypergraphs, which can model oriented group interactions,…
A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…
The two-species symbiotic contact process (2SCP) is a stochastic process where each vertex of a graph may be vacant or host at most one individual of each species. Vertices with both species have a reduced death rate, representing a…
Methods based on Bayesian decision tree ensembles have proven valuable in constructing high-quality predictions, and are particularly attractive in certain settings because they encourage low-order interaction effects. Despite adapting to…
For real world systems, nonuniform medium is ubiquitous. Therefore, we investigate the diffusion-limited-aggregation process on a two dimensional directed small-world network instead of regular lattice. The network structure is established…
We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…
The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation…
We study conformal field theory in $d=1$ space-time dimensions. We derive a dispersion relation for the 4-point correlation function of identical bosons and fermions, in terms of the double discontinuity. This extends the conformal…
We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set $S$ has size at least the number of vertices in the tree. For the special case where the tree is a path $P$ we show that: (a)…
In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the Crofton cell of the Poisson hyperplane…