Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Petrovic, Sonja"'
Autor:
Gvozdanović, Ivan, Petrović, Sonja
We consider the problem of constructing exact goodness-of-fit tests for discrete exponential family models. This classical problem remains practically unsolved for many types of structured or sparse data, as it rests on a computationally difficult co
Externí odkaz:
http://arxiv.org/abs/2405.13950
Autor:
Nagel, Uwe, Petrović, Sonja
In this work, we investigate the presence of the weak Lefschetz property (WLP) and Hilbert functions for various types of random standard graded Artinian algebras. If an algebra has the WLP then its Hilbert function is unimodal. Using probabilistic m
Externí odkaz:
http://arxiv.org/abs/2402.17618
Autor:
Alexandr, Yulia, Bakenhus, Miles, Curiel, Mark, Deshpande, Sameer K., Gross, Elizabeth, Gu, Yuqi, Hill, Max, Johnson, Joseph, Kagy, Bryson, Karwa, Vishesh, Li, Jiayi, Lyu, Hanbaek, Petrović, Sonja, Rodriguez, Jose Israel
Publikováno v:
Alg. Stat. 15 (2024) 357-382
In the last quarter of a century, algebraic statistics has established itself as an expanding field which uses multilinear algebra, commutative algebra, computational algebra, geometry, and combinatorics to tackle problems in mathematical statistics.
Externí odkaz:
http://arxiv.org/abs/2402.13961
We study a colored generalization of the famous simple-switch Markov chain for sampling the set of graphs with a fixed degree sequence. Here we consider the space of graphs with colored vertices, in which we fix the degree sequence and another statis
Externí odkaz:
http://arxiv.org/abs/2402.09568
Autor:
Bakenhus, Miles, Petrović, Sonja
Publikováno v:
Alg. Stat. 15 (2024) 61-83
The set of nonnegative integer lattice points in a polytope, also known as the fiber of a linear map, makes an appearance in several applications including optimization and statistics. We address the problem of sampling from this set using three ingr
Externí odkaz:
http://arxiv.org/abs/2307.02428
Autor:
Jamshidi, Shahrzad, Petrović, Sonja
We define a violator operator which captures the definition of a minimal Gr\"obner basis of an ideal. This construction places the problem of computing a Gr\"obner basis within the framework of violator spaces, introduced in 2008 by G{\"a}rtner, Mato
Externí odkaz:
http://arxiv.org/abs/2306.08279
In this paper, we evaluate the challenges and best practices associated with the Markov bases approach to sampling from conditional distributions. We provide insights and clarifications after 25 years of the publication of the fundamental theorem for
Externí odkaz:
http://arxiv.org/abs/2306.06270
We construct neural network regression models to predict key metrics of complexity for Gr\"obner bases of binomial ideals. This work illustrates why predictions with neural networks from Gr\"obner computations are not a straightforward process. Using
Externí odkaz:
http://arxiv.org/abs/2302.05364
We impose rank one constraints on marginalizations of a tensor, given by a simplicial complex. Following work of Kirkup and Sullivant, such marginal independence models can be made toric by a linear change of coordinates. We study their toric ideals,
Externí odkaz:
http://arxiv.org/abs/2112.10287
Publikováno v:
Scandinavian Journal of Statistics 50.3 (September 2023) 1201-1231
Consider longitudinal networks whose edges turn on and off according to a discrete-time Markov chain with exponential-family transition probabilities. We characterize when their joint distributions are also exponential families with the same paramete
Externí odkaz:
http://arxiv.org/abs/2108.05555