Search results for "combinatoric"
showing 10 items of 1776 documents
Covariance and correlation estimators in bipartite complex systems with a double heterogeneity
2019
Complex bipartite systems are studied in Biology, Physics, Economics, and Social Sciences, and they can suitably be described as bipartite networks. The heterogeneity of elements in those systems makes it very difficult to perform a statistical analysis of similarity starting from empirical data. Though binary Pearson's correlation coefficient has proved effective to investigate the similarity structure of some real-world bipartite networks, here we show that both the usual sample covariance and correlation coefficient are affected by a bias, which is due to the aforementioned heterogeneity. Such a bias affects real bipartite systems, and, for example, we report its effects on empirical dat…
On an approximation problem for stochastic integrals where random time nets do not help
2006
Abstract Given a geometric Brownian motion S = ( S t ) t ∈ [ 0 , T ] and a Borel measurable function g : ( 0 , ∞ ) → R such that g ( S T ) ∈ L 2 , we approximate g ( S T ) - E g ( S T ) by ∑ i = 1 n v i - 1 ( S τ i - S τ i - 1 ) where 0 = τ 0 ⩽ ⋯ ⩽ τ n = T is an increasing sequence of stopping times and the v i - 1 are F τ i - 1 -measurable random variables such that E v i - 1 2 ( S τ i - S τ i - 1 ) 2 ∞ ( ( F t ) t ∈ [ 0 , T ] is the augmentation of the natural filtration of the underlying Brownian motion). In case that g is not almost surely linear, we show that one gets a lower bound for the L 2 -approximation rate of 1 / n if one optimizes over all nets consisting of n + 1 stopping time…
An Adaptive Parallel Tempering Algorithm
2013
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with multimodal target distributions, where conventionalMetropolis- Hastings algorithms often fail. The mixing properties of the sampler depend strongly on the choice of tuning parameters, such as the temperature schedule and the proposal distribution used for local exploration. We propose an adaptive algorithm with fixed number of temperatures which tunes both the temperature schedule and the parameters of the random-walk Metropolis kernel automatically. We prove the convergence of the adaptation and a strong law of large numbers for the algorithm under general conditions. We also prove as a side…
On surrogating 0–1 knapsack constraints
1999
In this note, we present a scheme for tightening 0–1 knapsack constraints based on other knapsack constraints surrogating.
A tabu search algorithm for assigning teachers to courses
2002
In this paper we deal with the problem of assigning teachers to courses in a secondary school. The problem appears when a timetable is to be built and the teaching assignments are not fixed. We have developed a tabu search algorithm to solve the problem. The parameters involved in the algorithm have been estimated by using multiple regression techniques. The computational results, obtained on a set of Spanish secondary schools, show that the solutions obtained by this automatic procedure can be favourably compared with the solutions proposed by the experts.
Gossip: The Architecture of SpreadPlots
2003
A spreadplot is a visualization that simultaneously shows several different views of a dataset or model. The individual views can be dynamic, can support high-interaction direct manipulation, and can be algebraically linked with each other, possibly via an underlying statistical model. Thus, when a data analyst changes the information shown in one view of a statistical model, the changes can be processed by the model and instantly represented in the other views. Spreadplots simplify the analyst's task when many different plots are relevant to the analysis at hand, as is the case in regression analysis, where there are many plots that can be used for model building and diagnosis. On the othe…
ARC A computerized system for urban garbage collection
1993
In this paper we present ARC a computerized system developed for urban garbage collection. The package is intended to help the planners in the design of efficient collection routes and to facilitate the study and evaluation of alternatives concerning issues such as the type and number of vehicles, frequency of collection and type and location of refuse containers. The final product is a “user friendly” system designed to be used by the planners without outside assistance.
Stochastic ordering of classical discrete distributions
2010
For several pairs $(P,Q)$ of classical distributions on $\N_0$, we show that their stochastic ordering $P\leq_{st} Q$ can be characterized by their extreme tail ordering equivalent to $ P(\{k_\ast \})/Q(\{k_\ast\}) \le 1 \le \lim_{k\to k^\ast} P(\{k\})/Q(\{k\})$, with $k_\ast$ and $k^\ast$ denoting the minimum and the supremum of the support of $P+Q$, and with the limit to be read as $P(\{k^\ast\})/Q(\{k^\ast\})$ for $k^\ast$ finite. This includes in particular all pairs where $P$ and $Q$ are both binomial ($b_{n_1,p_1} \leq_{st} b_{n_2,p_2}$ if and only if $n_1\le n_2$ and $(1-p_1)^{n_1}\ge(1-p_2)^{n_2}$, or $p_1=0$), both negative binomial ($b^-_{r_1,p_1}\leq_{st} b^-_{r_2,p_2}$ if and on…
On delocalization of eigenvectors of random non-Hermitian matrices
2019
We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let $A$ be an $n\times n$ random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at least $1-e^{-\log^{2} n}$ $$ \min\limits_{I\subset[n],\,|I|= m}\|{\bf v}_I\| \geq \frac{m^{3/2}}{n^{3/2}\log^Cn}\|{\bf v}\| $$ for any real eigenvector ${\bf v}$ and any $m\in[\log^C n,n]$, where ${\bf v}_I$ denotes the restriction of ${\bf v}$ to $I$. Further, when the entries of $A$ are complex, with i.i.d real and imaginary parts, we show that with probability at least $1-e^{-\log^{2} n}$ all eigenvectors of $A$ are delocalized in the sense that $$ \min\l…
A PHASE TRANSITION FOR LARGE VALUES OF BIFURCATING AUTOREGRESSIVE MODELS
2019
We describe the asymptotic behavior of the number $$Z_n[a_n,\infty )$$ of individuals with a large value in a stable bifurcating autoregressive process, where $$a_n\rightarrow \infty $$ . The study of the associated first moment is equivalent to the annealed large deviation problem of an autoregressive process in a random environment. The trajectorial behavior of $$Z_n[a_n,\infty )$$ is obtained by the study of the ancestral paths corresponding to the large deviation event together with the environment of the process. This study of large deviations of autoregressive processes in random environment is of independent interest and achieved first. The estimates for bifurcating autoregressive pr…