@article{15036,
  abstract     = {The assembly of a septin filament requires that homologous monomers must distinguish between one another in establishing appropriate interfaces with their neighbors. To understand this phenomenon at the molecular level, we present the first four crystal structures of heterodimeric septin complexes. We describe in detail the two distinct types of G-interface present within the octameric particles, which must polymerize to form filaments. These are formed between SEPT2 and SEPT6 and between SEPT7 and SEPT3, and their description permits an understanding of the structural basis for the selectivity necessary for correct filament assembly. By replacing SEPT6 by SEPT8 or SEPT11, it is possible to rationalize Kinoshita's postulate, which predicts the exchangeability of septins from within a subgroup. Switches I and II, which in classical small GTPases provide a mechanism for nucleotide-dependent conformational change, have been repurposed in septins to play a fundamental role in molecular recognition. Specifically, it is switch I which holds the key to discriminating between the two different G-interfaces. Moreover, residues which are characteristic for a given subgroup play subtle, but pivotal, roles in guaranteeing that the correct interfaces are formed.},
  author       = {Rosa, Higor Vinícius Dias and Leonardo, Diego Antonio and Brognara, Gabriel and Brandão-Neto, José and D'Muniz Pereira, Humberto and Araújo, Ana Paula Ulian and Garratt, Richard Charles},
  issn         = {0022-2836},
  journal      = {Journal of Molecular Biology},
  keywords     = {Molecular Biology, Structural Biology},
  number       = {21},
  pages        = {5784--5801},
  publisher    = {Elsevier},
  title        = {{Molecular recognition at septin interfaces: The switches hold the key}},
  doi          = {10.1016/j.jmb.2020.09.001},
  volume       = {432},
  year         = {2020},
}

@article{15037,
  abstract     = {Protein abundance and localization at the plasma membrane (PM) shapes plant development and mediates adaptation to changing environmental conditions. It is regulated by ubiquitination, a post-translational modification crucial for the proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation. To understand the significance and the variety of roles played by this reversible modification, the function of ubiquitin receptors, which translate the ubiquitin signature into a cellular response, needs to be elucidated. In this study, we show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6 interact with components of the ESCRT machinery and bind to K63-linked ubiquitin via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these domains results not only in a loss of ubiquitin binding but also altered localization, abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6 is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially modulates degradation of PM-localized cargoes, assisting in the fine-tuning of the delicate interplay between protein recycling and downregulation. Taken together, our findings demonstrate the function and regulation of a ubiquitin receptor that mediates vacuolar degradation of PM proteins in higher plants.},
  author       = {Moulinier-Anzola, Jeanette and Schwihla, Maximilian and De-Araújo, Lucinda and Artner, Christina and Jörg, Lisa and Konstantinova, Nataliia and Luschnig, Christian and Korbei, Barbara},
  issn         = {1674-2052},
  journal      = {Molecular Plant},
  keywords     = {Plant Science, Molecular Biology},
  number       = {5},
  pages        = {717--731},
  publisher    = {Elsevier},
  title        = {{TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants}},
  doi          = {10.1016/j.molp.2020.02.012},
  volume       = {13},
  year         = {2020},
}

@article{15055,
  abstract     = {<jats:p>Markov decision processes (MDPs) are the defacto framework for sequential decision making in the presence of stochastic uncertainty. A classical optimization criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores low probability catastrophic events with highly negative impact on the system. On the other hand, risk-averse policies require the probability of undesirable events to be below a given threshold, but they do not account for optimization of the expected payoff. We consider MDPs with discounted-sum payoff with failure states which represent catastrophic outcomes. The objective of risk-constrained planning is to maximize the expected discounted-sum payoff among risk-averse policies that ensure the probability to encounter a failure state is below a desired threshold. Our main contribution is an efficient risk-constrained planning algorithm that combines UCT-like search with a predictor learned through interaction with the MDP (in the style of AlphaZero) and with a risk-constrained action selection via linear programming. We demonstrate the effectiveness of our approach with experiments on classical MDPs from the literature, including benchmarks with an order of 106 states.</jats:p>},
  author       = {Brázdil, Tomáš and Chatterjee, Krishnendu and Novotný, Petr and Vahala, Jiří},
  issn         = {2374-3468},
  journal      = {Proceedings of the 34th AAAI Conference on Artificial Intelligence},
  keywords     = {General Medicine},
  location     = {New York, NY, United States},
  number       = {06},
  pages        = {9794--9801},
  publisher    = {Association for the Advancement of Artificial Intelligence},
  title        = {{Reinforcement learning of risk-constrained policies in Markov decision processes}},
  doi          = {10.1609/aaai.v34i06.6531},
  volume       = {34},
  year         = {2020},
}

@article{15057,
  abstract     = {Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions in cell division and germline proliferation. However, the role of VRK-1 in postmitotic cells and adult life span remains unknown. Here, we show that VRK-1 increases organismal longevity by activating the cellular energy sensor, AMP-activated protein kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1 in the soma of adult C. elegans increased life span and, conversely, inhibition of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred by mutations that inhibit C. elegans mitochondrial respiration, which requires AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1, promotes longevity through AMPK activation, and this function appears to be conserved between C. elegans and humans.},
  author       = {Park, Sangsoon and Artan, Murat and Han, Seung Hyun and Park, Hae-Eun H. and Jung, Yoonji and Hwang, Ara B. and Shin, Won Sik and Kim, Kyong-Tai and Lee, Seung-Jae V.},
  issn         = {2375-2548},
  journal      = {Science Advances},
  number       = {27},
  publisher    = {American Association for the Advancement of Science},
  title        = {{VRK-1 extends life span by activation of AMPK via phosphorylation}},
  doi          = {10.1126/sciadv.aaw7824},
  volume       = {6},
  year         = {2020},
}

@inproceedings{15059,
  abstract     = {In this paper we present a room temperature radiometer that can eliminate the need of using cryostats in satellite payload reducing its weight and improving reliability. The proposed radiometer is based on an electro-optic upconverter that boosts up microwave photons energy by upconverting them into an optical domain what makes them immune to thermal noise even if operating at room temperature. The converter uses a high-quality factor whispering gallery
mode (WGM) resonator providing naturally narrow bandwidth and therefore might be useful for applications like microwave hyperspectral sensing. The upconversion process is explained by
providing essential information about photon conversion efficiency and sensitivity. To prove the concept, we describe an experiment which shows state-of-the-art photon conversion efficiency n=10-5 per mW of pump power at the frequency of 80 GHz.},
  author       = {Wasiak, Michal and Botello, Gabriel Santamaria and Abdalmalak, Kerlos Atia and Sedlmeir, Florian and Rueda Sanchez, Alfredo R and Segovia-Vargas, Daniel and Schwefel, Harald G. L. and Munoz, Luis Enrique Garcia},
  booktitle    = {14th European Conference on Antennas and Propagation},
  location     = {Copenhagen, Denmark},
  publisher    = {IEEE},
  title        = {{Compact millimeter and submillimeter-wave photonic radiometer for cubesats}},
  doi          = {10.23919/eucap48036.2020.9135962},
  year         = {2020},
}

@article{15061,
  abstract     = {The actin cytoskeleton, a dynamic network of actin filaments and associated F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2 (EhActn2) with features expected for the common ancestor of Entamoeba and higher eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2 reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain. Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD for Ca2+, binding of which can only be regulated in the presence of physiological concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover that EhActn2 plays an important role in phagocytic cup formation and might constitute a new drug target for amoebic dysentery.},
  author       = {Pinotsis, Nikos and Zielinska, Karolina and Babuta, Mrigya and Arolas, Joan L. and Kostan, Julius and Khan, Muhammad Bashir and Schreiner, Claudia and Testa Salmazo, Anita P and Ciccarelli, Luciano and Puchinger, Martin and Gkougkoulia, Eirini A. and Ribeiro, Euripedes de Almeida and Marlovits, Thomas C. and Bhattacharya, Alok and Djinovic-Carugo, Kristina},
  issn         = {1091-6490},
  journal      = {Proceedings of the National Academy of Sciences of the United States of America},
  number       = {36},
  pages        = {22101--22112},
  publisher    = {National Academy of Sciences},
  title        = {{Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin}},
  doi          = {10.1073/pnas.1917269117},
  volume       = {117},
  year         = {2020},
}

@article{15063,
  abstract     = {We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395).},
  author       = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J},
  issn         = {2690-0998},
  journal      = {Probability and Mathematical Physics},
  keywords     = {General Medicine},
  number       = {1},
  pages        = {101--146},
  publisher    = {Mathematical Sciences Publishers},
  title        = {{Optimal lower bound on the least singular value of the shifted Ginibre ensemble}},
  doi          = {10.2140/pmp.2020.1.101},
  volume       = {1},
  year         = {2020},
}

@article{15064,
  abstract     = {We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems.},
  author       = {Bauer, U. and Edelsbrunner, Herbert and Jablonski, Grzegorz and Mrozek, M.},
  issn         = {2367-1734},
  journal      = {Journal of Applied and Computational Topology},
  number       = {4},
  pages        = {455--480},
  publisher    = {Springer Nature},
  title        = {{Čech-Delaunay gradient flow and homology inference for self-maps}},
  doi          = {10.1007/s41468-020-00058-8},
  volume       = {4},
  year         = {2020},
}

@inproceedings{15071,
  abstract     = {A mesophilic methanogenic culture, designated JL01, was isolated from Holocene permafrost in the Russian Arctic [1]. After long-term extensive cultivation at 15°C it turned out to be a tied binary culture of archaeal (JL01) and bacterial (Sphaerochaeta associata GLS2) strains.
Strain JL01 was a strict anaerobe and grew on methanol, acetate and methylamines as energy and carbon sources. Cells were irregular coccoid, non-motile, non-spore-forming, and Gram-stainpositive. Optimum conditions for growth were 24-28 oC, pH 6.8–7.3 and 0.075-0.1 M NaCl.
Phylogenetic tree reconstructions based on 16S rRNA and concatenated alignment of broadly
conserved protein-coding genes revealed its close relation to Methanosarcina mazei S-6
T (similarity 99.5%). The comparison of whole genomic sequences (ANI) of the isolate and the type strain of M.mazei was 98.5%, which is higher than the values recommended for new species. Thus strain JL01 (=VKM B-2370=JCM 31898) represents the first M. mazei isolated from permanently subzero Arcticsediments. The long-term co-cultivation of JL01 with S. associata GLS2T showed the methane production without any additional carbon and energy sources. Genome analysis of S. associata GLS2T revealed putative genes involved in methanochondroithin catabolism.},
  author       = {Oshurkova, Viktoriia and Troshina, Olga and Trubitsyn, Vladimir and Ryzhmanova, Yana and Bochkareva, Olga and Shcherbakova, Viktoria},
  booktitle    = {Proceedings of 1st International Electronic Conference on Microbiology},
  location     = {Virtual},
  publisher    = {MDPI},
  title        = {{Characterization of methanosarcina mazei JL01 isolated from holocene arctic permafrost and study of the archaeon cooperation with bacterium Sphaerochaeta associata GLS2T}},
  doi          = {10.3390/ecm2020-07116},
  year         = {2020},
}

@inproceedings{15077,
  abstract     = {We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a "gap covering" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor.},
  author       = {Alistarh, Dan-Adrian and Nadiradze, Giorgi and Sabour, Amirmojtaba},
  booktitle    = {47th International Colloquium on Automata, Languages, and Programming},
  location     = {Saarbrücken, Germany, Virtual},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Dynamic averaging load balancing on cycles}},
  doi          = {10.4230/LIPIcs.ICALP.2020.7},
  volume       = {168},
  year         = {2020},
}

@inproceedings{15082,
  abstract     = {Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.
We show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter
of this graph is either 4 or 5, independent of n.},
  author       = {Aichholzer, Oswin and Obmann, Julia and Patak, Pavel and Perz, Daniel and Tkadlec, Josef},
  booktitle    = {36th European Workshop on Computational Geometry},
  location     = {Würzburg, Germany, Virtual},
  title        = {{Disjoint tree-compatible plane perfect matchings}},
  year         = {2020},
}

@inproceedings{15086,
  abstract     = {Many communication-efficient variants of SGD use gradient quantization schemes. These schemes are often heuristic and fixed over the course of training. We empirically observe that the statistics of gradients of deep models change during the training. Motivated by this observation, we introduce two adaptive quantization schemes, ALQ and AMQ. In both schemes, processors update their compression schemes in parallel by efficiently computing sufficient statistics of a parametric distribution. We improve the validation accuracy by almost 2% on CIFAR-10 and 1% on ImageNet in challenging low-cost communication setups. Our adaptive methods are also significantly more robust to the choice of hyperparameters.

},
  author       = {Faghri, Fartash  and Tabrizian, Iman  and Markov, Ilia and Alistarh, Dan-Adrian and Roy, Daniel  and Ramezani-Kebrya, Ali },
  booktitle    = {Advances in Neural Information Processing Systems},
  isbn         = {9781713829546},
  location     = {Vancouver, Canada},
  publisher    = {Neural Information Processing Systems Foundation},
  title        = {{Adaptive gradient quantization for data-parallel SGD}},
  volume       = {33},
  year         = {2020},
}

@article{15286,
  author       = {Fäßler, Florian and Dimchev, Georgi A and Hodirnau, Victor-Valentin and Zens, Bettina and Möhl, Christoph and Bradke, Frank and Schur, Florian KM},
  issn         = {1435-8115},
  journal      = {Microscopy and Microanalysis},
  keywords     = {Instrumentation},
  number       = {S2},
  pages        = {2518--2519},
  publisher    = {Oxford University Press},
  title        = {{Cryo-electron tomography workflows for quantitative analysis of actin networks involved in cell migration}},
  doi          = {10.1017/s1431927620021881},
  volume       = {26},
  year         = {2020},
}

@article{19306,
  author       = {Kazatskaya, Anna and Yuan, Lisa and Amin-Wetzel, Niko Paresh and Philbrook, Alison and de Bono, Mario and Sengupta, Piali},
  issn         = {2578-9430},
  journal      = {microPublication Biology},
  number       = {9},
  publisher    = {Caltech Library},
  title        = {{The URX oxygen-sensing neurons in C. elegans are ciliated}},
  doi          = {10.17912/MICROPUB.BIOLOGY.000303},
  volume       = {2020},
  year         = {2020},
}

@article{5681,
  abstract     = {We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms.},
  author       = {Hikaru, Ibayashi and Wojtan, Christopher J and Thuerey, Nils and Igarashi, Takeo and Ando, Ryoichi},
  issn         = {1941-0506},
  journal      = {IEEE Transactions on Visualization and Computer Graphics},
  number       = {6},
  pages        = {2288--2302},
  publisher    = {IEEE},
  title        = {{Simulating liquids on dynamically warping grids}},
  doi          = {10.1109/TVCG.2018.2883628},
  volume       = {26},
  year         = {2020},
}

@article{6358,
  abstract     = {We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras.  Our settingcovers  arbitrary  skew-derivations  and  it  provides  a  unified  framework  that  simultaneously  generalizes  recently  constructed  transport  metrics  for  Markov  chains,  Lindblad  equations,  and  the  Fermi  Ornstein–Uhlenbeck  semigroup.   We  develop  a  non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature  bounds,  logarithmic  Sobolev  inequalities,  transport-entropy  inequalities,  andspectral gap estimates.},
  author       = {Carlen, Eric A. and Maas, Jan},
  issn         = {1572-9613},
  journal      = {Journal of Statistical Physics},
  number       = {2},
  pages        = {319--378},
  publisher    = {Springer Nature},
  title        = {{Non-commutative calculus, optimal transport and functional inequalities  in dissipative quantum systems}},
  doi          = {10.1007/s10955-019-02434-w},
  volume       = {178},
  year         = {2020},
}

@article{6359,
  abstract     = {The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients.},
  author       = {Dareiotis, Konstantinos and Gerencser, Mate},
  issn         = {1083-6489},
  journal      = {Electronic Journal of Probability},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift}},
  doi          = {10.1214/20-EJP479},
  volume       = {25},
  year         = {2020},
}

@inbook{19986,
  abstract     = {For non-probabilistic programs, a key question in static analysis is termination, which asks whether a given program terminates under a given initial condition. In the presence of probabilistic behaviour, there are two fundamental extensions of the termination question: (a) the almost-sure termination question, which asks whether the termination probability is 1; and (b) the bounded-time termination question, which asks whether the expected termination time is bounded. There are many active research directions to address these two questions; one important such direction is the use of martingale theory for termination analysis. In this chapter, we survey the main techniques of the martingale-based approach to the termination analysis of probabilistic programs.},
  author       = {Chatterjee, Krishnendu and Fu, Hongfei and Novotný, Petr},
  booktitle    = {Foundations of Probabilistic Programming},
  isbn         = {9781108488518},
  pages        = {221--258},
  publisher    = {Cambridge University Press},
  title        = {{Termination Analysis of Probabilistic Programs with Martingales}},
  doi          = {10.1017/9781108770750.008},
  year         = {2020},
}

@unpublished{10012,
  abstract     = {We prove that in the absence of topological changes, the notion of BV solutions to planar multiphase mean curvature flow does not allow for a mechanism for (unphysical) non-uniqueness. Our approach is based on the local structure of the energy landscape near a classical evolution by mean curvature. Mean curvature flow being the gradient flow of the surface energy functional, we develop a gradient-flow analogue of the notion of calibrations. Just like the existence of a calibration guarantees that one has reached a global minimum in the energy landscape, the existence of a "gradient flow calibration" ensures that the route of steepest descent in the energy landscape is unique and stable.},
  author       = {Fischer, Julian L and Hensel, Sebastian and Laux, Tim and Simon, Thilo},
  booktitle    = {arXiv},
  title        = {{The local structure of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions}},
  doi          = {10.48550/arXiv.2003.05478},
  year         = {2020},
}

@unpublished{10022,
  abstract     = {We consider finite-volume approximations of Fokker-Planck equations on bounded convex domains in R^d and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker-Planck equation via the method of Evolutionary Γ-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalising the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality.},
  author       = {Forkert, Dominik L and Maas, Jan and Portinale, Lorenzo},
  booktitle    = {arXiv},
  title        = {{Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions}},
  doi          = {10.48550/arXiv.2008.10962},
  year         = {2020},
}