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

Stochastic networks based on random point sets as nodes have attracted considerable interest in many applications, particularly in communication networks, including wireless sensor networks, peer-to-peer networks and so on. The study of…

Tensor networks and circuits are widely used data structures to represent pseudo-Boolean functions. These two formalisms have been studied primarily in separate communities, and this paper aims to establish equivalences between them. We…

Transductive tasks on graphs differ fundamentally from typical supervised machine learning tasks, as the independent and identically distributed (i.i.d.) assumption does not hold among samples. Instead, all train/test/validation samples are…

We present a Ward identity for nonlinear sigma models using generalized nonlinear shift symmetries, without introducing current algebra or coset space. The Ward identity constrains correlation functions of the sigma model such that the…

We introduce a Markov Chain Monte Carlo algorithm which samples from the space of spanning trees of complete graphs using local rewiring operations only. The probability distribution of graphs of this kind is shown to depend on the…

This work describes probabilistic methods for utilizing random spanning trees generated via a random walk process. Goyal et al. showed that the union of random spanning trees approximates the expansion of every cut of a graph. First, we…

A novel approach for non-intrusive uncertainty propagation is proposed. Our approach overcomes the limitation of many traditional methods, such as generalised polynomial chaos methods, which may lack sufficient accuracy when the quantity of…

We address here spanning tree problems on a graph with binary edge weights. For a general weighted graph the minimum spanning tree is solved in super-linear running time, even when the edges of the graph are pre-sorted. A related problem,…

Various graph products and operations have been widely used to construct complex networks with common properties of real-life systems. However, current works mainly focus on designing models of binary networks, in spite of the fact that…

This thesis describes an attempt to write down covariant actions for coincident D-branes using so-called boundary fermions instead of matrices to describe the non-abelian fields. These fermions can be thought of as Chan-Paton degrees of…

A transfer matrix approach to study ballistic charge transport in few-layer graphene with chiral-symmetric stacking configurations is developed. We demonstrate that the chiral symmetry justifies a non-Abelian gauge transformation at the…

In this paper we study integer multiplicity rectifiable currents carried by the subgradient (subdifferential) graphs of semi-convex functions on a $n$-dimensional convex domain, and show a weak continuity theorem with respect to pointwise…

Perturbing transition rates in a steady nonequilibrium system, e.g. modelled by a Markov jump process, causes a change in the local currents. Their susceptibility is usually expressed via Green-Kubo relations or their nonequilibrium…

We establish that if a sequence of electrical networks equipped with conductance measures converges in the local Gromov--Hausdorff-vague topology and satisfies certain non-explosion and metric-entropy conditions,then the sequence of…

Let $G$ be a connected graph with adjacency matrix $A(G)$. The distance matrix $D(G)$ of $G$ has rows and columns indexed by $V(G)$ with $uv$-entry equal to the distance $\mathrm{dist}(u,v)$ which is the number of edges in a shortest path…

A matrix model describing surfaces embedded in a Bethe lattice is considered. From the mean field point of view, it is equivalent to the Kazakov-Migdal induced gauge theory and therefore, at $N=\infty$ and $d>1$, the latter can be…

Modeling power transmission networks is an important area of research with applications such as vulnerability analysis, study of cascading failures, and location of measurement devices. Graph-theoretic approaches have been widely used to…

McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…

It is shown that for any positive integer n there exists a subnormal weighted shift on a directed tree whose nth power is closed and densely defined while its (n + 1)th power has trivial domain. Similar result for composition operators in…

Motivated by recent experiments of successfully carving out stable carbon atomic chains from graphene, we investigate a device structure of a carbon chain connecting two zigzag graphene nanoribbons with highly tunable spin-dependent…