research-article

Relaxation time in complex network

Authors:

Dmytro Lande,

Andrei Snarskii,

Oleh Dmytrenko,

Igor SubachAuthors Info & Claims

ARES '20: Proceedings of the 15th International Conference on Availability, Reliability and Security

Article No.: 99, Pages 1 - 6

https://doi.org/10.1145/3407023.3409231

Published: 25 August 2020 Publication History

Get Access

Abstract

New characteristics of nodes of network structures are proposed and researched in this work - the relaxation time of network and the individual relaxation time of node. The so-called decelerated iteration algorithms for HITS and PageRank are used to obtain the relaxation time.

The relaxation time of network and the individual relaxation time of node were tested on the example of a weighted directed network of characters in the novel«Les Miserables». It was found that a topology of a network affects a relaxation of nodes after their perturbation.

As a result of using relaxation time it was possible to identify the most important network components and rank them by the proposed characteristics.

The resulted ranking compared to the ranking by HITS, PageRank and degree of nodes shows the uniqueness of the proposed relaxation time of network and individual relaxation time of node.

References

[1]

M.E.J. Newman (2003). The structure and function of complex networks. SIAM Review, 45, 167--256.

Digital Library

Google Scholar

[2]

A.A. Snarskii and D.V. Lande (2015). Modeling of complex networks: tutorial. K.: Engineering.

Google Scholar

[3]

S.N. Dorogovtsev and J.F. Mendes, 2013 Evolution of networks: from biological networks to the Internet and WWW. Oxford University Press, Oxford, UK.

Google Scholar

[4]

J.M. Kleinberg (1998). Authoritative sources in a hyperlinked environment. In Processing of ACM-SIAM Symposium on Discrete Algorithms, 46(5), 604--632.

Google Scholar

[5]

S. Brin and L. Page (1998). The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems, 30(1-7), 107--117

Google Scholar

[6]

A. Rajaraman and J. D. Ullman, 2011 Mining of massive datasets. Cambridge University Press, Cambridge.

Crossref

Google Scholar

[7]

A.N. Langville and C.D. Meyer, 2011 Google's PageRank and beyond: The science of search engine rankings. Princeton University Press, Princeton.

Google Scholar

[8]

R. Christensen, 2012 Theory of viscoelasticity: an introduction. Elsevier.

Google Scholar

[9]

Datasets, https://github.com/gephi/gephi/wiki/Datasets, last accessed 2020/06/14.

Google Scholar

[10]

D.E. Knuth 1993, The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading, MA.

Google Scholar

Cited By

View all

Díaz-Parra OFuentes-Penna AMarroquín-Gutiérrez FRamos-Fernández JRodríguez-Lara BBarrera-Cámara RRuiz-Jaimes MTafoya E(2023)House of Quality for Safe CitiesManagement, Technology, and Economic Growth in Smart and Sustainable Cities10.4018/979-8-3693-0373-3.ch006(97-110)Online publication date: 24-Oct-2023
https://doi.org/10.4018/979-8-3693-0373-3.ch006
Puchkov OLande DSubach IRybak O(2023)INFORMATION TECHNOLOGY FOR DETERMINING THE POLITICAL DIRECTION OF INFORMATION SOURCES TO ENSURE THE INFORMATION SECURITY OF THE STATE DURING CRISIS SITUATIONSCybersecurity: Education, Science, Technique10.28925/2663-4023.2023.20.1421524:20(142-152)Online publication date: 2023
https://doi.org/10.28925/2663-4023.2023.20.142152
Lande DDmytrenko O(2022)Research of Topological Properties of Network Reflections Obtained Using Different Algorithms for Scanning Initial NetworksMathematical Modeling and Simulation of Systems10.1007/978-3-030-89902-8_26(347-361)Online publication date: 23-Feb-2022
https://doi.org/10.1007/978-3-030-89902-8_26
Show More Cited By

Index Terms

Relaxation time in complex network
1. Mathematics of computing
  1. Discrete mathematics

Recommendations

Content and link-structure perspective of ranking webpages: A review
Abstract
The delivery of ranked relevant results is probably the most important factor in making a web search engine acceptable to its users. This inspiration has led the search engine engineers and researchers to conceive ranking algorithms ...
Hits on the web: how does it compare?
SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval

This paper describes a large-scale evaluation of the effectiveness of HITS in comparison with other link-based ranking algorithms, when used in combination with a state-of-the-art text retrieval algorithm exploiting anchor text. We quantified their ...
Fairness Rising from the Ranks: HITS and PageRank on Homophilic Networks
WWW '24: Proceedings of the ACM Web Conference 2024

In this paper, we investigate the conditions under which link analysis algorithms prevent minority groups from reaching high ranking slots. We find that the most common link-based algorithms using centrality metrics, such as PageRank and HITS, can ...

Comments

Information & Contributors

Information

Published In

ARES '20: Proceedings of the 15th International Conference on Availability, Reliability and Security

August 2020

1073 pages

ISBN:9781450388337

DOI:10.1145/3407023

Program Chairs:
Melanie Volkamer
Karlsruhe Institute of Technologie (KIT), Competence Center for Applied Security Technology (KASTEL)
,
Christian Wressnegger
Karlsruhe Institute of Technologie (KIT), Competence Center for Applied Security Technology (KASTEL)

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

NATO SPS Project CyRADARS (Cyber Rapid Analysis for Defense Awareness of Real-time Situation)

Conference

ARES 2020

ARES 2020: The 15th International Conference on Availability, Reliability and Security

August 25 - 28, 2020

Virtual Event, Ireland

Acceptance Rates

Overall Acceptance Rate 228 of 451 submissions, 51%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
58
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Díaz-Parra OFuentes-Penna AMarroquín-Gutiérrez FRamos-Fernández JRodríguez-Lara BBarrera-Cámara RRuiz-Jaimes MTafoya E(2023)House of Quality for Safe CitiesManagement, Technology, and Economic Growth in Smart and Sustainable Cities10.4018/979-8-3693-0373-3.ch006(97-110)Online publication date: 24-Oct-2023
https://doi.org/10.4018/979-8-3693-0373-3.ch006
Puchkov OLande DSubach IRybak O(2023)INFORMATION TECHNOLOGY FOR DETERMINING THE POLITICAL DIRECTION OF INFORMATION SOURCES TO ENSURE THE INFORMATION SECURITY OF THE STATE DURING CRISIS SITUATIONSCybersecurity: Education, Science, Technique10.28925/2663-4023.2023.20.1421524:20(142-152)Online publication date: 2023
https://doi.org/10.28925/2663-4023.2023.20.142152
Lande DDmytrenko O(2022)Research of Topological Properties of Network Reflections Obtained Using Different Algorithms for Scanning Initial NetworksMathematical Modeling and Simulation of Systems10.1007/978-3-030-89902-8_26(347-361)Online publication date: 23-Feb-2022
https://doi.org/10.1007/978-3-030-89902-8_26
Liu GGu RWang JYan W(2021)Personal Trajectory with Ring Structure NetworkSecurity and Communication Networks10.1155/2021/99741912021Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1155/2021/9974191

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Content and link-structure perspective of ranking webpages: A review

Hits on the web: how does it compare?

Fairness Rising from the Ranks: HITS and PageRank on Homophilic Networks

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations