Related papers: The arrow of time, complexity and the scale free a…
Recently, one paper in Nature(Papadopoulos, 2012) raised an old debate on the origin of the scale-free property of complex networks, which focuses on whether the scale-free property origins from the optimization or not. Because the…
Factor analysis is a widely used technique for dimension reduction in high-dimensional data. However, a key challenge in factor models lies in the interpretability of the latent factors. One intuitive way to interpret these factors is…
Using polynomial truncations of the Fourier transform of the RG transformation of Dyson's hierarchical model, we show that it is possible to calculate very accurately the renormalized quantities in the symmetric phase. Numerical results…
I outline why the renormalisation group is needed to analyse the scale dependence and hence determine the power counting for effective theories of strongly interacting systems. I summarise the results of several such analyses for two- and…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
Scale free dynamics are observed in a variety of physical and biological systems. These include neural activity in which evidence for scale freeness has been reported using a range of imaging modalities. Here, we derive the ways in which…
This article considers algorithmic and statistical aspects of linear regression when the correspondence between the covariates and the responses is unknown. First, a fully polynomial-time approximation scheme is given for the natural least…
In this paper the following selection problem is discussed. A set of $n$ items is given and we wish to choose a subset of exactly $p$ items of the minimum total cost. This problem is a special case of 0-1 knapsack in which all the item…
The random antiferromagnetic two-leg and zigzag spin-1/2 ladders are investigated using the real space renormalization group scheme and their complete phase diagrams are determined. We demonstrate that the first system belongs to the same…
Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of…
In order to bring contraction analysis into the very fruitful and topical fields of stochastic and Bayesian systems, we extend here the theory describes in \cite{Lohmiller98} to random differential equations. We propose new definitions of…
It has recently been observed that a stochastic (infinite degree of freedom) time series with a $1/f^\alpha$ power spectrum can exhibit a finite correlation dimension, even for arbitrarily large data sets. [A.R. Osborne and A.~Provenzale,…
It is shown that the renormalization group (RG) method for global analysis can be formulated in the context of the classical theory of envelopes: Several examples from partial differential equations are analyzed. The amplitude equations…
We consider the problem of estimating the factors of a rank-$1$ matrix with i.i.d. Gaussian, rank-$1$ measurements that are nonlinearly transformed and corrupted by noise. Considering two prototypical choices for the nonlinearity, we study…
We propose a new scalable algorithm for holistic linear regression building on Bertsimas & King (2016). Specifically, we develop new theory to model significance and multicollinearity as lazy constraints rather than checking the conditions…
We present the two-loop renormalization group (RG) calculations of all the susceptibilities associated with the two-dimensional flat Fermi surface with rounded corners (FS). Our approach follows our fermionic field theory RG method…
Variational analysis provides the theoretical foundations and practical tools for constructing optimization algorithms without being restricted to smooth or convex problems. We survey the central concepts in the context of a concrete but…
Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…
In this work, several random Boolean networks (RBN) are generated and analyzed from two characteristics: their time evolution diagram and their transition diagram. For this purpose, its randomness is estimated using three measures, of which…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…