Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Stasi, Despina"'
Many popular models from the networks literature can be viewed through a common lens of contingency tables on network dyads, resulting in \emph{log-linear ERGMs}: exponential family models for random graphs whose sufficient statistics are linear on t
Externí odkaz:
http://arxiv.org/abs/2104.03167
Publikováno v:
J. Softw. Alg. Geom. 9 (2019) 65-70
The {\tt Macaulay2} package {\tt RandomMonomialIdeals} provides users with a set of tools that allow for the systematic generation and study of random monomial ideals. It also introduces new objects, Sample and Model, to allow for streamlined handlin
Externí odkaz:
http://arxiv.org/abs/1711.10075
Multiple root estimation problems in statistical inference arise in many contexts in the literature. In the context of maximum likelihood estimation, the existence of multiple roots causes uncertainty in the computation of maximum likelihood estimato
Externí odkaz:
http://arxiv.org/abs/1702.04477
Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the probability distribu
Externí odkaz:
http://arxiv.org/abs/1701.07130
We introduce a new graph parameter, the hydra number, arising from the minimization problem for Horn formulas in propositional logic. The hydra number of a graph $G=(V,E)$ is the minimal number of hyperarcs of the form $u,v\rightarrow w$ required in
Externí odkaz:
http://arxiv.org/abs/1504.07753
This paper transfers a randomized algorithm, originally used in geometric optimization, to computational problems in commutative algebra. We show that Clarkson's sampling algorithm can be applied to two problems in computational algebra: solving larg
Externí odkaz:
http://arxiv.org/abs/1503.08804
The $k$-core decomposition is a widely studied summary statistic that describes a graph's global connectivity structure. In this paper, we move beyond using $k$-core decomposition as a tool to summarize a graph and propose using $k$-core decompositio
Externí odkaz:
http://arxiv.org/abs/1410.7357
Autor:
De Loera, Jesús A., Margulies, Susan, Pernpeintner, Michael, Riedl, Eric, Rolnick, David, Spencer, Gwen, Stasi, Despina, Swenson, Jon
We revisit a well-known family of polynomial ideals encoding the problem of graph-$k$-colorability. Our paper describes how the inherent combinatorial structure of the ideals implies several interesting algebraic properties. Specifically, we provide
Externí odkaz:
http://arxiv.org/abs/1410.6806
We introduce the beta model for random hypergraphs in order to represent the occurrence of multi-way interactions among agents in a social network. This model builds upon and generalizes the well-studied beta model for random graphs, which instead on
Externí odkaz:
http://arxiv.org/abs/1407.1004
Social networks and other large sparse data sets pose significant challenges for statistical inference, as many standard statistical methods for testing model fit are not applicable in such settings. Algebraic statistics offers a theoretically justif
Externí odkaz:
http://arxiv.org/abs/1401.4896