相关论文: Loop Shaping with Scaled Relative Graphs

In this article, we illustrate how the concept of slope limiter can be interpreted graphically, i.e., how the slope of reconstructed piecewise linear function is limited by four bounding lines that connect cell-averaged data and its…

The concept of universality has shaped our understanding of many-body physics, but is mostly limited to homogenous systems. Here, we present a study of universality on a non-homogeneous graph, the long-range diluted graph (LRDG). Its…

The mathematical treatment and graphical representation of Special Relativity (SR) are well established, yet carry deep implications that remain hard to visualize. This paper presents a new graphical interpretation of the geometry of SR…

The linear algorithm of the the full non-linear large scale structure of Gaussian random fields is extended here to to perform non-linear CRs. The procedure consists of: (1) Using linear CR of low resolution data to construct a high…

We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine…

Over the past twenty years, rectangle visibility graphs have generated considerable interest, in part due to their applicability to VLSI chip design. Here we study unit rectangle visibility graphs, with fixed dimension restrictions more…

In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…

We introduce a new operator representing the three-dimensional scalar curvature in loop quantum gravity. The operator is constructed by writing the Ricci scalar classically as a function of the Ashtekar variables and regularizing the…

We establish the conditions under which scalable spin squeezing can be achieved in interacting spin ensembles embedded in arbitrary, inhomogeneous graph geometries. We identify two different forms of squeezing: OAT-like scalable squeezing…

The renormalization group (RG) is a powerful theoretical framework developed to consistently transform the description of configurations of systems with many degrees of freedom, along with the associated model parameters and coupling…

Quantum graphs have recently emerged as models of nonlinear optical, quantum confined systems with exquisite topological sensitivity and the potential for predicting structures with an intrinsic, off-resonance response approaching the…

Recent studies have revealed that GNNs are vulnerable to adversarial attacks. To defend against such attacks, robust graph structure refinement (GSR) methods aim at minimizing the effect of adversarial edges based on node features, graph…

We present a new method for learning Soft Random Geometric Graphs (SRGGs), drawn in probabilistic metric spaces, with the connection function of the graph defined as the marginal posterior probability of an edge random variable, given the…

GR can be interpreted as a theory of evolving 3-geometries. A recent such formulation, the 3-space approach of Barbour, Foster and \'{O} Murchadha, also permits the construction of a limited number of other theories of evolving…

The failure of roughness parameters to predict surface properties stems from their inherent scale-dependence; in other words, the measured value depends on the way it was measured. Here we take advantage of this scale-dependence to develop…

A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…

Strongly regular graphs (SRGs) are highly symmetric combinatorial objects, with connections to many areas of mathematics including finite fields, finite geometries, and number theory. One can construct an SRG via the Cayley Graph of a…

We study nonconvex finite-sum problems and analyze stochastic variance reduced gradient (SVRG) methods for them. SVRG and related methods have recently surged into prominence for convex optimization given their edge over stochastic gradient…

This paper introduces layout-aware graph modeling for multimodal RAG. Different from traditional RAG methods that mostly deal with flat text chunks, the proposed method takes into account the relationship of multimodalities by using a graph…

A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…