相关论文: Note on graph-based BCJ relation for Berends-Giele…

We present graph-based translation models which translate source graphs into target strings. Source graphs are constructed from dependency trees with extra links so that non-syntactic phrases are connected. Inspired by phrase-based models,…

We analyze the validity of BCFW recursion relations for currents of n - 2 gluons and two massive quarks, where one of the quarks is off shell and the remaining particles are on shell. These currents are gauge-dependent and can be used as…

We present intermediate results of an ongoing investigation which attempts a generalization of the well known one-loop Bern Kosower rules of Yang-Mills theory to higher loop orders. We set up a general procedure to extract the field…

A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…

We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…

Label noise and long-tailed distributions are two major challenges in distantly supervised relation extraction. Recent studies have shown great progress on denoising, but paid little attention to the problem of long-tailed relations. In…

We systematically study the factorization and recursion relations in higher genus correlation functions of BMN (Berenstein-Maldacena-Nastase) operators in free N=4 super Yang Mills theory. These properties were found in a previous paper by…

Let $G$ be a 3-connected planar graph. Define the co-tree of a spanning tree $T$ of $G$ as the graph induced by the dual edges of $E(G)-E(T)$. The well-known cut-cycle duality implies that the co-tree is itself a tree. Let a $k$-tree be a…

Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…

Recent progress on scattering amplitudes in super Yang--Mills and superstring theory benefitted from the use of multiparticle superfields. They universally capture tree-level subdiagrams, and their generating series solve the non-linear…

These lectures give an introduction to the novel duality relating type IIB string theory in a maximally supersymmetric plane-wave background to N=4, d=4, U(N) Super Yang-Mills theory in a particular large N and large R-charge limit due to…

The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. In this paper, we characterize the connected graphs with given order $n$ and size $m$ that minimize the first degree-based…

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

In this paper we introduce the tied links, i.e. ordinary links provided with some ties between strands. The motivation for introducing such objects originates from a diagrammatical interpretation of the defining generators of the so-called…

It is well-known that the standard BCFW construction cannot be used for on-shell amplitudes in effective field theories due to bad behavior for large shifts. We show how to solve this problem in the case of the SU(N) non-linear sigma model,…

In this article we investigate the structure of uniformly $k$-connected and uniformly $k$-edge-connected graphs. Whereas both types have previously been studied independent of each other, we analyze relations between these two classes. We…

Using algebraic transformations and equivalent reformulations we derive a number of new results from some earlier ones (by the author) in more accepted terms closely related to well-known conjectures of Bondy and Jung including a number of…

The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees. In this paper, we study extremal problems of finding the…

Graph neural networks (GNNs) achieve remarkable success in graph-based semi-supervised node classification, leveraging the information from neighboring nodes to improve the representation learning of target node. The success of GNNs at node…

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…