相关论文: Transfer current and pattern fields in spanning tr…

The transfer-matrix of U(1) lattice gauge theory is investigated in the field Fourier space, the basis of which consists of the quantized currents on lattice links. Based on a lattice version of the current conservation, the transfer-matrix…

Getting deep convolutional neural networks to perform well requires a large amount of training data. When the available labelled data is small, it is often beneficial to use transfer learning to leverage a related larger dataset (source) in…

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…

We investigate properties of several string networks in $D < 10$ which carry electric currents as well as electrostatic charge densities. We show the electric-current conservations as well as the force-balance condition of the string…

Based on previous work of the authors, to any $S$-adic development of a subshift $X$ a "directive sequence" of commutative diagrams is associated, which consists at every level $n \geq 0$ of the measure cone and the letter frequency cone of…

This article investigates the topological pressure of isotropic axial products of Markov subshifts on the $d$-tree. We show that the quantity increases with dimension $d$. To achieve this, we introduce the pattern distribution vectors and…

We consider random walk on a mildly random environment on finite transitive d- regular graphs of increasing girth. After scaling and centering, the analytic spectrum of the transition matrix converges in distribution to a Gaussian noise. An…

We consider the minimum spanning tree problem in a setting where the edge weights are stochastic from unknown distributions, and the only available information is a single sample of each edge's weight distribution. In this setting, we…

A measure is derived to quantify directed information transfer between pairs of vertices in a weighted network, over paths of a specified maximal length. Our approach employs a general, probabilistic model of network traffic, from which the…

We study shortest paths and spanning trees of complex networks with random edge weights. Edges which do not belong to the spanning tree are inactive in a transport process within the network. The introduction of quenched disorder modifies…

We address the problem of unsupervised domain adaptation under the setting of generalized target shift (joint class-conditional and label shifts). For this framework, we theoretically show that, for good generalization, it is necessary to…

This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a…

The semi-streaming model is a variant of the streaming model frequently used for the computation of graph problems. It allows the edges of an $n$-node input graph to be read sequentially in $p$ passes using $\tilde{O}(n)$ space. In this…

Scattering amplitudes in $d+2$ dimensions can be expressed in terms of a conformal basis, for which the S-matrix behaves as a CFT correlation function on the celestial $d$-sphere. We explain how compact expressions for the full tree-level…

We extend the conventional transfer matrix method to include anisotropic features for electron transmission in two-dimensional materials, such as breaking reflection law in pseudo-spin phases and wave vectors. This method allows to study…

We give a new simple construction of the sandpile measure on an infinite graph G, under the sole assumption that each tree in the Wired Uniform Spanning Forest on G has one end almost surely. For, the so called, generalized minimal…

Constructing the maximum spanning tree $T$ of an edge-weighted connected graph $G$ is one of the important research topics in computer science and optimization, and the related research results have played an active role in practical…

In the framework of the many-electron s-d exchange model and Hubbard model, self-consistent equations are derived for the one-particle retarded Green's function in the many-electron Hubbard X-operator representation. We analyze the general…

In linear perturbation theory, all information about the growth of structure is contained in the Green's function, or equivalently, transfer function. These functions are generally computed using numerical codes or by phenomenological…