Róbert Pethes

Mr. Róbert Pethes

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
2 March 2024 in Complexity
Verified
Journal Article
Open access
PDF file
RPRóbert Pethes
Róbert Pethes
EBEliza Bodor-Eranus
Eliza Bodor-Eranus
KTKároly Takács
Károly Takács
Levente KovácsLevente Kovács
Levente Kovács
Central actors or opinion leaders are in the right structural position to spread relevant information or convince others about adopting an innovation or behaviour change. Who is a central actor or opinion leader might be conceptualised in various ways. Widely accepted centrality measures do not take into account that those in central positions in the social network may change over time. A longitudinal comparison of the set and importance of opinion leaders is problematic with these measures and therefore needs a novel approach. In this study, we investigate ways to compare the stability of the set of central actors over time. Using longitudinal survey data from primary schools (where the members of the social networks do not change much over time) on advice-seeking and friendship networks, we find a relatively poor stability of who is in the central positions anyhow we define centrality. We propose the application of combined indices in order to achieve more efficient targeting results. Our results suggest that because opinion leaders may change over time, researchers should be careful about relying on simple centrality indices from cross-sectional data to gain and interpret information (for example, in the design of prevention programs, network-based interventions or infection control) and must rely on more diverse structural information instead.

16 March 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
RPRóbert Pethes
Róbert Pethes
Levente KovácsLevente Kovács
Levente Kovács
Inhomogeneous random graphs are commonly used models for complex networks where nodes have varying degrees of connectivity. Computing the degree distribution of such networks is a fundamental problem and has important applications in various fields. We define the inhomogeneous random graph as a random graph model where the edges are drawn independently and the probability of a link between any two vertices can be different for each node pair. In this paper, we present an exact and an approximation method to compute the degree distribution of inhomogeneous random graphs using the Poisson binomial distribution. The exact algorithm utilizes the DFT-CF method to compute the distribution of a Poisson binomial random variable. The approximation method uses the Poisson, binomial, and Gaussian distributions to approximate the Poisson binomial distribution.

20 November 2024 in Fluctuation and Noise Letters
Verified
Journal Article
Closed access
RPRóbert Pethes
Róbert Pethes
Levente KovácsLevente Kovács
Levente Kovács