Zobrazeno 1 - 10
of 24
pro vyhledávání: '"ANDRÁS, LONDON"'
Autor:
András London, András Pluhár
Publikováno v:
Applied Network Science, Vol 8, Iss 1, Pp 1-12 (2023)
Abstract In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Spring
Externí odkaz:
https://doaj.org/article/296b214a68e64e52aaa03ad42f6d3b48
Autor:
Imre Gera, András London
Publikováno v:
Applied Network Science, Vol 8, Iss 1, Pp 1-26 (2023)
Abstract Nestedness has been observed in a variety of networks but has been primarily viewed in the context of bipartite networks. Numerous metrics quantify nestedness and some clustering methods identify fully nested parts of graphs, but all with si
Externí odkaz:
https://doaj.org/article/df99f53dd20f4825a9c57ce8fc9a579a
Publikováno v:
Information, Vol 13, Iss 5, p 232 (2022)
In this paper, we provide a simple forward-looking approach to compare rating methods with respect to their stability over time. Given a rating vector of entities involved in the comparison and a ranking indicated by the rating, the stability of the
Externí odkaz:
https://doaj.org/article/f4c0dc3499b644f4a553e9485120808b
Publikováno v:
Acta Oeconomica. 72:413-436
The Varieties of Capitalism (VoC) literature has recently manifested a dynamic development. Among others, the member states of the European Union (EU) have been studied extensively from this viewpoint, and main capitalism models have been identified.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ef1599fb1b1d36928b318b3892a0146
https://doi.org/10.1556/032.2022.00029
https://doi.org/10.1556/032.2022.00029
Autor:
András London, András Pluhár
Publikováno v:
Complex Networks and Their Applications XI ISBN: 9783031211300
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ece547bed8e5186fdc37df5e5c36065a
https://doi.org/10.1007/978-3-031-21131-7_26
https://doi.org/10.1007/978-3-031-21131-7_26
Publikováno v:
Forum for Social Economics. 50:530-552
The EU can be regarded as a club where integration is the main club good. For decades, club convergence applied; however, currently there is insufficient level of convergence. The club theory appro...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a07cb6167017ffd65904296ccea9d5c
https://doi.org/10.1080/07360932.2019.1601121
https://doi.org/10.1080/07360932.2019.1601121
We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges between the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbca3263bd757f8a3eabe1e2587136d5
http://arxiv.org/abs/2103.08005
http://arxiv.org/abs/2103.08005
Publikováno v:
Social Network Analysis and Mining. 10
Identifying key actors or nodes in a network is a relevant task regarding many applications. In general, the real-valued function that evaluates the nodes is called node centrality measure. Performing a relevance-based ranking on the list of nodes is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f42e19361fe0f94999493a6bf9cdd96
https://doi.org/10.1007/s13278-020-00693-0
https://doi.org/10.1007/s13278-020-00693-0
Autor:
András London, András Pluhár
Publikováno v:
Acta Cybernetica. 23:921-927
In this paper, we investigate special types of Maker-Breaker games defined on graphs. We restrict Maker’s possible moves that resembles the way that was introduced by Espig, Frieze, Krivelevich and Pedgen [9]. Here, we require that the subgraph ind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0cdfd0d896e8fbc60ffa643b54a9111
https://doi.org/10.14232/actacyb.23.3.2018.12
https://doi.org/10.14232/actacyb.23.3.2018.12
Publikováno v:
Acta Cybernetica. 23:561-572
In Maker-Breaker positional games two players, Maker and Breaker, play on a finite or infinite board with the goal of claiming or preventing the opponent from getting a finite winning set, respectively. For different games there are several winning s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28bcf03bd480c7fafc93ba185bb7139e
https://doi.org/10.14232/actacyb.23.2.2017.8
https://doi.org/10.14232/actacyb.23.2.2017.8