The partial inverse minimum spanning tree problem when weight increase is forbidden

In a partial inverse optimization problem there is an underlying optimization problem with a partially given solution. The objective is to find a minimal perturbation of some of the problem’s parameter values, in such a way that the partial solution becomes a part of the optimal solution.     

Strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree

In this paper,we study the strong law of large numbers and Shannon-McMillan (S-M) theorem for Markov chains indexed by an infinite tree with uniformly bounded degree.The results generalize the analogous results on a homogeneous tree.     

Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures

Two approximation algorithms are presented for minimizing the makespan of independant tasks assigned on unrelated machines. The first one is based upon a partial and heuristical exploration of a search tree, which is used not only to build a solution but also to improve it thanks to a post-optimization procedure. The second implements a new large neighborhood improvement procedure to an already existing algorithm. Computational experiments show that their efficiency is equivalent to the best local search heuristics.     

The expectation hypothesis of interest rates and network theory: The case of Brazil

This paper investigates the topological properties of the Brazilian term structure of interest rates network. We build the minimum spanning tree (MST), which is based on the concept of ultrametricity, using the correlation matrix for interest rates of different maturities. We show that the short-term interest rate is the most important within the interest rates network, which is in line with the Expectation Hypothesis of interest rates. Furthermore, we find that the Brazilian interest rates network forms clusters by maturity.     

Lot-sizing on a tree

For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q,S_Q) inequalities can be simplified and extended. Finally some limited computational results are presented.     

Locating the two-median of a tree network with continuous link demands

Typical formulations of thep-median problem on a network assume discrete nodal demands. However, for many problems, demands are better represented by continuous functions along the links, in addition to nodal demands. For such problems, optimal server locations need not occur at nodes, so that algorithms of the kind developed for the discrete demand case can not be used. In this paper we show how the 2-median of a tree network with continuous link demands can be found using an algorithm based on sequential location and allocation. We show that the algorithm will converge to a local minimum and then present a procedure for finding the global minimum solution.     

A system of grabbing particles related to Galton‐Watson trees

We consider a system of particles with arms that are activated randomly to grab other particles as a toy model for polymerization. We assume that the following two rules are fulfilled: once a particle has been grabbed then it cannot be grabbed again, and an arm cannot grab a particle that belongs to its own cluster. We are interested in the shape of a typical polymer in the situation when the initial number of monomers is large and the numbers of arms of monomers are given by i.i.d. random variables. Our main result is a limit theorem for the empirical distribution of polymers, where limit is expressed in terms of a Galton‐Watson tree. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

Topological properties of stock market networks: The case of Brazil

This paper investigates the topological properties of the Brazilian stock market networks. We build the minimum spanning tree, which is based on the concept of ultrametricity, using the correlation matrix for a variety of stocks of different sectors. Our results suggest that stocks tend to cluster by sector. We employ a dynamic approach using complex network measures and find that the relative importance of different sectors within the network varies. The financial, energy and material sectors are the most important within the network.     

On arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ; from a result by Barth and Fournier it follows that Δ(T)?4. A necessary and a sufficient condition for being an arbitrarily vertex decomposable star-like tree have been exhibited. The conditions seem to be very close to each other.