English
Related papers

Related papers: The heat semigroup and Brownian motion on strip co…

200 papers

A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…

Discrete Mathematics · Computer Science 2015-03-20 Martin Milanič , Romeo Rizzi , Alexandru I. Tomescu

A widely-used operation on graphs is local clustering, i.e., extracting a well-characterized community around a seed node without the need to process the whole graph. Recently local motif clustering has been proposed: it looks for a local…

Social and Information Networks · Computer Science 2022-05-13 Adil Chhabra , Marcelo Fonseca Faraj , Christian Schulz

Classical and non classical Besov and Triebel-Lizorkin spaces with complete range of indices are developed in the general setting of Dirichlet space with a doubling measure and local scale-invariant Poincar\'e inequality. This leads to Heat…

Functional Analysis · Mathematics 2014-06-10 Gerard Kerkyacharian , Pencho Petrushev

The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the graphs of several communication networks at the IP-layer, which are subgraphs of the much larger global IP-layer network. We show that the…

Spectral Theory · Mathematics 2012-05-09 Alexander Tsiatas , Iraj Saniee , Onuttom Narayan , Matthew Andrews

We study the spectrum of the Dirichlet Laplacian operator in a two-dimensional twisted strip embedded in $\mathbb R^d$ with $d \geq 2$. It is shown that a local twisting perturbation can create discrete eigenvalues for the operator. In…

Functional Analysis · Mathematics 2021-09-01 Rafael T. Amorim , Alessandra A. Verri

Graph signal processing (GSP) is a key tool for satisfying the growing demand for information processing over networks. However, the success of GSP in downstream learning and inference tasks is heavily dependent on the prior identification…

Signal Processing · Electrical Eng. & Systems 2021-03-29 Seyed Saman Saboksayr , Gonzalo Mateos , Mujdat Cetin

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

Combinatorics · Mathematics 2014-09-23 V. A. Vassiliev

A metrized complex of algebraic curves is a finite metric graph together with a collection of marked complete nonsingular algebraic curves, one for each vertex, the marked points being in bijection with incident edges. We establish a…

Algebraic Geometry · Mathematics 2015-03-20 Omid Amini , Matthew Baker

Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…

A generical formalism for the discussion of Brownian processes with non-constant particle number is developed, based on the observation that the phase space of heat possesses a product structure that can be encoded in a commutative unit…

Mathematical Physics · Physics 2009-11-07 Frederic P. Schuller , Pascal Vogt

In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…

Combinatorics · Mathematics 2026-02-26 Miriam Abdón , Lucas Portugal , Renata Del-Vecchio , Renata de Freitas

Fiber bundles over infinite fields with non-trivial ultra-norms are considered. For them geometric wrap groups are defined and investigated. Besides fields also Cayley-Dickson algebras over fields of characteristic not equal to two are…

Group Theory · Mathematics 2018-12-18 S. V. Ludkovsky

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Group Theory · Mathematics 2019-08-07 Anthony Genevois , Alexandre Martin

The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…

Combinatorics · Mathematics 2025-08-18 Gregory P Constantine , Gregory Magda

This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…

Geometric Topology · Mathematics 2007-05-23 Howard A. Masur , Yair N. Minsky

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

The duality cascade, and its dual description as string theory on the warped deformed conifold, brings together several sophisticated topics, some of which are not widely known. These lectures, which contain a number of previously…

High Energy Physics - Theory · Physics 2016-11-23 Matthew J. Strassler

We study integral kernels of strongly continuous semigroups on Lebesgue spaces over metric measure spaces. Based on semigroup smoothing properties and abstract Morrey-type inequalities, we give sufficient conditions for H\"older or…

Functional Analysis · Mathematics 2024-01-18 Patrizio Bifulco , Delio Mugnolo

Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…

Algebraic Topology · Mathematics 2016-10-25 Javier Zúñiga

We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…

Combinatorics · Mathematics 2021-09-07 Reinhard Diestel
‹ Prev 1 4 5 6 7 8 10 Next ›