Related papers: Continuum limit of $p$-Laplacian evolution problem…

We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does…

We generalize the diffusion-limited aggregation by issuing many randomly-walking particles, which stick to a cluster at the discrete time unit providing its growth. Using simple combinatorial arguments we determine probabilities of…

A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…

We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…

We consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The method involves…

We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more…

We consider the natural time-dependent fractional $p$-Laplacian equation posed in the whole Euclidean space, with parameters $p>2$ and $s\in (0,1)$ (fractional exponent). We show that the Cauchy Problem for data in the Lebesgue $L^q$ spaces…

The independent set problem is NP-hard and particularly difficult to solve in large sparse graphs. In this work, we develop an advanced evolutionary algorithm, which incorporates kernelization techniques to compute large independent sets in…

We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements, and a new…

This paper investigates the use of methods from partial differential equations and the Calculus of variations to study learning problems that are regularized using graph Laplacians. Graph Laplacians are a powerful, flexible method for…

We prove discrete-to-continuum convergence for dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with energy density having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer,…

On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…

We consider the natural time-dependent fractional $p$-Laplacian equation posed in the whole Euclidean space, with parameter $1<p<2$ and fractional exponent $s\in (0,1)$. Rather standard theory shows that the Cauchy Problem for data in the…

In this note we correct the proof of Proposition 4 in our paper "The Laplacian Spectrum of Large Graphs Sampled from Graphons" (arXiv:2004.09177) and we improve several results therein. To this end, we prove a new concentration lemma about…

This paper establishes the emergence of slowly moving transition layer solutions for the $p$-Laplacian (nonlinear) evolution equation, \[ u_t = \varepsilon^p(|u_x|^{p-2}u_x)_x - F'(u), \qquad x \in (a,b), \; t > 0, \] where $\varepsilon>0$…

Let $G=(V, E)$ be a locally finite connected graph satisfying curvature-dimension conditions ($CDE(n, 0)$ or its strengthened version $CDE'(n, 0))$) and polynomial volume growth conditions of degree $m$. We systematically establish sharp…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

We analyze the problem of approximating a smooth quantum waveguide with a quantum graph. We consider a planar curve with compactly supported curvature and a strip of constant width around the curve. We rescale the curvature and the width in…

Maximal parabolic $L^p$-regularity of linear parabolic equations on an evolving surface is shown by pulling back the problem to the initial surface and studying the maximal $L^p$-regularity on a fixed surface. By freezing the coefficients…

We study the limit of first eigenfunctions of (discrete) $p$-Laplacian on a finite subset of a graph with Dirichlet boundary condition, as $p\to 1.$ We prove that up to a subsequence, they converge to a summation of characteristic functions…