Results 21 to 30 of about 1,525,761 (361)
Graphoidally independent infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2021 A graphoidal cover of a graph G (not necessarily finite) is a collection ψ of paths in G, called ψ-edges, (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of G is an internal vertex of at most one path ...
Purnima Gupta, Deepti Jain
doaj +1 more source
Ricci Curvature on Birth-Death Processes
Axioms, 2023 In this paper, we study curvature dimension conditions on birth-death processes which correspond to linear graphs, i.e., weighted graphs supported on the infinite line or the half line. We give a combinatorial characterization of Bakry and Émery’s CD(K,n)
Bobo Hua, Florentin Münch
doaj +1 more source
Spectra of infinite graphs via freeness with amalgamation [PDF]
Canadian Journal of Mathematics - Journal Canadien de Mathematiques, 2019 We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs.
Jorge Garza Vargas, Archit Kulkarni
semanticscholar +1 more source
Cutsets in Infinite Graphs [PDF]
Combinatorics, Probability and Computing, 2006 We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two classes, take the minimal distance between the two classes.
Aacute, dám Timár
openaire +3 more sources
Controllability of periodic bilinear quantum systems on infinite graphs [PDF]
Journal of Mathematics and Physics, 2019 In this work, we study the controllability of the bilinear Schrodinger equation on infinite graphs for periodic quantum states. We consider the equation (BSE) $i\partial_t\psi = −\Delta \psi+ u(t)B\psi$ in the Hilbert space $L^2_p$ composed by functions ...
K. Ammari, Alessandro Duca
semanticscholar +1 more source
An Automaton Learning Approach to Solving Safety Games over Infinite Graphs [PDF]
International Conference on Tools and Algorithms for Construction and Analysis of Systems, 2016 We propose a method to construct finite-state reactive controllers for systems whose interactions with their adversarial environment are modeled by infinite-duration two-player games over possibly infinite graphs.
D. Neider, U. Topcu
semanticscholar +1 more source
Geometric properties of infinite graphs and the Hardy–Littlewood maximal operator [PDF]
Journal d'Analyse Mathematique, 2016 We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy–Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite dilation and ...
Javier Soria, P. Tradacete
semanticscholar +1 more source
Directed Polymers on Infinite Graphs [PDF]
Communications in Mathematical Physics, 2021 We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of an $L^2$ region, and of very strong disorder, in terms of properties of the graph and of the random walk. We study in some detail (biased) random walk on various
Clément Cosco +2 more
openaire +3 more sources
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
AIMS Mathematics, 2021 In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs ...
Suliman Khan +4 more
doaj +1 more source