Searcharxiv⌕ Search

arXiv subjects

Delio Mugnolo

Publications and source records attributed to Delio Mugnolo.

At least 55 records · Page 3Linked to original sources

Random evolution equations: well-posedness, asymptotics, and applications to graphs

We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for pathwise convergence in norm of the (random) propagator towards a (deterministic) steady state. We apply our findings in two environments with randomly evolving features: ensembles of difference operators on combinatorial graphs, or else of differential operators on metric graphs.

math.DS↗

Schrödinger and polyharmonic operators on infinite graphs: Parabolic well-posedness and p-independence of spectra

We analyze properties of semigroups generated by Schrödinger operators $-Δ+V$ or polyharmonic operators $-(-Δ)^m$, on metric graphs both on $L^p$-spaces and spaces of continuous functions. In the case of spatially constant potentials, we provide a semi-explicit formula for their kernel. Under an additional sub-exponential growth condition on the graph, we prove analyticity, ultracontractivity, and pointwise kernel estimates for these semigroups; we also show that their generators' spectra coincide on all relevant function spaces and present a Kre\uın-type dimension reduction, showing that their spectral values are determined by the spectra of generalized discrete Laplacians acting on various spaces of functions supported on combinatorial graphs.

math.SP↗

Ultracontractivity and Gaussian bounds for evolution families associated with non-autonomous forms

We develop a variational approach in order to study the qualitative properties of non-autonomous parabolic equations. Based on the method of product integrals, we discuss long-time behavior, invariance properties, and ultracontractivity of evolution families in Hilbert space. Our main results give sufficient conditions for the heat kernel of the evolution family to satisfy Gaussian-type bounds. Along the way, we study examples of non-autonomous equations on graphs, metric graphs, and domains.

math.AP↗

Laplacians with point interactions -- expected and unexpected spectral properties

We study the one-dimensional Laplace operator with point interactions on the real line identified with two copies of the half-line $[0,\infty)$. All possible boundary conditions that define generators of $C_0$-semigroups on $L^2\big([0,\infty)\big)\oplus L^2\big([0,\infty)\big)$ are characterized. Here, the Cayley transform of the boundary conditions plays an important role and using an explicit representation of the Green's functions, it allows us to study invariance properties of semigroups.

math.FA↗

Matrix methods for wave equations

In analogy to a characterisation of operator matrices generating $C_0$-semigroups due to R. Nagel (\cite{[Na89]}), we give conditions on its entries in order that a $2\times 2$ operator matrix generates a cosine operator function. We apply this to systems of wave equations, to second order initial-boundary value problems, and to overdamped wave equations.

math.FA↗

Surgery principles for the spectral analysis of quantum graphs

We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $δ$-type), which show how various types of changes of a local or localised nature to a graph impact the spectrum of the Laplacian. Many of these principles are entirely new, these include "transplantation" of volume within a graph based on the behaviour of its eigenfunctions, as well as "unfolding" of local cycles and pendants. In other cases we establish sharp generalisations, extensions and refinements of known eigenvalue inequalities resulting from graph modification, such as vertex gluing, adjustment of vertex conditions and introducing new pendant subgraphs. To illustrate our techniques we derive a new eigenvalue estimate which uses the size of the doubly connected part of a metric graph to estimate the spectral gap. This quantitative isoperimetric-type inequality interpolates between two known estimates---one assuming the entire graph is doubly connected and the other making no connectivity assumption (and producing a weaker bound)---and includes them as special cases.

math.SP↗

Bi-Laplacians on graphs and networks

We study the differential operator $A=\frac{d^4}{dx^4}$ acting on a connected network $\mathcal{G}$ along with $\mathcal L^2$, the square of the discrete Laplacian acting on a connected discrete graph $\mathsf{G}$. For both operators we discuss well-posedness of the associated {linear} parabolic problems \[ \frac{\partial u}{\partial t}=-Au,\qquad\frac{df}{dt}=-\mathcal L^2 f, \] on $L^p(\mathcal{G})$ or $\ell^p(\mathsf{V})$, respectively, for $1\leq p\leq\infty$. In view of the well-known lack of parabolic maximum principle for all elliptic differential operators of order $2N$ for $N>1$, our most surprising finding is that, after some transient time, the parabolic equations driven by $-A$ may display Markovian features, depending on the imposed transmission conditions in the vertices. Analogous results seem to be unknown in the case of general domains and even bounded intervals. Our analysis is based on a detailed study of bi-harmonic functions complemented by simple combinatorial arguments. We elaborate on analogous issues for the discrete bi-Laplacian; a characterization of complete graphs in terms of the Markovian property of the semigroup generated by $-\mathcal L^2$ is also presented.

math.AP↗

Stochastic Hybrid Models of Gene Regulatory Networks - A PDE Approach

A widely used approach to describe the dynamics of gene regulatory networks is based on the chemical master equation, which considers probability distributions over all possible combinations of molecular counts. The analysis of such models is extremely challenging due to their large discrete state space. We therefore propose a hybrid approximation approach based on a system of partial differential equations, where we assume a continuous-deterministic evolution for the protein counts. We discuss efficient analysis methods for both modeling approaches and compare their performance. We show that the hybrid approach yields accurate results for sufficiently large molecule counts, while reducing the computational effort from one ordinary differential equation for each state to one partial differential equation for each mode of the system. Furthermore, we give an analytical steady-state solution of the hybrid model for the case of a self-regulatory gene.

q-bio.MN↗

Dynamical systems associated with adjacency matrices

We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss in detail qualitative properties of solutions to these problems by quadratic form methods. We distinguish between backward and forward evolution equations: the latter have typical features of diffusive processes, but cannot be well-posed on graphs with unbounded degree. On the contrary, well-posedness of backward equations is a typical feature of line graphs. We suggest how to detect even cycles and/or couples of odd cycles on graphs by studying backward equations for the adjacency matrix on their line graph.

math.DS↗

Edge connectivity and the spectral gap of combinatorial and quantum graphs

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph disconnected. On combinatorial graphs, one of the bounds is the well-known inequality of Fiedler, of which we give a new variational proof. On quantum graphs, the corresponding bound generalizes a recent result of Band and Lévy. All proofs are general enough to yield corresponding estimates for the $p$-Laplacian and allow us to identify the minimizers. Based on the Betti number of the graph, we also derive upper and lower bounds on all eigenvalues which are "asymptotically correct", i.e. agree with the Weyl asymptotics for the eigenvalues of the quantum graph. In particular, the lower bounds improve the bounds of Friedlander on any given graph for all but finitely many eigenvalues, while the upper bounds improve recent results of Ariturk. Our estimates are also used to derive bounds on the eigenvalues of the normalized Laplacian matrix that improve known bounds of spectral graph theory.

math.SP↗

Airy-type evolution equations on star graphs

In the present paper the Airy operator on star graphs is defined and studied. The Airy operator is a third order differential operator arising in different contexts, but our main concern is related to its role as the linear part of the Korteweg-de Vries equation, usually studied on a line or a half-line. The first problem treated and solved is its correct definition, with different characterizations, as a skew-adjoint operator on a star graph, a set of lines connecting at a common vertex representing, for example, a network of branching channels. A necessary condition turns out to be that the graph is balanced, i.e. there is the same number of ingoing and outgoing edges at the vertex. The simplest example is that of the line with a point interaction at the vertex. In these cases the Airy dynamics is given by a unitary or isometric (in the real case) group. In particular the analysis provides the complete classification of boundary conditions giving momentum (i.e., $L^2$-norm of the solution) preserving evolution on the graph. A second more general problem here solved is the characterization of conditions under which the Airy operator generates a contraction semigroup. In this case unbalanced star graphs are allowed. In both unitary and contraction dynamics, restrictions on admissible boundary conditions occur if conservation of mass (i.e., integral of the solution) is further imposed. The above well posedness results can be considered preliminary to the analysis of nonlinear wave propagation on branching structures.

math-ph↗

A variational approach to strongly damped wave equations

We discuss a Hilbert space method that allows to prove analytical well-posedness of a class of linear strongly damped wave equations. The main technical tool is a perturbation lemma for sesquilinear forms, which seems to be new. In most common linear cases we can furthermore apply a recent result due to Crouzeix--Haase, thus extending several known results and obtaining optimal analyticity angle.

math.AP↗

Epidemic Outbreaks in Networks with Equitable or Almost-Equitable Partitions

We study the diffusion of epidemics on networks that are partitioned into local communities. The gross structure of hierarchical networks of this kind can be described by a quotient graph. The rationale of this approach is that individuals infect those belonging to the same community with higher probability than individuals in other communities. In community models the nodal infection probability is thus expected to depend mainly on the interaction of a few, large interconnected clusters. In this work, we describe the epidemic process as a continuous-time individual-based susceptible-infected-susceptible (SIS) model using a first-order mean-field approximation. A key feature of our model is that the spectral radius of this smaller quotient graph (which only captures the macroscopic structure of the community network) is all we need to know in order to decide whether the overall healthy-state defines a globally asymptotically stable or an unstable equilibrium. Indeed, the spectral radius is related to the epidemic threshold of the system. Moreover we prove that, above the threshold, another steady-state exists that can be computed using a lower-dimensional dynamical system associated with the evolution of the process on the quotient graph. Our investigations are based on the graph-theoretical notion of equitable partition and of its recent and rather flexible generalization, that of almost equitable partition.

cs.SI↗

On the Spectral Gap of a Quantum Graph

We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and combinatorial properties of the graph: its total length, diameter, number of vertices and number of edges. We investigate which combinations of parameters are necessary to obtain non-trivial upper and lower bounds and obtain a number of sharp estimates in terms of these parameters. We also show that, in contrast to the Laplacian matrix on a combinatorial graph, no bound depending only on the diameter is possible. As a special case of our results on metric graphs, we deduce estimates for the normalised Laplacian matrix on combinatorial graphs which, surprisingly, are sometimes sharper than the ones obtained by purely combinatorial methods in the graph theoretical literature.

math.SP↗

General Cheeger inequalities for p-Laplacians on graphs

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 generally, we do not impose any boundedness assumption on the geometry. This is achieved by a novel definition of the measure of the boundary which is using the idea of intrinsic metrics. For the non-normalized case, our bounds on the spectral gap of p-Laplacians are already significantly better for finite graphs and for infinite graphs they yield non-trivial bounds even in the case of unbounded vertex degree. We, furthermore, give upper bounds by the Cheeger constant and by the exponential volume growth of distance balls.

math.CO↗

Time regularity and long-time behavior of parabolic $p$-Laplace equations on infinite graphs

We consider the so-called \emph{discrete $p$-Laplacian}, a nonlinear difference operator that acts on functions defined on the nodes of a possibly infinite graph. We study the associated nonlinear Cauchy problem and identify the generator of the associated nonlinear semigroups. We prove higher order time regularity of the solutions. We investigate the long-time behavior of the solutions and discuss in particular finite extinction time and conservation of mass. Namely, on one hand, for small $p$ if an infinite graph satisfies some isoperimetric inequality, then the solution to the parabolic $p$-Laplace equation vanishes in finite time; on the other hand, for large $p,$ these parabolic $p$-Laplace equations always enjoy conservation of mass.

math.DS↗