Related papers: Bochner formula and Bernstein type estimates on lo…

We introduce a semigroup framework for Laplacians on directed hypergraphs, extending the classical heat flow models on graphs and establishing hypergraphs as prototypical models for non-Markovian diffusion. We apply spectral surgery methods…

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

How to obtain a graph from data samples is an important problem in graph signal processing. One way to formulate this graph learning problem is based on Gaussian maximum likelihood estimation, possibly under particular topology constraints.…

We derive a local index theorem in Quillen's form for families of Cauchy-Riemann operators on orbifold Riemann surfaces (or Riemann orbisurfaces) that are quotients of the hyperbolic plane by the action of cofinite finitely generated…

We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the…

We provide a Lax-Oleinik-type representation formula for solutions of time-dependent Hamilton-Jacobi equations, posed on a network with a rather general geometry, under standard assumptions on the Hamiltonians. It depends on a given initial…

We establish the local continuity of locally bounded weak solutions (temperatures) to the doubly singular parabolic equation modeling the phase transition of a material: \[ \partial_t \beta(u)-\Delta_p u\ni 0\quad\text{ for…

We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…

In this paper, we study the Cauchy problem for a heat equation governed by a mixed local--nonlocal diffusion operator with spatially irregular coefficients. We first establish classical well-posedness in an energy framework for bounded,…

In this paper, we study the local backward problem of a linear heat equation with time-dependent coefficients under the Dirichlet boundary condition. Precisely, we recover the initial data from the observation on a subdomain at some later…

Using the theory of $L^p$-graphons (Borgs et al, 2014), we derive and rigorously justify the continuum limit for systems of differential equations on sparse random graphs. Specifically, we show that the solutions of the initial value…

We consider the Cauchy problem for heat equation with fractional Laplacian and exponential nonlinearity. We establish local well-posedness result in Orlicz spaces. We derive the existence of global solutions for small initial data. We…

We prove the maximal local regularity of weak solutions to the parabolic problem associated with the fractional Laplacian with homogeneous Dirichlet boundary conditions on an arbitrary bounded open set $\Omega\subset\mathbb{R}^N$. Proofs…

We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach…

Let $G=(V,E)$ be a locally finite connected weighted graph, $\Delta$ be the usual graph Laplacian. In this paper, we study the blow-up problems for the nonlinear parabolic equation $u_t=\Delta u + f(u)$ on $G$. The blow-up phenomenons of…

We discuss computational and qualitative aspects of the fractional Plateau and the prescribed fractional mean curvature problems on bounded domains subject to exterior data being a subgraph. We recast these problems in terms of energy…

In this paper, we study large-time asymptotics for heat and fractional heat equations in two discrete settings: the full lattice \(\mathbb Z^d\) and finite connected subgraphs with Dirichlet boundary condition. These results provide a…

This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In this problem, the objective is to add as few edges as possible…

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…

There are local operators on (labeled) graphs $G$ with labels $(g_{ij})$ coming from a finite field. If the filed is binary, in other words, if the graph is ordinary, the operation is just the local complementation. That is, to choose a…