arXiv subjects

Paula Carvalho

Publications and source records attributed to Paula Carvalho.

7 recordsLinked to original sources

arXiv2025

Lexicographic products and lexicographic powers of graphs -- a walk matrix approach

The characteristic polynomial and the spectrum of the lexicographic product of graphs $H[G]$, a specific instance of the generalized composition (also called $H$-join), are explicitly determined for arbitrary graphs $H$ and $G$, in terms of the eigenvalues of $G$ and an $H[G]$ associated matrix $\widetilde{\bf W}$, which relates $H$ with $G$. This study also establishes conditions under which a main eigenvalue of $G$ is a main or non-main eigenvalue of the matrix $\widetilde{\bf W}$, when the nullity of the graph $H$ is $η>0$. In such a case, we prove that every main eigenvalue of $G$ is an eigenvalue of $\widetilde{\bf W}$ with multiplicity at least $η$ which is non-main for $\bf \widetilde{W}$ if and only if $0$ is a non-main eigenvalue of $H$. Furthermore, the spectra of the lexicographic powers of arbitrary graphs $G$ are analysed by applying the obtained results.

math.CO↗

arXiv2021

MINT -- Mainstream and Independent News Text Corpus

Most corpora approach misinformation as a binary problem, classifying texts as real or fake. However, they fail to consider the diversity of existing textual genres and types, which present different properties usually associated with credibility. To address this problem, we created MINT, a comprehensive corpus of news articles collected from mainstream and independent Portuguese media sources, over a full year period. MINT includes five categories of content: hard news, opinion articles, soft news, satirical news, and conspiracy theories. This paper presents a set of linguistic metrics for characterization of the articles in each category, based on the analysis of an annotation initiative performed by online readers. The results show that (i) conspiracy theories and opinion articles present similar levels of subjectivity, and make use of fallacious arguments; (ii) irony and sarcasm are not only prevalent in satirical news, but also in conspiracy and opinion news articles; and (iii) hard news differ from soft news by resorting to more sources of information, and presenting a higher degree of objectivity.

cs.LG↗

arXiv2021

On the Randić energy of caterpillar graphs

A caterpillar graph $T(p_1, \ldots, p_r)$ of order $n= r+\sum_{i=1}^r p_i$, $r\geq 2$, is a tree such that removing all its pendent vertices gives rise to a path of order $r$. In this paper we establish a necessary and sufficient condition for a real number to be an eigenvalue of the Randić matrix of $T(p_1, \ldots, p_r)$. This result is applied to determine the extremal caterpillars for the Randić energy of $T(p_1,\ldots, p_r)$ for cases $r=2$ (the double star) and $r=3$. We characterize the extremal caterpillars for $r=2$. Moreover, we study the family of caterpillars $T\big(p,n-p-q-3,q\big)$ of order $n$, where $q$ is a function of $p$, and we characterize the extremal caterpillars for three cases: $q=p$, $q=n-p-b-3$ and $q=b$, for $b\in \{1,\ldots,n-6\}$ fixed. Some illustrative examples are included.

math.CO↗

arXiv2017

Quantifying Mental Health from Social Media with Neural User Embeddings

Mental illnesses adversely affect a significant proportion of the population worldwide. However, the methods traditionally used for estimating and characterizing the prevalence of mental health conditions are time-consuming and expensive. Consequently, best-available estimates concerning the prevalence of mental health conditions are often years out of date. Automated approaches to supplement these survey methods with broad, aggregated information derived from social media content provides a potential means for near real-time estimates at scale. These may, in turn, provide grist for supporting, evaluating and iteratively improving upon public health programs and interventions. We propose a novel model for automated mental health status quantification that incorporates user embeddings. This builds upon recent work exploring representation learning methods that induce embeddings by leveraging social media post histories. Such embeddings capture latent characteristics of individuals (e.g., political leanings) and encode a soft notion of homophily. In this paper, we investigate whether user embeddings learned from twitter post histories encode information that correlates with mental health statuses. To this end, we estimated user embeddings for a set of users known to be affected by depression and post-traumatic stress disorder (PTSD), and for a set of demographically matched `control' users. We then evaluated these embeddings with respect to: (i) their ability to capture homophilic relations with respect to mental health status; and (ii) the performance of downstream mental health prediction models based on these features. Our experimental results demonstrate that the user embeddings capture similarities between users with respect to mental conditions, and are predictive of mental health.

cs.CL↗

arXiv2015

Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs

Consider two graphs $G$ and $H$. Let $H^k[G]$ be the lexicographic product of $H^k$ and $G$, where $H^k$ is the lexicographic product of the graph $H$ by itself $k$ times. In this paper, we determine the spectrum of $H^k[G]$ and $H^k$ when $G$ and $H$ are regular and the Laplacian spectrum of $H^k[G]$ and $H^k$ for $G$ and $H$ arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic powers of regular graphs, and to the algebraic connectivity and the largest Laplacian eigenvalues in the case of lexicographic powers of arbitrary graphs. This approach allows the determination of the spectrum (in case of regular graphs) and Laplacian spectrum (for arbitrary graphs) of huge graphs. As an example, the spectrum of the lexicographic power of the Petersen graph with the googol number (that is, $10^{100}$) of vertices is determined. The paper finish with the extension of some well known spectral and combinatorial invariant properties of graphs to its lexicographic powers.

math.CO↗

arXiv2015

Computer-assisted independent study in mutivariate calculus

Learning mathematics requires students to work in an independent way which is particularly challenging for such an abstract subject. Advancements in technology and, taking the student as the focus of his own learning, led to a change of paradigm in the design and development of educational contents. In this paper we describe the first experience with an interactive feedback and assessment tool (Siacua), based on parameterized math exercises, and explain how we use it to motivate student independent study in a multivariate calculus environment. We have defined an index about the subject, trying to make it consensual enough for being used in other courses about multivariate calculus. Then we have created a concept map, selected some existing parameterized true/false questions from PmatE project and classified them using our concept map, for being reused in our system. For complementing the course we have created about one hundred parameterized multiple choice question templates in system Megua and generated about one thousand instances for using in Siacua. Results based on data collected by this tool and also based on an informal survey are presented. This first experience allows us to conclude our approach has an important impact on student motivation and contributes to the success on learning multivariate calculus.

math.HO↗

arXiv2013

Extremal graphs for the sum of the two largest signless Laplacian eigenvalues

Let G be a simple graph on $n$ vertices and $e(G)$ edges. Consider $Q(G) = D + A$ as the signless Laplacian of $G$, where $A$ is the adjacency matrix and $D$ is the diagonal matrix of the vertices degree of $G$. Let $q_1(G)$ and $q_2(G)$ be the first and the second largest eigenvalues of $Q(G),$ respectively, and denote by $S_{n}^{+}$ the star graph plus one edge. In this paper, we prove that inequality $q_1(G)+ q_2(G) <= e(G)+3$ is tighter for the graph $S_{n}^{+}$ among all firefly graphs and also tighter to $S_{n}^{+}$ than to the graphs $K_{k} \vee \overline{K_{n-k}}$ recently presented by Ashraf, Omidi and Tayfeh-Rezaie. Also, we conjecture that the same inequality is tighter to $S_{n}^{+}$ than any other graph on $n$ vertices.

math.SP↗