Krzysztof Suchecki

Dr. Krzysztof Suchecki

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
18 April 2014 in Physical Review Letters
Verified
Journal Article
Open access
JFJuan Fernandez-Gracia
Juan Fernandez-Gracia
KSKrzysztof Suchecki
Krzysztof Suchecki
JRJosé J. Ramasco
José J. Ramasco
Maxi San MiguelMaxi San Miguel
Maxi San Miguel
VEVíctor M. Eguíluz
Víctor M. Eguíluz
The voter model has been studied extensively as a paradigmatic opinion dynamics model. However, its ability to model real opinion dynamics has not been addressed. We introduce a noisy voter model (accounting for social influence) with recurrent mobility of agents (as a proxy for social context), where the spatial and population diversity are taken as inputs to the model. We show that the dynamics can be described as a noisy diffusive process that contains the proper anisotropic coupling topology given by population and mobility heterogeneity. The model captures statistical features of U.S. presidential elections as the stationary vote-share fluctuations across counties and the long-range spatial correlations that decay logarithmically with the distance. Furthermore, it recovers the behavior of these properties when the geographical space is coarse grained at different scales\char22{}from the county level through congressional districts, and up to states. Finally, we analyze the role of the mobility range and the randomness in decision making, which are consistent with the empirical observations.

30 September 2005 in Physical Review E
Verified
Journal Article
Closed access
KSKrzysztof Suchecki
Krzysztof Suchecki
VEVíctor M. Eguíluz
Víctor M. Eguíluz
Maxi San MiguelMaxi San Miguel
Maxi San Miguel
We analyze the ordering dynamics of the voter model in different classes of complex networks. We observe that whether the voter dynamics orders the system depends on the effective dimensionality of the interaction networks. We also find that when there is no ordering in the system, the average survival time of metastable states in finite networks decreases with network disorder and degree heterogeneity. The existence of hubs, i.e., highly connected nodes, in the network modifies the linear system size scaling law of the survival time. The size of an ordered domain is sensitive to the network disorder and the average degree, decreasing with both; however, it seems not to depend on network size and on the heterogeneity of the degree distribution.

1 January 2005 in Europhysics Letters
Verified
Journal Article
Closed access
KSKrzysztof Suchecki
Krzysztof Suchecki
VEVíctor M. Eguíluz
Víctor M. Eguíluz
Maxi San MiguelMaxi San Miguel
Maxi San Miguel

1 January 2021 in Big Data & Society
Verified
Journal Article
Open access
PDF file
KGKacper T Gradoń
Kacper T Gradoń
JHJanusz Holyst
Janusz Holyst
WMWesley R Moy
Wesley R Moy
JSJulian Sienkiewicz
Julian Sienkiewicz
KSKrzysztof Suchecki
Krzysztof Suchecki
The article explores the concept of infodemics during the COVID-19 pandemic, focusing on the propagation of false or inaccurate information proliferating worldwide throughout the SARS-CoV-2 health crisis. We provide an overview of disinformation, misinformation and malinformation and discuss the notion of “fake news”, and highlight the threats these phenomena bear for health policies and national and international security. We discuss the mis-/disinformation as a significant challenge to the public health, intelligence, and policymaking communities and highlight the necessity to design measures enabling the prevention, interdiction, and mitigation of such threats. We then present an overview of selected opportunities for applying technology to study and combat disinformation, outlining several approaches currently being used to understand, describe, and model the phenomena of misinformation and disinformation. We focus specifically on complex networks, machine learning, data- and text-mining methods in misinformation detection, sentiment analysis, and agent-based models of misinformation spreading and the detection of misinformation sources in the network. We conclude with the set of recommendations supporting the World Health Organization’s initiative on infodemiology. We support the implementation of integrated preventive procedures and internationalization of infodemic management. We also endorse the application of the cross-disciplinary methodology of Crime Science discipline, supplemented by Big Data analysis and related information technologies to prevent, disrupt, and detect mis- and disinformation efficiently.

6 February 2018 in Scientific Reports
Verified
Journal Article
Open access
PDF file
RPRobert Paluch
Robert Paluch
XLXiaoyan Lu
Xiaoyan Lu
KSKrzysztof Suchecki
Krzysztof Suchecki
BSBoleslaw K. Szymanski
Boleslaw K. Szymanski
JHJanusz Holyst
Janusz Holyst
Spread over complex networks is a ubiquitous process with increasingly wide applications. Locating spread sources is often important, e.g. finding the patient one in epidemics, or source of rumor spreading in social network. Pinto, Thiran and Vetterli introduced an algorithm (PTVA) to solve the important case of this problem in which a limited set of nodes act as observers and report times at which the spread reached them. PTVA uses all observers to find a solution. Here we propose a new approach in which observers with low quality information (i.e. with large spread encounter times) are ignored and potential sources are selected based on the likelihood gradient from high quality observers. The original complexity of PTVA is O(N α ), where α ∈ (3,4) depends on the network topology and number of observers (N denotes the number of nodes in the network). Our Gradient Maximum Likelihood Algorithm (GMLA) reduces this complexity to O (N2log (N)). Extensive numerical tests performed on synthetic networks and real Gnutella network with limitation that id’s of spreaders are unknown to observers demonstrate that for scale-free networks with such limitation GMLA yields higher quality localization results than PTVA does.

26 July 2006 in Physical Review E
Verified
Journal Article
Closed access
PDF file
KSKrzysztof Suchecki
Krzysztof Suchecki
JHJanusz Holyst
Janusz Holyst
We investigate analytically the behavior of the Ising model on two connected Barabasi-Albert networks. Depending on relative ordering of both networks there are two possible phases corresponding to parallel or antiparallel alignment of spins in both networks. A difference between critical temperatures of both phases disappears in the limit of vanishing inter-network coupling for identical networks. The analytic predictions are confirmed by numerical simulations.