Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Bolla Marianna"'
Publikováno v:
Special Matrices, Vol 10, Iss 1, Pp 394-416 (2022)
We discuss spectral clustering from a variety of perspectives that include extending techniques to rectangular arrays, considering the problem of discrepancy minimization, and applying the methods to directed graphs. Near-optimal clusters can be obta
Externí odkaz:
https://doaj.org/article/00496577c17b43de9cb7bf677621358d
Publikováno v:
Special Matrices, Vol 9, Iss 1, Pp 36-51 (2021)
Given a weakly stationary, multivariate time series with absolutely summable autocovariances, asymptotic relation is proved between the eigenvalues of the block Toeplitz matrix of the first n autocovariances and the union of spectra of the spectral d
Externí odkaz:
https://doaj.org/article/cf640f32dbd34ec2a419efbb29348dfe
Autor:
Bolla, Marianna, Zhou, Daniel
Whereas Laplacian and modularity based spectral clustering is apt to dense graphs, recent results show that for sparse ones, the non-backtracking spectrum is the best candidate to find assortative clusters of nodes. Here belief propagation in the spa
Externí odkaz:
http://arxiv.org/abs/2307.16502
Autor:
Bolla Marianna, Elbanna Ahmed
Publikováno v:
Special Matrices, Vol 4, Iss 1 (2016)
We will discuss how graph based matrices are capable to find classification of the graph vertices with small within- and between-cluster discrepancies. The structural eigenvalues together with the corresponding spectral subspaces of the normalized mo
Externí odkaz:
https://doaj.org/article/e06e946dd7514ea6b1df7313390b6986
Autor:
Bolla, Marianna, Ye, Dongze, Wang, Haoyu, Ma, Renyuan, Frappier, Valentin, Thompson, William, Donner, Catherine, Baranyi, Máté, Abdelkhalek, Fatma
A causal vector autoregressive (CVAR) model is introduced for weakly stationary multivariate processes, combining a recursive directed graphical model for the contemporaneous components and a vector autoregressive model longitudinally. Block Cholesky
Externí odkaz:
http://arxiv.org/abs/2211.14203
Spectral clustering is discussed from many perspectives, by extending it to rectangular arrays and discrepancy minimization too. Near optimal clusters are obtained with singular value decomposition and with the weighted $k$-means algorithm. In case o
Externí odkaz:
http://arxiv.org/abs/2112.10637
We introduce a directed, weighted random graph model, where the edge-weights are independent and beta-distributed with parameters depending on their endpoints. We will show that the row- and column-sums of the transformed edge-weight matrix are suffi
Externí odkaz:
http://arxiv.org/abs/1707.08904
Autor:
Baranyi, Máté, Bolla, Marianna
Publikováno v:
In Econometrics and Statistics October 2021 20:131-152