Related papers: Graph gradient flows : from discrete to continuum
We develop a method to calculate the persistent currents and their spatial distribution (and transport properties) on graphs made of quasi-1D diffusive wires. They are directly related to the field derivatives of the determinant of a matrix…
We study the convergence of a modified Kaeher-Ricci flow defined by Zhou Zhang. We show that the flow converges to a singular metric when the limit class is degenerate. This proves a conjecture of Zhang.
This work provides a comprehensive derivation of the parameter gradients for GATv2 [4], a widely used implementation of Graph Attention Networks (GATs). GATs have proven to be powerful frameworks for processing graph-structured data and,…
In this paper we give a description of the asymptotic behavior, as $\epsilon\to 0$, of the $\epsilon$-gradient flow in the finite dimensional case. Under very general assumptions we prove that it converges to an evolution obtained by…
Allen-Cahn equation is a fundamental continuum model that describes phase transitions in multi-component mixtures. We prove the existence of traveling waves for vector valued Allen-Cahn equations in the context of Ginzburg-Landau theories;…
We rigorously derive the dense graph limit of a discrete model describing the formation of biological transportation networks. The discrete model, defined on undirected graphs with pressure-driven flows, incorporates a convex energy…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…
We prove the convergence of a particle method for the approximation of diffusive gradient flows in one dimension. This method relies on the discretisation of the energy via non-overlapping balls centred at the particles and preserves the…
We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…
In this sequence of two papers, we introduce a curvature flow on (mixed) weighted graphs which is based on the Bakry-\'Emery calculus. The flow is described via a time-continuous evolution through the weighting schemes. By adapting this…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…
We describe the set of all Dirichlet forms associated to a given infinite graph in terms of Dirichlet forms on its Royden boundary. Our approach is purely analytical and uses form methods.
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…
We introduce a modification of the Tur\'an density of ordered graphs and investigate this graph parameter.
We study the existence of solutions of Ricci flow equations of Ollivier-Lin-Lu-Yau curvature defined on weighted graphs. Our work is motivated by\cite{NLLG} in which the discrete time Ricci flow algorithm has been applied successfully as a…
We consider mean curvature flow of an initial surface that is the graph of a function over some domain of definition in $R^n$. If the graph is not complete then we impose a constant Dirichlet boundary condition at the boundary of the…
The classical Lorenz flow, and any flow which is close to it in the $C^2$-topology, satisfies a Central Limit Theorem (CLT). We prove that the variance in the CLT varies continuously.