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

Broadcasting in a computer network is a method of transferring a message to all recipients simultaneously. It is common in this situation to use a tree with many leaves to perform the broadcast, as internal nodes have to forward the…

We consider a discrete-time dynamical process on graphs, firstly introduced in connection with a protocol for controlling large networks of spin 1/2 quantum mechanical particles [Phys. Rev. Lett. 99, 100501 (2007)]. A description is as…

We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…

We implement a version of conformal field theory (CFT) that gives a connection to SLE in a multiply connected domain. Our approach is based on the Gaussian free field and applies to CFTs with central charge $c \leq 1$. In this framework we…

We study the convergence of the predictive surface of regression trees and forests. To support our analysis we introduce a notion of adaptive concentration for regression trees. This approach breaks tree training into a model selection…

Assign i.i.d. standard exponential edge weights to the edges of the complete graph K_n, and let M_n be the resulting minimum spanning tree. We show that M_n converges in the local weak sense (also called Aldous-Steele or Benjamini-Schramm…

The weight of the minimum spanning tree in a complete weighted graph with random edge weights is a well-known problem. For various classes of distributions, it is proved that the weight of the minimum spanning tree tends to a constant,…

We investigate the effect of strain along armchair and zigzag directions on electrical transport in graphene through a magnetic barrier and a linearly polarized electromagnetic wave. In the context of Floquet theory, the eigenvalues and…

With applications in distribution systems and communication networks, the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized. The…

The transmission of correlated electrons through a domain wall in ferromagnetic quasi-one-dimensional systems is studied theoretically in the case when the domain wall width is comparable with the Fermi wavelength of the charge carriers.…

Graph Domain Adaptation (GDA) aims to bridge distribution shifts between domains by transferring knowledge from well-labeled source graphs to given unlabeled target graphs. One promising recent approach addresses graph transfer by…

Three-dimensional (3D) metals/semimetals under magnetic field have an instability toward a density wave (DW) ordering which breaks a translational symmetry along the field direction. Effective boson models for the DW phases take forms of XY…

Given a directed simple graph G=(V,E) and a nonnegative-valued cost function the power of a vertex u in a directed spanning subgraph H is given by the maximum cost of an arcs of H exiting u. The power of H is the sum of the power of its…

We propose associative domain adaptation, a novel technique for end-to-end domain adaptation with neural networks, the task of inferring class labels for an unlabeled target domain based on the statistical properties of a labeled source…

Transport properties of 2D materials especially close to their boundary has received much attention after the successful fabrication of graphene and other fascinating materials afterwards. While most previous work is devoted to the…

Fractional D6-branes on toroidal orbifold backgrounds are known to be able to accommodate the particle spectrum and gauge group of the Standard Model, but up to now exact results for their low-energy effective action are missing. Here we…

Mean field theory models of percolation on networks provide analytic estimates of network robustness under node or edge removal. We introduce a new mean field theory model based on generating functions that includes information about the…

Existing adversarial domain adaptation methods mainly consider the marginal distribution and these methods may lead to either under transfer or negative transfer. To address this problem, we present a self-adaptive re-weighted adversarial…

The transmission across a graphene bilayer region is calculated for two different types of connections to monolayer leads. A transfer matrix algorithm based on a tight binding model is developed to obtain the ballistic transmission beyond…

We derive the superconformal transformation properties of the supercurrent for N=1 supersymmetric QED in four dimensions within the superfield formalism. Superconformal Ward identities for Green functions involving insertions of the…