English
Related papers

Related papers: Nonlocal $p$-Laplacian evolution problems on graph…

200 papers

In this paper, we establish the well-posedness and large-time asymptotic behavior of viscosity solutions to singular/degenerate parabolic $p$-Laplacian equations with general capillary-type boundary conditions, including Neumann and…

Analysis of PDEs · Mathematics 2026-05-13 Zhenghuan Gao , Jin Yan , Yang Zhou

The purpose of this paper is to show that the randomized weighted $p$-Laplacian evolution equation given by \begin{align} \label{eveqrand} \begin{cases} U^{\prime}(t)(\omega) =\text{Div} \left( g(\omega) |DU(t)(\omega)|^{p-2}DU(t)(\omega)…

Functional Analysis · Mathematics 2018-01-15 Alexander Nerlich

In this paper, we consider the existence of solutions of the following nonhomogeneous fractional $p(x,.)$-Laplacian Dirichlet problem: \begin{equation*} \left\{\begin{aligned} \Big(-\Delta_{p(x,.)}\Big)^s u (x)&=f(x, u) &\text { in }&…

Analysis of PDEs · Mathematics 2024-06-27 Achraf El wazna , Azeddine Baalal

We consider systems of stochastic evolutionary equations of the $p$-Laplace type. We establish convergence rates for a finite-element based space-time approximation, where the error is measured in a suitable quasi-norm. Under natural…

Analysis of PDEs · Mathematics 2021-05-10 Dominic Breit , Martina Hofmanova , Sebastien Loisel

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance…

Discrete Mathematics · Computer Science 2026-05-07 He Sun , Danny Vagnozzi

We prove new existence and uniqueness results for weak solutions to non-homogeneous initial-boundary value problems for parabolic equations modeled on the evolution of the p-Laplacian.

Analysis of PDEs · Mathematics 2008-09-22 Magnus Fontes

Semi-supervised and unsupervised machine learning methods often rely on graphs to model data, prompting research on how theoretical properties of operators on graphs are leveraged in learning problems. While most of the existing literature…

Analysis of PDEs · Mathematics 2021-01-12 Amber Yuan , Jeff Calder , Braxton Osting

We show that the solutions to the nonlocal obstacle problems for the nonlocal $-\Delta_p^s$ operator, when the fractional parameter $s\to\sigma$ for $0<\sigma\leq1$, converge to the solution of the corresponding obstacle problem for…

Analysis of PDEs · Mathematics 2025-05-14 Catharine W. K. Lo , José Francisco Rodrigues

M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the…

Combinatorics · Mathematics 2013-08-16 Wenxi Hong , Lihua You

Nonlinear reformulations of the spectral clustering method have gained a lot of recent attention due to their increased numerical benefits and their solid mathematical background. We present a novel direct multiway spectral clustering…

Machine Learning · Computer Science 2021-11-29 Dimosthenis Pasadakis , Christie Louis Alappat , Olaf Schenk , Gerhard Wellein

We establish the solvability of the $L^p$-Dirichlet and $L^{p^\prime}$-Neumann problems for the Laplacian for $p\in (\frac{n}{n-1}-\varepsilon,\frac{2n}{n-1}]$ for some $\varepsilon>0$ in $2$-sided chord-arc domains with unbounded boundary…

Analysis of PDEs · Mathematics 2025-05-08 Ignasi Guillén-Mola

Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…

Machine Learning · Computer Science 2022-05-30 Csaba Toth , Darrick Lee , Celia Hacker , Harald Oberhauser

We define a new family of similarity and distance measures on graphs, and explore their theoretical properties in comparison to conventional distance metrics. These measures are defined by the solution(s) to an optimization problem which…

Machine Learning · Computer Science 2019-09-11 C. B. Scott , Eric Mjolsness

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…

Combinatorics · Mathematics 2015-10-08 Xiao-Dong Zhang

We study the regularity of the free boundary in the obstacle for the $p$-Laplacian, $\min\bigl\{-\Delta_p u,\,u-\varphi\bigr\}=0$ in $\Omega\subset\mathbb R^n$. Here, $\Delta_p u=\textrm{div}\bigl(|\nabla u|^{p-2}\nabla u\bigr)$, and…

Analysis of PDEs · Mathematics 2017-01-20 Alessio Figalli , Brian Krummel , Xavier Ros-Oton

This paper provides a construction method of the nearest graph Laplacian to a matrix identified from measurement data of graph Laplacian dynamics that include biochemical systems, synchronization systems, and multi-agent systems. We…

Optimization and Control · Mathematics 2018-06-20 Kazuhiro Sato

We give a lower bound for the $\ell^p$-distortion $c_p(X)$ of finite graphs $X$, depending on the first eigenvalue $\lambda_1^{(p)}(X)$ of the $p$-Laplacian and the maximal displacement of permutations of vertices. For a $k$-regular…

Metric Geometry · Mathematics 2017-05-17 Pierre-Nicolas Jolissaint , Alain Valette

We investigate the Chern-Simons Higgs models for p-Laplacian on a connected finite graph, employing topological degree theory as our main tool. Notably, we overcome the difficulties arising from the nonlinearity of p-Laplacian operator and…

Analysis of PDEs · Mathematics 2025-12-01 Chunlian Liu , Yating Ge , Linfeng Wang

In this paper, we prove the existence of a weak solution for the Dirichlet boundary value problem related to the $p(x)-$Laplacian $$ -\mbox{div}(|\nabla u|^{p(x)-2}\nabla u)+u\in -[\underline{g}(x,u),\overline{g}(x,u)], $$ by using the…

Analysis of PDEs · Mathematics 2019-11-05 Mustapha Ait Hammou

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

Data Structures and Algorithms · Computer Science 2024-09-17 Jingbang Chen , Mehrdad Ghadiri , Hoai-An Nguyen , Richard Peng , Junzhao Yang
‹ Prev 1 4 5 6 7 8 10 Next ›