English
Related papers

Related papers: Contraction semigroups on metric graphs

200 papers

We formulate a criterion for the existence of an invariant measure for a Feller semigroup defined on a metric space with the e-property for bounded continuous functions and use it to prove the asymptotic stability of a semigroup satisfying…

Probability · Mathematics 2018-09-25 Stanisław Wȩdrychowicz , Andrzej Wiśnicki

Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…

Data Structures and Algorithms · Computer Science 2022-08-22 Khí-Uí Soo , Bakhadyr Khoussainov , Simone Linz

Quantum dynamical semigroups play an important role in the description of physical processes such as diffusion, radiative decay or other non-equilibrium events. Taking strongly continuous and trace preserving semigroups into consideration,…

Mathematical Physics · Physics 2015-09-07 Sabina Alazzawi , Bernhard Baumgartner

In this short note we formulate a stabilizer formalism in the language of noncommutative graphs. The classes of noncommutative graphs we consider are obtained via unitary representations of compact groups, and suitably chosen operators on…

Information Theory · Computer Science 2024-03-01 Roy Araiza , Jihong Cai , Yushan Chen , Abraham Holtermann , Chieh Hsu , Tushar Mohan , Peixue Wu , Zeyuan Yu

We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…

Functional Analysis · Mathematics 2020-10-01 Ognjen Milatovic

We consider semi-continuity of certain dimensions on group schemes.

Algebraic Geometry · Mathematics 2022-11-21 Phillipe Gille , Robert Guralnick

We study contraction groups for automorphisms of totally disconnected locally compcat groups using the scale of the automorphism as a tool. The contraction group is shown to be unbounded when the inverse automorphism has non-trivial scale…

Group Theory · Mathematics 2007-05-23 Udo Baumgartner , George A. Willis

The stability and contraction properties of positive integral semigroups on Polish spaces are investigated. Our novel analysis is based on the extension of V-norm contraction methods, associated to functionally weighted Banach spaces for…

Probability · Mathematics 2023-03-07 Pierre del Moral , Emma Horton , Ajay Jasra

Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework contracting edges of a graph (merging vertices…

Data Structures and Algorithms · Computer Science 2019-02-14 Aaron Bernstein , Karl Däubel , Yann Disser , Max Klimm , Torsten Mütze , Frieder Smolny

We study metric contraction properties for metric spaces associated with left-invariant sub-Riemannian metrics on Carnot groups. We show that ideal sub-Riemannian structures on Carnot groups satisfy such properties and give a lower bound of…

Optimization and Control · Mathematics 2013-05-28 Ludovic Rifford

In this paper, we consider certain elements in von Neumann algebras generated by graph groupoids. In particular, we are interested in finitely supported elements, called graph operators. We study the characterizations for self-adjointness,…

Representation Theory · Mathematics 2010-07-20 Ilwoo Cho , Palle E. T. Jorgensen

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

Combinatorics · Mathematics 2012-02-01 Frank Bauer

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

Combinatorics · Mathematics 2007-05-23 Dragan Marusic , Primoz Sparl

We extend a classical theorem of Courr\`{e}ge to Lie groups in a global setting, thus characterising all linear operators on the space of smooth functions of compact support that satisfy the positive maximum principle. We show that these…

Functional Analysis · Mathematics 2019-07-31 David Applebaum , Trang Le Ngan

Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…

Category Theory · Mathematics 2013-08-14 David G. Jones , Mark V. Lawson

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

Group Theory · Mathematics 2019-06-12 Benjamin Blanchette , Christian Choffrut , Christophe Reutenauer

We provide some sharp criteria for studying the ergodicity and asymptotic stability of general Feller semigroups on Polish metric spaces. As application, the 2D Navier-Stokes equations with degenerate stochastic forcing will be simply…

Probability · Mathematics 2015-02-17 Fu-Zhou Gong , Yuan Liu

In a couple of previous papers, we initiated a systematic study of semihypergroups and had a thorough discussion on certain analytic and algebraic aspects associated to this class of objects. In this article, we introduce and examine…

Functional Analysis · Mathematics 2022-04-11 Choiti Bandyopadhyay

We formulate and prove relative versions of several classical decompositions known in the theory of Chevalley groups over commutative rings. As an application we obtain upper estimates for the width of principal congruence subgroups in…

Group Theory · Mathematics 2018-10-02 Sergey Sinchuk , Andrei Smolensky

It is well-known that concentrators are sparse graphs of high connectivity, which play a key role in the construction of switching networks; and any semi-vertex transitive graph is isomorphic to a bi-coset graph. In this paper, we prove…

Combinatorics · Mathematics 2012-10-23 Xingchao Deng , Kainan Xiang
‹ Prev 1 3 4 5 6 7 10 Next ›