Paweł Dłotko

Paweł Dłotko

Auto-generated profile, based on publicly available information

Paweł Dłotko

Dioscuri Centre in Topological Data Analysis, Mathematical Institute, Polish Academy of Sciences, Warsaw, Poland

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 June 2017 in Frontiers in Computational Neuroscience
Verified
Journal Article
Open access
PDF file
MRMichael W. Reimann
Michael W. Reimann
MNMax Nolte
Max Nolte
MSMartina Scolamiero
Martina Scolamiero
KTKatharine Turner
Katharine Turner
RPRodrigo Perin
Rodrigo Perin
CDChristiane Debono
Christiane Debono
The lack of a formal link between neural network structure and its emergent function has hampered our understanding of how the brain processes information. We have now come closer to describing such a link by taking the direction of synaptic transmission into account, constructing graphs of a network that reflect the direction of information flow, and analyzing these directed graphs using algebraic topology. Applying this approach to a local network of neurons in the neocortex revealed a remarkably intricate and previously unseen topology of synaptic connectivity. The synaptic network contains an abundance of cliques of neurons bound into cavities that guide the emergence of correlated activity. In response to stimuli, correlated activity binds synaptically connected neurons into functional cliques and cavities that evolve in a stereotypical sequence toward peak complexity. We propose that the brain processes stimuli by forming increasingly complex functional cliques and cavities.

3 October 2017 in Neuroinformatics
Verified
Journal Article
Open access
PDF file
LKLida Kanari
Lida Kanari
PDPaweł Dłotko
Paweł Dłotko
MSMartina Scolamiero
Martina Scolamiero
RLRan Levi
Ran Levi
JSJulian Shillcock
Julian Shillcock
HMHenry Markram
Henry Markram
Many biological systems consist of branching structures that exhibit a wide variety of shapes. Our understanding of their systematic roles is hampered from the start by the lack of a fundamental means of standardizing the description of complex branching patterns, such as those of neuronal trees. To solve this problem, we have invented the Topological Morphology Descriptor (TMD), a method for encoding the spatial structure of any tree as a “barcode”, a unique topological signature. As opposed to traditional morphometrics, the TMD couples the topology of the branches with their spatial extents by tracking their topological evolution in 3-dimensional space. We prove that neuronal trees, as well as stochastically generated trees, can be accurately categorized based on their TMD profiles. The TMD retains sufficient global and local information to create an unbiased benchmark test for their categorization and is able to quantify and characterize the structural differences between distinct morphological groups. The use of this mathematically rigorous method will advance our understanding of the anatomy and diversity of branching morphologies.

1 January 2017 in Journal of Symbolic Computation
Verified
Journal Article
Closed access
PBPeter Bubenik
Peter Bubenik
PDPaweł Dłotko
Paweł Dłotko

23 May 2017 in Nature Communications
Verified
Journal Article
Open access
PDF file
YLYongjin Lee
Yongjin Lee
SBSenja Barthel
Senja Barthel
PDPaweł Dłotko
Paweł Dłotko
SMS. Mohamad Moosavi
S. Mohamad Moosavi
KHKathryn Hess
Kathryn Hess
BSBerend Smit
Berend Smit
In most applications of nanoporous materials the pore structure is as important as the chemical composition as a determinant of performance. For example, one can alter performance in applications like carbon capture or methane storage by orders of magnitude by only modifying the pore structure. For these applications it is therefore important to identify the optimal pore geometry and use this information to find similar materials. However, the mathematical language and tools to identify materials with similar pore structures, but different composition, has been lacking. We develop a pore recognition approach to quantify similarity of pore structures and classify them using topological data analysis. This allows us to identify materials with similar pore geometries, and to screen for materials that are similar to given top-performing structures. Using methane storage as a case study, we also show that materials can be divided into topologically distinct classes requiring different optimization strategies.

1 April 2012 in Applicable Algebra in Engineering, Communication and Computing
Verified
Journal Article
Open access
PDF file
PDP. Dłotko
P. Dłotko
RGR. Ghrist
R. Ghrist
MJM. Juda
M. Juda
MMM. Mrozek
M. Mrozek
Recent work on algebraic-topological methods for verifying coverage in planar sensor networks relied exclusively on centralized computation: a limiting constraint for large networks. This paper presents a distributed algorithm for homology computation over a sensor network, for purposes of verifying coverage. The techniques involve reduction and coreduction of simplicial complexes, and are of independent interest. Verification of the ensuing algorithms is proved, and simulations detail the improved network efficiency and performance.

14 October 2010 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
PDPaweł Dłotko
Paweł Dłotko
TKTomasz Kaczynski
Tomasz Kaczynski
MMMarian Mrozek
Marian Mrozek
TWThomas Wanner
Thomas Wanner
In this paper we present a new algorithm for computing the homology of regular CW-complexes. This algorithm is based on the coreduction algorithm due to Mrozek and Batko and consists essentially of a geometric preprocessing algorithm for the standard chain complex generated by a CW-complex. By employing the concept of S-complexes the original chain complex can—in all known practical cases—be reduced to a significantly smaller S-complex with isomorphic homology, which can then be computed using standard methods. Furthermore, we demonstrate that in the context of non-uniform cubical grids this method significantly improves currently available algorithms based on uniform cubical grids.