数据分析、统计与概率
A self-contained Fortran-77 program for goodness of fit tests for histograms with weighted entries as well as with unweighted entries is presented. The code calculates test statistics for case of histogram with normalized weights of events…
Temporal networks are commonly used to represent systems where connections between elements are active only for restricted periods of time, such as networks of telecommunication, neural signal processing, biochemical reactions and human…
Calculating the expected number of misclassified outcomes is a standard problem of particular interest for rare-event searches. The Clopper-Pearson method allows calculation of classical confidence intervals on the amount of…
Modularity is one of the most prominent properties of real-world complex networks. Here, we address the issue of module identification in two important classes of networks: bipartite networks and directed unipartite networks. Nodes in…
We define {\em predictive information} $I_{\rm pred} (T)$ as the mutual information between the past and the future of a time series. Three qualitatively different behaviors are found in the limit of large observation times $T$: $I_{\rm…
The Photonic Force Microscope (PFM) is an opto-mechanical technique based on an optical trap that can be assumed to probe forces in microscopic systems. This technique has been used to measure forces in the range of pico- and femto-Newton,…
This article consists of a brief discussion of the energy density over time or frequency that is obtained with the wavelet transform. Also an efficient algorithm is suggested to calculate the continuous transform with the Morlet wavelet.…
Two modifications of the chi square test for comparing usual(unweighted) and weighted histograms and two weighted histograms are proposed. Numerical examples illustrate an application of the tests for the histograms with different…
The statistics of transitions between the metastable states of a periodically driven bistable Brownian oscillator are investigated on the basis of a two-state description by means of a master equation with time-dependent rates. The results…
Self-similarity in the network traffic has been studied from several aspects: both at the user side and at the network side there are many sources of the long range dependence. Recently some dynamical origins are also identified: the TCP…
We present a detailed derivation of some estimators of Shannon entropy for discrete distributions. They hold for finite samples of N points distributed into M "boxes", with N and M -> oo, but N/M < oo. In the high sampling regime (<< 1…
Almost all network research has been focused on the properties of a single network that does not interact and depends on other networks. In reality, many real-world networks interact with other networks. Here we develop an analytical…
Benford's law states that the occurrence of significant digits in many data sets is not uniform but tends to follow a logarithmic distribution such that the smaller digits appear as first significant digits more frequently than the larger…
A simple one-dimensional spring-block chain with asymmetric interactions is considered to model an idealized single-lane highway traffic. The main elements of the system are blocks (modeling cars), springs with unidirectional interactions…
Robust and efficient design of networks on a realistic geographical space is one of the important issues for the realization of dependable communication systems. In this paper, based on a percolation theory and a geometric graph property,…
We consider the mass-dependent aggregation process (k+1)X -> X, given a fixed number of unit mass particles in the initial state. One cluster is chosen proportional to its mass and is merged into one either with k-neighbors in one…
We theoretically study semi-supervised clustering in sparse graphs in the presence of pairwise constraints on the cluster assignments of nodes. We focus on bi-cluster graphs, and study the impact of semi-supervision for varying constraint…
We analyze the Allan Variance estimator as the combination of Discrete-Time linear filters. We apply this analysis to the different variants of the Allan variance: the Overlapping Allan Variance, the Modified Allan variance, the Hadamard…
In the past decade, synchronization on complex networks has attracted increasing attentions from various research disciplines. Most previous works, however, focus only on the dynamic behaviors of synchronization process in the stable…
In this work, we introduce a new and simple transformation from time series to complex networks based on markov-binary visibility graph(MBVG). Due to the simple structure of this transformation in comparison with other transformations be…