中文
相关论文

相关论文: Asymptotic Degree of Random Monomial Ideals

200 篇论文

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. Also, we compute the quasi-depth of several classes of square free monomial ideals.…

交换代数 · 数学 2017-11-06 Mircea Cimpoeas

In this paper, we study the joint behaviour of the degree, depth and label of and graph distance between high-degree vertices in the random recursive tree. We generalise the results obtained by Eslava and extend these to include the labels…

概率论 · 数学 2023-01-31 Bas Lodewijks

Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive…

交换代数 · 数学 2011-06-07 Rachelle R. Bouchat , Huy Tai Ha , Augustine O'Keefe

Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…

统计力学 · 物理学 2009-10-31 M. E. J. Newman , S. H. Strogatz , D. J. Watts

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

概率论 · 数学 2007-05-23 Anna Rudas , Balint Toth , Benedek Valko

We analyze the asymptotic behavior of the degree sequence of Random Apollonian Networks \cite{maximal}. For previous weaker results see \cite{comment,maximal}.

社会与信息网络 · 计算机科学 2011-06-13 Charalampos E. Tsourakakis

Let $I$ be a monomial ideal in a polynomial ring. In this paper, we study the asymptotic behavior of the set of associated radical ideals of the (symbolic) powers of $I$. We show that both $\asr(I^s)$ and $\asr(I^{(s)})$ need not stabilize…

交换代数 · 数学 2024-12-20 Nguyen Thu Hang , Truong Thi Hien

In this paper, we study the differential power operation on ideals. We begin with a focus on monomial ideals in characteristic 0 and find a class of ideals whose differential powers are eventually principal. We also study the containment…

We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…

概率论 · 数学 2014-11-10 Ágnes Backhausz , Tamás F. Móri

Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…

交换代数 · 数学 2013-07-12 Oana Olteanu

A probabilistic generative network model with $n$ nodes and $m$ overlapping layers is obtained as a superposition of $m$ mutually independent Bernoulli random graphs of varying size and strength. When $n$ and $m$ are large and of the same…

概率论 · 数学 2021-06-01 Mindaugas Bloznelis , Joona Karjalainen , Lasse Leskelä

We provide optimal rates of convergence to the asymptotic distribution of the (properly scaled) degree of a fixed vertex in two preferential attachment random graph models. Our approach is to show that these distributions are unique fixed…

概率论 · 数学 2013-03-15 Erol A. Peköz , Adrian Röllin , Nathan Ross

Let $I$ be a graded ideal of a standard graded polynomial ring $S$ with coefficients in a field $K$. The asymptotic behaviour of the $\text{v}$-number of the powers of $I$ is investigated. Natural lower and upper bounds which are linear…

交换代数 · 数学 2023-10-10 Antonino Ficarra , Emanuele Sgroi

In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…

交换代数 · 数学 2011-10-13 Hailong Dao , Craig Huneke , Jay Schweig

The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry -- the property that many paths going out from a vertex have overlapping…

数据分析、统计与概率 · 物理学 2007-05-23 Petter Holme

In [3] Borzellino and Brunsden started to develop an elementary differential topology theory for orbifolds. In this paper we carry on their project by defining a mapping degree for proper maps between orbifolds, which counts preimages of…

几何拓扑 · 数学 2019-07-05 Federica Pasquotto , Thomas O. Rot

We provide explicit formulas for key invariants of special fiber rings of ladder determinantal modules, that is, modules that are direct sums of ideals of maximal minors of a ladder matrix. Our results are given in terms of the…

We investigate the asympotic behaviour of the moduli space of morphisms from the rational curve to a given variety when the degree becomes large. One of the crucial tools is the homogeneous coordinate ring of the variey. First we explain in…

代数几何 · 数学 2011-07-20 David Bourqui

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

交换代数 · 数学 2025-11-11 Ezra Miller