Related papers: On streams that are finitely red
We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite…
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…
This work is concerned with the intricate interplay between node or pore pressures and connection or throat conductivities in flow or pore networks. A setting similar to pore networks is given by fracture networks. Recently, a non-local…
Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…
It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…
We present a new type system combining refinement types and the expressiveness of intersection type discipline. The use of such features makes it possible to derive more precise types than in the original refinement system. We have been…
In most fluid dynamics problems, the governing equations are nonlinear because of the presence of convective terms. Nevertheless, existence of solutions can be shown by direct sum provided one identifies, in the relevant Banach space of…
Bove and Capretta's popular method for justifying function definitions by general recursive equations is based on the observation that any structured general recursion equation defines an inductive subset of the intended domain (the "domain…
We consider network models where information items flow %are sent from a source to a sink node. We start with a model where routing is constrained by energy available on nodes in finite supply (like in Smartdust) and efficiency is related…
We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…
To describe the flow of a miscible quantity on a network, we introduce the graph wave equation where the standard continuous Laplacian is replaced by the graph Laplacian. This is a natural description of an array of inductances and…
The effects of erosion, avalanching and random precipitation are captured in a simple stochastic partial differential equation for modelling the evolution of river networks. Our model leads to a self-organized structured landscape and to…
This paper investigates the coloring problem on Fibonacci-Cayley tree, which is a Cayley graph whose vertex set is the Fibonacci sequence. More precisely, we elucidate the complexity of shifts of finite type defined on Fibonacci-Cayley tree…
We study the adjudication of water rights in international rivers. We characterize allocation rules that formalize focal principles to deal with water disputes in a basic model. Central to our analysis is a family of geometric rules that…
In 2009, Hancock, Pattinson and Ghani gave a coalgebraic characterisation of stream processors $A^\mathbb{N} \to B^\mathbb{N}$ drawing on ideas of Brouwerian constructivism. Their stream processors have an intensional character; in this…
Interpreting RG flows as dynamical systems in the space of couplings we produce a variety of constraints, global (topological) as well as local. These constraints, in turn, rule out some of the proposed RG flows and also predict new phases…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
We introduce a new framework to deal with rough differential equations based on flows and their approximations. Our main result is to prove that measurable flows exist under weak conditions, even solutions to the corresponding rough…