Related papers: Structure trees, networks and almost invariant set…
In this note, we show that locally finite quasi-transitive graphs are quasi-isometric to trees if and only if every other locally finite quasi-transitive graph quasi-isometric to them is minor excluded. This generalizes results by…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…
We give some Korovkin-type theorems on convergence and estimates of rates of approximations of nets of functions, satisfying suitable axioms, whose particular cases are filter/ideal convergence, almost convergence and triangular…
We develop the theoretical foundations of a generalized Gromov-Hausdorff distance between functions on networks that has recently been applied to various subfields of topological data analysis and optimal transport. These functional…
Motivated by the scalability problem in large networks, we study stability of a network of infinitely many finite-dimensional subsystems. We develop a so-called relaxed small-gain theorem for input-to-state stability (ISS) with respect to a…
We study the topological structure of random geometric forests $G$ in the Euclidean plane under mild assumptions: non-crossing edges, stationarity, and finite edge intensity. The framework covers a broad range of constructions, including…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
In this paper, we give a new completion for quasi-uniform spaces which generalizes the completion theories of Doitchinov [8] and Stoltenberg [20]. The presented completion theory is very well-behaved and extends the completion theory of…
Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…
We present an analysis of the topologies of a class of networks which are optimal in terms of the requirements of having as short a route as possible between any two nodes while yet keeping the congestion in the network as low as possible.…
This paper presents a small-gain theorem for networks composed of a countably infinite number of finite-dimensional subsystems. Assuming that each subsystem is exponentially input-to-state stable, we show that if the gain operator,…
The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…
We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…
We use the Graph Minor Theorem to characterize infinite sequences of finite subsets of factorial and commutative semigroups (here semigroups have a unity element), e.g. the multiplicative semigroup of a unique factorization domain.
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
There are various reasons why adding stubs to the vertices of open string field theory (OSFT) is interesting: Not only the stubs can tame certain singularities and make the theory more well-behaved, but also the new theory shares a lot of…
As a model of temporally evolving networks, we consider a globally coupled logistic map with variable connection weights. The model exhibits self-organization of network structure, reflected by the collective behavior of units. Structural…
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. We analyze several…