Ekaterina Vasilyeva
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ekaterina Vasilyeva has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Andrey Leonidov
P.N. Lebedev Physical Institute, Moscow, Russia
4 shared publications - Daniil Musatov
Moscow Institute of Physics and Technology
4 shared publications - Kirill Kovalenko
Scuola Superiore Meridionale
3 shared publications - Andrei Mikhailovich Raigorodskii
Moscow Institute of Physics and Technology, Dolgoprudny, Russia
2 shared publications Andrey Leonidov
Theoretical Physics Department, P.N. Lebedev Physical Institute, 53 Leninsky Prospect, Moscow 119991, Russia
2 shared publications- Charo. I. del Genio
North University of China
2 shared publications
Latest Publications
- 30 July 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 211
Dynamics of Boltzmannian temporal difference reinforcement learning in social dilemmas
- 30 July 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 211
Dynamics of Boltzmannian temporal difference reinforcement learning in social dilemmas
- 22 July 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 211
Topological measures in weighted hypergraphs
- 22 July 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 211
Topological measures in weighted hypergraphs
- Open Access
- 26 March 2026
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Distances in weighted higher-order networks
The concept of distance is a fundamental idea in graphs and hypergraphs. However, its extension to weighted hypergraphs is challenging, since it may result in inconsistencies, especially if the weights are arbitrarily assigned to the hyperedges. We address this challenge by proposing a general distance measure for weighted hypergraphs. Our measure is well-defined, and it reduces to the classic graph distance if the edges in the hypergraph are all pairwise links. We demonstrate the applicability of our definition by analyzing a number of real-world higher-order datasets, including the network of preprints in the arXiv repository, for which we choose the weights in a way that reflects the notion of cognitive distance, which measures the conceptual remoteness between fields. Our results demonstrate that, when higher-order edges cannot be neglected, the use of a full hypergraph measure is necessary to avoid the information loss that would result from commonly used approaches, such as clique projection.
- 26 March 2026
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Open AccessDistances in weighted higher-order networks
The concept of distance is a fundamental idea in graphs and hypergraphs. However, its extension to weighted hypergraphs is challenging, since it may result in inconsistencies, especially if the weights are arbitrarily assigned to the hyperedges. We address this challenge by proposing a general distance measure for weighted hypergraphs. Our measure is well-defined, and it reduces to the classic graph distance if the edges in the hypergraph are all pairwise links. We demonstrate the applicability of our definition by analyzing a number of real-world higher-order datasets, including the network of preprints in the arXiv repository, for which we choose the weights in a way that reflects the notion of cognitive distance, which measures the conceptual remoteness between fields. Our results demonstrate that, when higher-order edges cannot be neglected, the use of a full hypergraph measure is necessary to avoid the information loss that would result from commonly used approaches, such as clique projection.
- 25 September 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 201
On consensus equilibria in a multilayered multiagent system
- 25 September 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 201
On consensus equilibria in a multilayered multiagent system
- 25 September 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 201
Strategic exploitation in Boltzmann Q-learning in the prisoners dilemma
- 25 September 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 201
Strategic exploitation in Boltzmann Q-learning in the prisoners dilemma
- 26 August 2024
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 187
Strategic behaviour in the mean field Ising game
- 26 August 2024
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 187
Strategic behaviour in the mean field Ising game
- 20 July 2024
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 186
Matrix centrality for annotated hypergraphs
- 20 July 2024
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 186
Matrix centrality for annotated hypergraphs
- Open Access
Distances in Higher-Order Networks and the Metric Structure of Hypergraphs
We explore the metric structure of networks with higher-order interactions and introduce a novel definition of distance for hypergraphs that extends the classic methods reported in the literature. The new metric incorporates two critical factors: (1) the inter-node distance within each hyperedge, and (2) the distance between hyperedges in the network. As such, it involves the computation of distances in a weighted line graph of the hypergraph. The approach is illustrated with several ad hoc synthetic hypergraphs, where the structural information unveiled by the novel metric is highlighted. Moreover, the method’s performance and effectiveness are shown through computations on large real-world hypergraphs, which indeed reveal new insights into the structural features of networks beyond pairwise interactions. Namely, using the new distance measure, we generalize the definitions of efficiency, closeness and betweenness centrality for the case of hypergraphs. Comparing the values of these generalized measures with their analogs calculated for the hypergraph clique projections, we show that our measures provide significantly different assessments on the characteristics (and roles) of the nodes from the information-transferability point of view. The difference is brighter for hypergraphs in which hyperedges of large sizes are frequent, and nodes relating to these hyperedges are rarely connected by other hyperedges of smaller sizes.
Open AccessDistances in Higher-Order Networks and the Metric Structure of Hypergraphs
We explore the metric structure of networks with higher-order interactions and introduce a novel definition of distance for hypergraphs that extends the classic methods reported in the literature. The new metric incorporates two critical factors: (1) the inter-node distance within each hyperedge, and (2) the distance between hyperedges in the network. As such, it involves the computation of distances in a weighted line graph of the hypergraph. The approach is illustrated with several ad hoc synthetic hypergraphs, where the structural information unveiled by the novel metric is highlighted. Moreover, the method’s performance and effectiveness are shown through computations on large real-world hypergraphs, which indeed reveal new insights into the structural features of networks beyond pairwise interactions. Namely, using the new distance measure, we generalize the definitions of efficiency, closeness and betweenness centrality for the case of hypergraphs. Comparing the values of these generalized measures with their analogs calculated for the hypergraph clique projections, we show that our measures provide significantly different assessments on the characteristics (and roles) of the nodes from the information-transferability point of view. The difference is brighter for hypergraphs in which hyperedges of large sizes are frequent, and nodes relating to these hyperedges are rarely connected by other hyperedges of smaller sizes.
- Open Access
- 31 May 2023
- Published by American Physical Society (APS) in Physical Review X
- Vol. 13 (2) , 021032
Why Are There Six Degrees of Separation in a Social Network?
A wealth of evidence shows that real-world networks are endowed with the small-world property, i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most social networks are organized so that no individual is more than six connections apart from any other, an empirical regularity known as the six degrees of separation. Why social networks have this ultrasmall-world organization, whereby the graph’s diameter is independent of the network size over several orders of magnitude, is still unknown. We show that the “six degrees of separation” is the property featured by the equilibrium state of any network where individuals weigh between their aspiration to improve their centrality and the costs incurred in forming and maintaining connections. We show, moreover, that the emergence of such a regularity is compatible with all other features, such as clustering and scale-freeness, that normally characterize the structure of social networks. Thus, our results show how simple evolutionary rules of the kind traditionally associated with human cooperation and altruism can also account for the emergence of one of the most intriguing attributes of social networks.
- 31 May 2023
- Published by American Physical Society (APS) in Physical Review X
- Vol. 13 (2) , 021032
Open AccessWhy Are There Six Degrees of Separation in a Social Network?
A wealth of evidence shows that real-world networks are endowed with the small-world property, i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most social networks are organized so that no individual is more than six connections apart from any other, an empirical regularity known as the six degrees of separation. Why social networks have this ultrasmall-world organization, whereby the graph’s diameter is independent of the network size over several orders of magnitude, is still unknown. We show that the “six degrees of separation” is the property featured by the equilibrium state of any network where individuals weigh between their aspiration to improve their centrality and the costs incurred in forming and maintaining connections. We show, moreover, that the emergence of such a regularity is compatible with all other features, such as clustering and scale-freeness, that normally characterize the structure of social networks. Thus, our results show how simple evolutionary rules of the kind traditionally associated with human cooperation and altruism can also account for the emergence of one of the most intriguing attributes of social networks.
- Open Access
- 13 April 2023
- Published by NP Voprosy Ekonomiki in Russian Journal of Economics
- Vol. 9 (1) , 93-108
Measuring climate-credit risk relationship using world input-output tables
The Basel Committee recommended the use of input-output tables to properly measure climate risks. However, the majority of previous studies only limits the use of input-output tables to carbon emissions and this is not applied in climate risk ratings. The existing climate (E) risk ratings (scores) was modified or transformed from Sustainalytics to the full climate risk scores using input-output tables. Positive relationship between credit risks and the full climate risk estimates at the industry level was identified, and this justifies the interest rate discount granted to firms in the green industries. Thus, for the purpose of lending the full degree of greenness derived from input-output tables should be considered, not substituting this by the easily observable and publicly available marginal climate risk ratings like those provided by Sustainalytics.
- 13 April 2023
- Published by NP Voprosy Ekonomiki in Russian Journal of Economics
- Vol. 9 (1) , 93-108
Open AccessMeasuring climate-credit risk relationship using world input-output tables
The Basel Committee recommended the use of input-output tables to properly measure climate risks. However, the majority of previous studies only limits the use of input-output tables to carbon emissions and this is not applied in climate risk ratings. The existing climate (E) risk ratings (scores) was modified or transformed from Sustainalytics to the full climate risk scores using input-output tables. Positive relationship between credit risks and the full climate risk estimates at the industry level was identified, and this justifies the interest rate discount granted to firms in the green industries. Thus, for the purpose of lending the full degree of greenness derived from input-output tables should be considered, not substituting this by the easily observable and publicly available marginal climate risk ratings like those provided by Sustainalytics.