Results 11 to 20 of about 1,525,761 (361)
Reconstructing infinite graphs [PDF]
J. A. Bondy, Robert L. Hemminger
openalex +4 more sources
Busemann Points of Infinite Graphs [PDF]
17 pages, 3 ...
Corran Webster, Adam Winchester
openalex +5 more sources
A Liouville theorem for elliptic equations with a potential on infinite graphs [PDF]
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\equiv 0$$
Stefano Biagi, Giulia Meglioli, F. Punzo
semanticscholar +1 more source
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs [PDF]
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
Volume growth for infinite graphs and translation surfaces [PDF]
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]
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
This work deals with the well-known group-theoretic graphs called coset graphs for the modular group G and its applications. The group action of G on real quadratic fields forms infinite coset graphs. These graphs are made up of closed paths. When M acts
Hanan Alolaiyan+3 more
doaj +1 more source
Approximations of Acyclic Graphs
In this paper, approximations of acyclic graphs are studied. It is proved that any theory of an acyclic graph (tree) of finite diameter is pseudofinite with respect to acyclic graphs (trees), that is, any such theory is approximated by theories of finite
N.D. Markhabatov
doaj +1 more source
Infinite limits and folding [PDF]
We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic
Anthony Bonato, Jeannette Janssen
doaj +1 more source
On infinite outerplanar graphs [PDF]
In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden ...
Boza Prieto, Luis+2 more
openaire +3 more sources