Liliia Ziganurova
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
Research Subjects
Liliia Ziganurova has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Lev Shchur
Landau Institute for Theoretical Physics
3 shared publications Lev Shchur
Scientific Center in Chernogolovka
1 shared publication- Richard Durbin
Department of Genetics, University of Cambridge , Cambridge
1 shared publication - Vladimir Shchur
National Research University Higher School of Economics, Moscow, Russia
1 shared publication
Latest Publications
- 1 February 2022
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 43 (2) , 513-518
Algorithm for Adaptive Mesh Redistribution in Lattice Boltzmann Simulations
The Lattice Boltzmann method (LBM) is the alternative approach for hydrodynamic equation solving. Two factors make it a favorite approach nowadays. Firstly, the attractive feature of LBM is that it is intrinsic for parallel simulations due to the linear structure of the algorithm. Secondly, what makes LBM special for the research, it is well applicable to the simulations in complicated geometrical domains. The realization of the potential scalability relies on many factors. We concentrate on one of the problems that may obscure synchronization of computing nodes simulating problems that require redistribution of the adaptive mesh nodes between computing nodes during the simulations process. We discuss how the recently proposed algorithm for redistributing tasks in the population annealing can be modified in the LBM simulations with dynamical mesh refining.
- 1 February 2022
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 43 (2) , 513-518
Algorithm for Adaptive Mesh Redistribution in Lattice Boltzmann Simulations
The Lattice Boltzmann method (LBM) is the alternative approach for hydrodynamic equation solving. Two factors make it a favorite approach nowadays. Firstly, the attractive feature of LBM is that it is intrinsic for parallel simulations due to the linear structure of the algorithm. Secondly, what makes LBM special for the research, it is well applicable to the simulations in complicated geometrical domains. The realization of the potential scalability relies on many factors. We concentrate on one of the problems that may obscure synchronization of computing nodes simulating problems that require redistribution of the adaptive mesh nodes between computing nodes during the simulations process. We discuss how the recently proposed algorithm for redistributing tasks in the population annealing can be modified in the LBM simulations with dynamical mesh refining.
- 1 October 2019
- Published by Pleiades Publishing Ltd in Journal of Experimental and Theoretical Physics
- Vol. 129 (4) , 722-732
Synchronization of Processes in Parallel Discrete Event Simulation
The method of parallel discrete event simulation (PDES) is one of promising methods for effective use of supercomputer systems. In this paper, the results of the analysis of synchronization...
- 1 October 2019
- Published by Pleiades Publishing Ltd in Journal of Experimental and Theoretical Physics
- Vol. 129 (4) , 722-732
Synchronization of Processes in Parallel Discrete Event Simulation
The method of parallel discrete event simulation (PDES) is one of promising methods for effective use of supercomputer systems. In this paper, the results of the analysis of synchronization...
- Open Access
Fast and scalable genome-wide inference of local tree topologies from large number of haplotypes based on tree consistent PBWT data structure
Estimation of the relationship between DNA sequences is one of the most important problems in genomics. Understanding these relationships is central to demographic inference, correction of population structure in GWAS, identifying signals of selection etc. The data structure containing the full information about sample genealogy is called the ancestral recombination graph (ARG). However, ARG inference is a very difficult problem, not least due to a very complex state space. In this work we describe a new approach for fast and scalable generation of local tree topologies relating large numbers of haplotypes. Our method is closely related to the estimation of ARG, and captures both local and global properties of an ARG. It is based on a data structure which we call tree consistent PBWT, a modification of PBWT data structure introduced by R. Durbin (2014). We also explore some methods to estimate the quality of the generated tree topologies and to make inferences based on them. At the end we discuss a probabilistic model which could potentially lead to the estimation of ARG node times.
Open AccessFast and scalable genome-wide inference of local tree topologies from large number of haplotypes based on tree consistent PBWT data structure
Estimation of the relationship between DNA sequences is one of the most important problems in genomics. Understanding these relationships is central to demographic inference, correction of population structure in GWAS, identifying signals of selection etc. The data structure containing the full information about sample genealogy is called the ancestral recombination graph (ARG). However, ARG inference is a very difficult problem, not least due to a very complex state space. In this work we describe a new approach for fast and scalable generation of local tree topologies relating large numbers of haplotypes. Our method is closely related to the estimation of ARG, and captures both local and global properties of an ARG. It is based on a data structure which we call tree consistent PBWT, a modification of PBWT data structure introduced by R. Durbin (2014). We also explore some methods to estimate the quality of the generated tree topologies and to make inferences based on them. At the end we discuss a probabilistic model which could potentially lead to the estimation of ARG node times.
- 21 August 2018
- Published by American Physical Society (APS) in Physical Review E
- Vol. 98 (2) , 022218
Synchronization of conservative parallel discrete event simulations on a small-world network
We examine the question of the influence of sparse long-range communications on the synchronization in parallel discrete event simulations. We build a model of the evolution of local virtual times in a conservative algorithm including several choices of local links. All network realizations belong to the small-world network class. We find that synchronization depends on the average shortest path of the network. The time profile dynamics are similar to the surface profile growth, which helps to analyze synchronization effects using a statistical physics approach. Without long-range links of the nodes, the model belongs to the universality class of the Kardar-Parisi-Zhang equation for surface growth. We find that the critical exponents depend logarithmically on the fraction of long-range links. We present the results of simulations and discuss our observations.
- 21 August 2018
- Published by American Physical Society (APS) in Physical Review E
- Vol. 98 (2) , 022218
Synchronization of conservative parallel discrete event simulations on a small-world network
We examine the question of the influence of sparse long-range communications on the synchronization in parallel discrete event simulations. We build a model of the evolution of local virtual times in a conservative algorithm including several choices of local links. All network realizations belong to the small-world network class. We find that synchronization depends on the average shortest path of the network. The time profile dynamics are similar to the surface profile growth, which helps to analyze synchronization effects using a statistical physics approach. Without long-range links of the nodes, the model belongs to the universality class of the Kardar-Parisi-Zhang equation for surface growth. We find that the critical exponents depend logarithmically on the fraction of long-range links. We present the results of simulations and discuss our observations.
- 29 July 2017
- Published by Springer Nature
- p. 246-253
Properties of the Conservative Parallel Discrete Event Simulation Algorithm
- 29 July 2017
- Published by Springer Nature
- p. 246-253
Properties of the Conservative Parallel Discrete Event Simulation Algorithm