Related papers: Derivative formula for capacities
We introduce derivation depth-a computable metric of the reasoning effort needed to answer a query based on a given set of premises. We model information as a two-layered structure linking abstract knowledge with physical carriers, and…
An extended formulation of a polytope is a linear description of this polytope using extra variables besides the variables in which the polytope is defined. The interest of extended formulations is due to the fact that many interesting…
Newton's potential of a massive homogeneous ellipsoid is derived via Dirichlet's discontinuous factor. At first we review part of Dirichlet's work in an English translation of the original German, and then continue with an extension of his…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
Two-dimensional networks of ordered quantum dots beyond the percolation threshold are studied, as typical example of conducting nanostructures with quenched random disorder. Theory predicts anomalous diffusion with stretched-exponential…
We present further results on a class of sums which involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle, supplementing those in a previous paper (McPhedran et al,…
There is a deformation of the ordinary differential calculus which leads from the continuum to a lattice (and induces a corresponding deformation of physical theories). We recall some of its features and relate it to a general framework of…
We will show the central limit theorem for the general one-dimensional lattice where the space of symbols is a compact metric space. We consider the CLT for Lipschitz-Gibbs probabilities and in the proof we use several properties of the…
We introduce a notion of fractional (noninteger order) derivative on an arbitrary nonempty closed subset of the real numbers (on a time scale). Main properties of the new operator are proved and several illustrative examples given.
This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…
We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the…
Famous descriptive characterisations of P and PSPACE are restated in terms of the Cook-Nguyen style second order bounded arithmetic. We introduce an axiom of inductive definitions over second order bounded arithmetic. We show that P can be…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
Capacity analysis has been recently introduced as a way to analyze how linear models distribute their modelling capacity across the input space. In this paper, we extend the notion of capacity allocation to the case of neural networks with…
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and…
We study the capacity of the range of a transient simple random walk on $\mathbb{Z}^d$. Our main result is a central limit theorem for the capacity of the range for $d\ge 6$. We present a few open questions in lower dimensions.
We derive rigorously the short-time escape probability of a quantum particle from its compactly supported initial state, which has a discontinuous derivative at the boundary of the support. We show that this probability is liner in time,…
In this article, we present explicit estimates of the size of the domain on which the Implicit Function Theorem and the Inverse Function Theorem are valid. For maps that are twice continuously differentiable, these estimates depend upon the…
In this paper, we prove that hitting probability of Minkowski sum of fractal percolations can be characterized by capacity. Then we extend this result to Minkowski sum of general random sets in $\mathbb Z^d$, including ranges of random…