Fedor Manin

dblp:89/4096 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0002-4545-6998ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational geometry · 75% Graph algorithms and graph theory · 25%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › distance measures
gromov-hausdorff distance
1.012026
Lower Bounding the Gromov-Hausdorff Distance in Metric Graphs · SoCG 2026
Computational geometry
metric geometry
1.012026
Lower Bounding the Gromov-Hausdorff Distance in Metric Graphs · SoCG 2026
Graph algorithms and graph theory › metric graph theory
metric graphs
1.012026
Lower Bounding the Gromov-Hausdorff Distance in Metric Graphs · SoCG 2026
Computational geometry
topological data analysis
1.012026
Lower Bounding the Gromov-Hausdorff Distance in Metric Graphs · SoCG 2026

Methods — techniques the papers use, named apart from their topics

topology · 1.0metric geometry · 1.0
YearPublicationVenuePosition
2026 Lower Bounding the Gromov-Hausdorff Distance in Metric Graphs
abstract
Let $G$ be a finite, connected metric graph and let $X\subseteq G$ be a subset. If $X$ is sufficiently dense in $G$, we show that the Gromov--Hausdorff distance matches the Hausdorff distance, namely $d_\gh(G,X)=d_\h(G,X)$. When the metric graph is the circle $G=S^1$ with circumference $2π$, a recent study established the equality $d_\gh(S^1,X)=d_\h(S^1,X)$ whenever $d_\gh(S^1,X)<\fracπ{6}$. Our results relax this hypothesis to $d_\gh(S^1,X)<\fracπ{3}$, and furthermore, we show that the constant $\fracπ{3}$ is the best possible. We lower bound the Gromov--Hausdorff distance $d_\gh(G,X)$ by the Hausdorff distance $d_\h(G,X)$ via a simple topological obstruction: the existence of a possibly discontinuous function $f\colon G \to X$ with too small distortion contradicts the connectedness of $G$.
Henry Adams, Sushovan Majhi, Fedor Manin, Ziga Virk, Nicolò Zava
SoCG3
2023 Topology and Local Geometry of the Eden Model
abstract
Abstract The Eden cell growth model is a simple discrete stochastic process which produces a “blob” (aggregation of cells) in $$\mathbb {R}^d$$ Rd : start with one cube in the regular grid, and at each time step add a neighboring cube uniformly at random. This process has been used as a model for the growth of aggregations, tumors, and bacterial colonies and the healing of wounds, among other natural processes. Here, we study the topology and local geometry of the resulting structure, establishing asymptotic bounds for Betti numbers. Our main result is that the Betti numbers at timetgrow at a rate between $$t^{(d-1)/d}$$ t(d-1)/d and $$P_d(t)$$ Pd(t) , where $$P_d(t)$$ Pd(t) is the size of the site perimeter. Assuming a widely believed conjecture, this establishes the rate of growth of the Betti numbers in every dimension. We also present the results of computational experiments on finer aspects of the geometry and topology, such as persistent homology and the distribution of shapes of holes.
Fedor Manin, Érika Roldán, Benjamin Schweinhart
Discret. Comput. Geom.1