English
Related papers

Related papers: Embedding Unicritical Connectedness Loci

200 papers

Link prediction plays an important role in network analysis and applications. Recently, approaches for link prediction have evolved from traditional similarity-based algorithms into embedding-based algorithms. However, most existing…

Social and Information Networks · Computer Science 2020-08-11 Lei Wang , Jing Ren , Bo Xu , Jianxin Li , Wei Luo , Feng Xia

It was previously shown that at critical central charge, $N$-extended superstrings can be embedded in $(N+1)$-extended superstrings. In other words, $(N=0,c=26)\to (N=1,c=15)\to (N=2,c=6)\to (N=3,c=0) \to (N=4,c=0) $. In this paper, we show…

High Energy Physics - Theory · Physics 2009-10-28 Nathan Berkovits , Nobuyoshi Ohta

Network embedding methods aim at learning low-dimensional latent representation of nodes in a network. While achieving competitive performance on a variety of network inference tasks such as node classification and link prediction, these…

Social and Information Networks · Computer Science 2018-09-17 Haochen Chen , Xiaofei Sun , Yingtao Tian , Bryan Perozzi , Muhao Chen , Steven Skiena

This is the sequel to our first paper concerning the balanced embedding of a non-compact complex manifold into an infinite-dimensional projective space. We prove the uniqueness of such an embedding. The proof relies on fine estimates of the…

Complex Variables · Mathematics 2023-11-21 Jingzhou Sun

Histopolation is the approximation procedure that associates a degree $ d-1 $ polynomial $ p_{d-1} \in \mathscr{P}_{d-1} (I) $ with a locally integrable function $ f $ imposing that the integral (or, equivalently, the average) of $p$…

Numerical Analysis · Mathematics 2026-03-26 Ludovico Bruni Bruno , Stefano Serra-Capizzano

Knowledge graph embedding is a representation learning technique that projects entities and relations in a knowledge graph to continuous vector spaces. Embeddings have gained a lot of uptake and have been heavily used in link prediction and…

Artificial Intelligence · Computer Science 2022-07-14 Jan Portisch , Heiko Paulheim

The central object studied in this paper is a multiplier bimonoid in a braided monoidal category C. Adapting the philosophy of Janssen and Vercruysse, and making some mild assumptions on the category C, we consider a category M whose…

Category Theory · Mathematics 2019-07-08 Gabriella Böhm , Stephen Lack

Existing network embedding approaches tackle the problem of learning low-dimensional node representations. However, networks can also be seen in the light of edges interlinking pairs of nodes. The broad goal of this paper is to introduce…

Social and Information Networks · Computer Science 2020-11-12 Giuseppe Pirrò

Let n >= 1 and let p be a prime. Let t = 1 - zeta_{p^n}. Expand an integer j in [0,p^n-1], coprime to p, p-adically as j = sum_{s >= 0} a_s p^s. Denote the tensor product over Z_(p) by o . Then the #([0,j] - (p))th Z_(p)[t]-linear…

Number Theory · Mathematics 2007-05-23 Harald Weber , Matthias Kuenzer

We present a classification of the so-called "additive symmetric 2-cocycles" of arbitrary degree and dimension over Z/p, along with a partial result and some conjectures for m-cocycles over Z/p, m > 2. This expands greatly on a result…

Commutative Algebra · Mathematics 2008-11-26 Adam Hughes , JohnMark Lau , Eric Peterson

In this work, it is shown that the category XMod/P of crossed modules over fixed group P is an exact category and the complete proof of the embedding theorem of XMod/P into a set valued functor category is given.

Category Theory · Mathematics 2016-11-26 Ummahan Ege Arslan , GÜlÜmsen Onarli

Geometric approaches to network analysis combine simply defined models with great descriptive power. In this work we provide a method for embedding directed acyclic graphs into Minkowski spacetime using Multidimensional scaling (MDS). First…

Physics and Society · Physics 2017-11-09 James R. Clough , Tim S. Evans

Learning positional information of nodes in a graph is important for link prediction tasks. We propose a representation of positional information using representative nodes called landmarks. A small number of nodes with high degree…

Artificial Intelligence · Computer Science 2024-04-22 Minsang Kim , Seungjun Baek

Let $K$ be an algebraically closed field of characteristic zero, and for $c \in K$ and an integer $d \ge 2$, define $f_{d,c}(z) := z^d + c \in K[z]$. We consider the following question: If we fix $x \in K$ and integers $M \ge 0$, $N \ge 1$,…

Dynamical Systems · Mathematics 2021-08-12 John R. Doyle

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $\Delta^0_\alpha$ bi-embeddable categoricity, and degrees of…

Logic · Mathematics 2021-03-16 Nikolay Bazhenov , Ekaterina Fokina , Dino Rossegger , Luca San Mauro

For an ideal $I_{m,n}$ generated by all square-free monomials of degree $m$ in a polynomial ring $R$ with $n$ variables, we obtain a specific embedding of a canonical module of $R/I_{m,n}$ to $R/I_{m,n}$ itself. The construction of this…

Commutative Algebra · Mathematics 2017-04-12 Ela Celikbas , Jai Laxmi , Jerzy Weyman

We study Goodwillie-Weiss embedding calculus through its relationship with Goodwillie's functor calculus. Specifically, building on a result of Tillmann and Weiss, we construct a functorial complement for \(T_{n}\)-embeddings that takes…

Geometric Topology · Mathematics 2025-11-07 Hyeonhee Jin

We give a geometric description of the parabolic bifurcation locus in the space $\operatorname{Rat}_d$ of all rational functions on $\mathbb{P}^1$ of degree $d>1$, generalizing the study by Morton and Vivaldi in the case of monic…

Algebraic Geometry · Mathematics 2024-01-05 Yûsuke Okuyama

Let $(a,a+d,a+2d)$ be an arithmetic progression of positive integers. The following statements are proved: (1) If $a\mid 2d$, then $(a, a+d, a+2d)\in\mdeg(\Tame(\mathbb{C}^3))$. (2) If $a\nmid 2d$, then, except for arithmetic progressions…

Commutative Algebra · Mathematics 2011-12-30 Jiantao Li , Xiankun Du

Consider a network with $N$ nodes in $d$-dimensional Euclidean space, and $M$ subsets of these nodes $P_1,\cdots,P_M$. Assume that the nodes in a given $P_i$ are observed in a local coordinate system. The registration problem is to compute…

Networking and Internet Architecture · Computer Science 2019-06-25 Aditya V. Singh , Kunal N. Chaudhury