Results 1 to 10 of about 24,440 (246)
Applying Infinite Petri Nets to the Cybersecurity of Intelligent Networks, Grids and Clouds
Applied Sciences, 2021 Correctness of networking protocols represents the principal requirement of cybersecurity. Correctness of protocols is established via the procedures of their verification. A classical communication system includes a pair of interacting systems.
Dmitry A. Zaitsev +2 more
doaj +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
Linearly bounded infinite graphs [PDF]
Acta Informatica, 2005 Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of
Carayol, Arnaud, Meyer, Antoine
openaire +5 more sources
On Ramsey-Minimal Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 For fixed finite graphs $G$, $H$, a common problem in Ramsey theory is to study graphs $F$ such that $F \to (G,H)$, i.e. every red-blue coloring of the edges of $F$ produces either a red $G$ or a blue $H$. We generalize this study to infinite graphs $G$, $H$; in particular, we want to determine if there is a minimal such $F$.
Barrett, Jordan Mitchell +1 more
openaire +3 more sources
Journal of Combinatorial Theory, Series B, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Niedermeyer, F., Podewski, K.P.
openaire +1 more source
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
Complexity, 2021 A connected graph is called Hamilton-connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton-connected is an NP-complete problem.
Sakander Hayat +3 more
doaj +1 more source
Non symmetric random walk on infinite graph [PDF]
Opuscula Mathematica, 2011 We investigate properties of a non symmetric Markov's chain on an infinite graph. We show the connection with matrix valued random walk polynomials which satisfy the orthogonality formula with respect to non a symmetric matrix valued measure.
Marcin J. Zygmunt
doaj +1 more source
Infinite Locally Random Graphs [PDF]
Internet Mathematics, 2006 Motivated by copying models of the web graph, Bonato and Janssen [Bonato and Janssen 03] introduced the following simple construction: given a graph G, for each vertex x and each subset X of its closed neighborhood, add a new vertex y whose neighbors are exactly X. Iterating this construction yields a limit graph ↑G. Bonato and Janssen claimed that the
Charbit, Pierre, Scott, Alex D.
openaire +3 more sources
Infinite limits and folding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 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
Infinite Random Geometric Graphs [PDF]
Annals of Combinatorics, 2011 17 pages, 4 ...
Bonato, Anthony, Janssen, Jeannette
openaire +3 more sources