Results 1 to 10 of about 1,327,272 (305)

Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs [PDF]

open access: yesTheoretiCS, 2023
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $\omega$-regular objectives, due to its relation to many natural problems in
Patricia Bouyer   +2 more
doaj   +3 more sources

Helmholtz operators on infinite graphs [PDF]

open access: yesHeliyon
The Helmholtz equation in its simplest form is Δu(a)=−k2u(a). In this note, we study a generalized discrete version of this equation on an infinite graph, by using potential-theoretic methods.
Varadha Raj Manivannan   +1 more
doaj   +2 more sources

Self‐adjoint and Markovian extensions of infinite quantum graphs [PDF]

open access: hybridJournal of the London Mathematical Society, 2022
We investigate the relationship between one of the classical notions of boundaries for infinite graphs, graph ends, and self‐adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph.
Aleksey Kostenko   +2 more
openalex   +2 more sources

Positive solutions of $p$-th Yamabe type equations on infinite graphs [PDF]

open access: bronzeProceedings of the American Mathematical Society, 2018
Let G = (V,E) be a connected infinite and locally finite weighted graph, ∆p be the p-th discrete graph Laplacian. In this paper, we consider the p-th Yamabe type equation −∆pu+ h|u| u = gu on G, where h and g are known, 2 < α ≤ p.
Xiaoxiao Zhang, Aijin Lin
openalex   +3 more sources

A Liouville theorem for elliptic equations with a potential on infinite graphs [PDF]

open access: yesCalculus of Variations and Partial Differential Equations, 2023
We investigate the validity of the Liouville property for a class of elliptic equations with a potential, posed on infinite graphs. Under suitable assumptions on the graph and on the potential, we prove that the unique bounded solution is u≡0 ...
Stefano Biagi, Giulia Meglioli, F. Punzo
semanticscholar   +1 more source

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs [PDF]

open access: yesLogic in Computer Science, 2022
We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems.
Pierre Ohlmann
semanticscholar   +1 more source

Laplacians on Infinite Graphs [PDF]

open access: yesMemoirs of the European Mathematical Society, 2021
There are two main notions of a Laplacian operator associated with graphs: discrete graph Laplacians and continuous Laplacians on metric graphs (widely known as quantum graphs). Both objects have a venerable history as they are related to several diverse
A. Kostenko, Noema Nicolussi
semanticscholar   +1 more source

Volume growth for infinite graphs and translation surfaces [PDF]

open access: yes, 2021
In this note we give asymptotic estimates for the volume growth associated to suitable infinite graphs. Our main application is to give an asymptotic estimate for volume growth associated to translation surfaces.
P. Colognese, M. Pollicott
semanticscholar   +1 more source

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs [PDF]

open access: yesTheoretiCS, 2023
We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems.
Pierre Ohlmann
doaj   +1 more source

Applications of Order Trees in Infinite Graphs

open access: yesOrder, 2022
Traditionally, the trees studied in infinite graphs are trees of height at most ω , with each node adjacent to its parent and its children (and every branch of the tree inducing a path or a ray). However, there is also a method, systematically introduced
Max Pitz
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy