Anthony Perez

Dr. Anthony Perez


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 February 2012 in Algorithmica
Verified
Journal Article
Closed access
PDF file
SGSylvain Guillemot
Sylvain Guillemot
FHFrédéric Havet
Frédéric Havet
CPChristophe Paul
Christophe Paul
APAnthony Perez
Anthony Perez

11 March 2014 in Social Network Analysis and Mining
Verified
Journal Article
Closed access
PDF file
NDNicolas Dugué
Nicolas Dugué
APAnthony Perez
Anthony Perez

14 June 2015 in Social Network Analysis and Mining
Verified
Journal Article
Open access
PDF file
NDNicolas Dugué
Nicolas Dugué
VLVincent Labatut
Vincent Labatut
APAnthony Perez
Anthony Perez
In the context of Twitter, social capitalists are specific users trying to increase their number of followers and interactions by any means. These users are not healthy for the service, because they are either spammers or real users flawing the notions of influence and visibility. Studying their behavior and understanding their position in Twitter is thus of important interest. It is also necessary to analyze how these methods effectively affect user visibility. Based on a recently proposed method allowing to identify social capitalists, we tackle both points by studying how they are organized, and how their links spread across the Twitter follower–followee network. To that aim, we consider their position in the network w.r.t. its community structure. We use the concept of community role of a node, which describes its position in a network depending on its connectivity at the community level. However, the topological measures originally defined to characterize these roles consider only certain aspects of the community-related connectivity, and rely on a set of empirically fixed thresholds. We first show the limitations of these measures, before extending and generalizing them. Moreover, we use an unsupervised approach to identify the roles, in order to provide more flexibility relatively to the studied system. We then apply our method to the case of social capitalists and show they are highly visible on Twitter, due to the specific roles they hold.

11 June 2025 in American Journal of Gastroenterology
Verified
Journal Article
Closed access
ABA. Sidney Barritt
A. Sidney Barritt
ETElliot B. Tapper
Elliot B. Tapper
PNPhilip Noel Newsome
Philip Noel Newsome
DGDerek Gazis
Derek Gazis
HMHeather Morris
Heather Morris
ASArun Sanyal
Arun Sanyal
INTRODUCTION: Risk of cardiovascular (CV) events is estimated by the Framingham Risk Score (FRS), Pooled Cohort Equation (PCE), and the American Heart Association Predicting Risk of cardiovascular disease (CVD) EVENTs (PREVENT) equation. The applicability of these risk tools in patients with metabolic dysfunction-associated steatotic liver disease (MASLD) is uncertain. This study sought to determine the accuracy of the FRS, PCE, and PREVENT in a real-world cohort of patients with MASLD. METHODS: This analysis included US adults 30 years and older with MASLD in the TARGET-NASH study. Five to ten-year CV risk was estimated using original and recalibrated versions of the FRS and PCE, and original PREVENT equation. Discrimination among prediction models was assessed using the Harrell concordance statistic, and calibration was evaluated using a modified Hosmer Lemeshow test comparing observed and predicted CV events. Logistic regression was used to assess the contribution of liver disease to observed CV events. RESULTS: Overall, 1,090 patients were included. There was an increase in observed CV events from metabolic dysfunction-associated steatotic livers to cirrhosis. FRS demonstrated a weak ability to identify patients who went on to experience a CV event (C-statistic 0.58, 95% confidence interval 0.52–0.63) as did the American Heart Association PREVENT model (C-statistic 0.60, 95% confidence interval 0.54–0.65). Both the FRS and PCE demonstrated a significant lack of calibration ( P < 0.01), with overestimation in the highest deciles and underestimation in the lowest deciles of predicted risk. DISCUSSION: Commonly used tools to identify CV risk performed poorly in a cohort of patients with MASLD. Because CV related death is the greatest source of mortality among patients with MASLD, better risk assessment tools are required.

26 April 2021 in Algorithmica
Verified
Journal Article
Closed access
PDF file
FFFlorent Foucaud
Florent Foucaud
BGBenjamin Gras
Benjamin Gras
APAnthony Perez
Anthony Perez
FSFlorian Sikora
Florian Sikora

24 November 2022 in Algorithmica
Verified
Journal Article
Open access
PDF file
MDMaël Dumas
Maël Dumas
APAnthony Perez
Anthony Perez
ITIoan Todinca
Ioan Todinca
We consider the Trivially Perfect Editing problem, where one is given an undirected graph \(G = (V,E)\) and a parameter \(k \in {\mathbb {N}}\) and seeks to edit (add or delete) at most k edges from G to obtain a trivially perfect graph. The related Trivially Perfect Completion and Trivially Perfect Deletion problems are obtained by only allowing edge additions or edge deletions, respectively. Trivially perfect graphs are both chordal and cographs, and have applications related to the tree-depth width parameter and to social network analysis. All variants of the problem are known to be NP-complete (Burzyn et al., in Discret Appl Math 154(13):1824–1844, 2006; Nastos and Gao, in Soc Netw 35(3):439–450, 2013) and to admit so-called polynomial kernels (Drange and Pilipczuk, in Algorithmica 80(12):3481–3524, 2018; Guo, in: Tokuyama, (ed) Algorithms and Computation, 18th International Symposium, ISAAC. Lecture Notes in Computer Science, Springer, Sendai, 2007. https://doi.org/10.1007/978-3-540-77120-3_79; Bathie et al., in Algorithmica 1–27, 2022). More precisely, Drange and Pilipczuk (Algorithmica 80(12):3481–3524, 2018) provided \(O(k^7)\) vertex-kernels for these problems and left open the existence of cubic vertex-kernels. In this work, we answer positively to this question for all three variants of the problem. Notice that a quadratic vertex-kernel was recently obtained for Trivially Perfect Completion by Bathie et al. (Algorithmica 1–27, 2022).