2020
DOI: 10.1109/lsp.2020.3005053
|View full text |Cite
|
Sign up to set email alerts
|

A Joint Markov Model for Communities, Connectivity and Signals Defined Over Graphs

Abstract: Real-world networks are typically described in terms of nodes, links, and communities, having signal values often associated with them. The aim of this paper is to introduce a novel Compound Markov random field model (Compound MRF, or CMRF) for signals defined over graphs, encompassing jointly signal values at nodes, edge weights, and community labels. The proposed CMRF generalizes Markovian models previously proposed in the literature, since it accounts for different kinds of interactions between communities … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1
1

Relationship

3
3

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…The numerical experiments are conducted in Matlab. Specifically, we implemented the model in [21], we equipped it with the community mining library in [25], and particularized it with the above defined clique potential function. Then, we the prediction to the different databases in Table 2, considering 10 Montecarlo runs.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The numerical experiments are conducted in Matlab. Specifically, we implemented the model in [21], we equipped it with the community mining library in [25], and particularized it with the above defined clique potential function. Then, we the prediction to the different databases in Table 2, considering 10 Montecarlo runs.…”
Section: Resultsmentioning
confidence: 99%
“…To solve this problem, we resort to the aforementioned Markovian SoG model [21], which relates the graph edges on the protein network with the local connectivity features of the associated pair of nodes. Thus, the Maximum a Posteriori estimate of the unknown coefficients a ij ∈ S a is by min- imization of the potential function U (S x , S γ , S a ).…”
Section: Stage 3: Map Estimation For the Markovian Sogmentioning
confidence: 99%
See 2 more Smart Citations
“…GSP has a number of relevant applications, from spatiotemporal analysis of brain data [193]; to analyze vulnerabilities in power grid data [194]; to topological data analysis [195], chemoinformatics [196] and single cell transcriptomic analysis [197], to mention but a few examples. Statistical learning techniques have also being founded on a combination of MRFs and GSP [198,199], taking advantage of both the networked structure, the statistical dependence relationships and the temporal correlations of the signals [200][201][202]. Random field approaches to GSP have also been applied in the context of deep convolutional networks [203,204], often invoking features of the underlying joint conditional probability distributions such as ergodicity [205] and stationarity [206].…”
Section: Random Fields and Graph Signal Theorymentioning
confidence: 99%