Related papers: The Total Variation Flow in Metric Graphs
This paper considers and proposes some algorithms to compute the mean curvature flow under topological changes. Instead of solving the fully nonlinear partial differential equations based on the level set approach, we propose some…
The aim of this paper is to provide conditions which ensure that the affinely transformed partial sums of a strictly stationary process converge in distribution to an infinite variance stable distribution. Conditions for this convergence to…
We consider a model of axisymmetric flows for a free boundary vortex embedded in a statically stable fluid at rest. We identify the boundary of the vortex by solving a variational problem. Then, we reduce the analysis of the dynamics of the…
We present a method for learning neural representations of flow maps from time-varying vector field data. The flow map is pervasive within the area of flow visualization, as it is foundational to numerous visualization techniques, e.g.…
Let $M$ be a complete Riemannian manifold which either is compact or has a pole, and let $\varphi$ be a positive smooth function on $M$. In the warped product $M\times_\varphi\mathbb R$, we study the flow by the mean curvature of a locally…
The main purpose of this paper is mathematical analysis on time-periodic flows of electrons and holes in semiconductors. The flows appear in a situation that alternating-current voltages are applied to devices. In this paper, we study the…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
The asymptotic study of percolation on finite transitive graphs is considered. Several questions and very few answers regarding percolation on finite graphs are presented.
Hypergraphs allow one to encode higher-order relationships in data and are thus a very flexible modeling tool. Current learning methods are either based on approximations of the hypergraphs via graphs or on tensor methods which are only…
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
We devise the first constant-factor approximation algorithm for finding an integral multi-commodity flow of maximum total value for instances where the supply graph together with the demand edges can be embedded on an orientable surface of…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
The aim of this work is studying translating graphs by mean curvature flow in $\Real^3$. We prove non-existence of complete translating graphs over bounded domains in $\Real^2$. Furthermore, we show that there are only three types of…
The aim of this thesis is to derive new gradient estimates for parabolic equations. The gradient estimates found are independent of the regularity of the initial data. This allows us to prove the existence of solutions to problems that have…
We consider the volume constrained fractional mean curvature flow of a nearly spherical set, and prove long time existence and asymptotic convergence to a ball. The result applies in particular to convex initial data, under the assumption…
We propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would increase the maximal flow. Initial computation results for some…
This work presents mixed variational flows (MixFlows), a new variational family that consists of a mixture of repeated applications of a map to an initial reference distribution. First, we provide efficient algorithms for i.i.d. sampling,…
We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…
Some approach to the solution of boundary value problems for finding functions, which are analytical in a wedge, is proposed. If the ratio of the angle at the wedge vertex to a number \pi is rational, then the boundary value problem is…