相关论文: Spanning forests on the Sierpinski gasket

We compute the total number of spanning trees for the generalized cone of the complete graph $K_n$ and a number of families of some modified bipartite graphs $K_{m,n}$. In particular, we obtain a new method of finding the number of spanning…

We investigate the asymptotic behavior, as $N$ grows, of the largest minimal pairwise distance of $N$ points restricted to an arbitrary compact rectifiable set embedded in Euclidean space, and we find the limit distribution of such optimal…

In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow to infinity. Moreover, we provide, for each of the variants,…

We investigate the distributions of subtrees connecting several vertices in \kappa-biased spanning forests of the complete graph K_N and their asymptotics and identify a phase transition at \kappa=O(\sqrt N)

We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…

Let $T(G)$ be the size of the largest induced tree of $G$, and let $G_{n,p}$ be the binomial random graph. Kamaldinov, Skorkin, and Zhukovskii proved that $T(G_{n,p})$ equals one of two consecutive values with high probability if $p$ is…

We address the problem of evaluating the number $S_N(t)$ of distinct sites visited up to time t by N noninteracting random walkers all initially placed on one site of a deterministic fractal lattice. For a wide class of fractals, of which…

In the present paper, we investigate a family of circulant graphs with non-fixed jumps $$G_n=C_{\beta n}(s_1, \ldots,s_k,\alpha_1n,\ldots,\alpha_\ell n),\, 1\le s_1<\ldots<s_k\le[\frac{\beta n}{2}],\, 1\le \alpha_1<…

We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in…

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…

We develop a first-principle approach to compute the counting statistics in the ground-state of $N$ noninteracting spinless fermions in a general potential in arbitrary dimensions $d$ (central for $d>1$). In a confining potential, the Fermi…

We prove a coisotropic intersection result and deduce the following: 1. Lower bounds on the displacement energy of a subset of a symplectic manifold, in particular a sharp stable energy-Gromov-width inequality. 2. A stable non-squeezing…

If we are given $n$ random points in the hypercube $[0,1]^d$, then the minimum length of a Traveling Salesperson Tour through the points, the minimum length of a spanning tree, and the minimum length of a matching, etc., are known to be…

We analytically compute asymptotic expansions of a 1-dimensional sub-manifold of stable and unstable manifolds in a 4-dimensional symplectic mapping by using the method called asymptotic expansions beyond all orders. This method enables us…

Starting from any graph on $\{1, \ldots, n\}$, consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected to another uniformly chosen vertex. This Markov chain has a…

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 derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…

The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices $\beta n$, and in the $n$-th and $(n-1)$-th power graphs of the $\beta n$-cycle are evaluated as a product of…

This paper studies presentations of the Sierpinski gasket as a final coalgebra for functors on several categories of metric spaces with additional designated points. The three categories which we study differ on their morphisms: one uses…

We prove the existence of a strongly local, regular, self-similar Dirichlet form with a sub-Gaussian heat kernel estimate on an unconstrained Sierpinski carpet in $\mathbb{R}^3$. In the setting under consideration, the walk dimension $d_W$…