Preference Structure and Random Paths to Stability in Matching Markets

This paper examines how preference correlation and intercorrelation combine to influence the length of a decentralized matching market's path to stability. In simulated experiments, marriage markets with various preference specifications begin at an arbitrary matching of couples and proceed toward stability via the random mechanism proposed by Roth and Vande Vate (1990). The results of these experiments reveal that fundamental preference characteristics are critical in predicting how long the market will take to reach a stable matching. In particular, intercorrelation and correlation are shown to have an exponential impact on the number of blocking pairs that must be randomly satisfied before stability is attained. The magnitude of the impact is dramatically different, however, depending on whether preferences are positively or negatively intercorrelated.

Assessing landscape functional connectivity in a forest carnivore using path selection functions

Context Understanding connectivity patterns in relation to habitat fragmentation is essential to landscape management. However, connectivity is often judged from expert opinion or species occurrence patterns, with very few studies considering the actual movements of individuals. Path selection functions provide a promising tool to infer functional connectivity from animal movement data, but its practical application remains scanty. Objectives We aimed to describe functional connectivity patterns in a forest carnivore using path-level analysis, and to explore how connectivity is affected by land cover patterns and road networks. Methods We radiotracked 22 common genets in a mixed forest-agricultural landscape of southern Portugal. We developed path selection functions discriminating between observed and random paths in relation to landscape variables. These functions were used together with land cover information to map conductance surfaces. Results Genets moved preferentially within forest patches and close to riparian habitats. Functional connectivity declined with increasing road density, but increased with the proximity of culverts, viaducts and bridges. Functional connectivity was favoured by large forest patches, and by the presence of riparian areas providing corridors within open agricultural land. Roads reduced connectivity by dissecting forest patches, but had less effect on riparian corridors due to the presence of crossing structures. Conclusions Genet movements were jointly affected by the spatial distribution of suitable habitats, and the presence of a road network dissecting such habitats and creating obstacles in areas otherwise permeable to animal movement. Overall, the study showed the value of path-level analysis to assess functional connectivity patterns in human-modified landscapes.

On degeneracy and invariances of random fields paths with applications in Gaussian process modelling

We study pathwise invariances and degeneracies of random fields with motivating applications in Gaussian process modelling. The key idea is that a number of structural properties one may wish to impose a priori on functions boil down to degeneracy properties under well-chosen linear operators. We first show in a second order set-up that almost sure degeneracy of random field paths under some class of linear operators defined in terms of signed measures can be controlled through the two first moments. A special focus is then put on the Gaussian case, where these results are revisited and extended to further linear operators thanks to state-of-the-art representations. Several degeneracy properties are tackled, including random fields with symmetric paths, centred paths, harmonic paths, or sparse paths. The proposed approach delivers a number of promising results and perspectives in Gaussian process modelling. In a first numerical experiment, it is shown that dedicated kernels can be used to infer an axis of symmetry. Our second numerical experiment deals with conditional simulations of a solution to the heat equation, and it is found that adapted kernels notably enable improved predictions of non-linear functionals of the field such as its maximum.

On ANOVA Decompositions of Kernels and Gaussian Random Field Paths

The FANOVA (or “Sobol’-Hoeffding”) decomposition of multivariate functions has been used for high-dimensional model representation and global sensitivity analysis. When the objective function f has no simple analytic form and is costly to evaluate, computing FANOVA terms may be unaffordable due to numerical integration costs. Several approximate approaches relying on Gaussian random field (GRF) models have been proposed to alleviate these costs, where f is substituted by a (kriging) predictor or by conditional simulations. Here we focus on FANOVA decompositions of GRF sample paths, and we notably introduce an associated kernel decomposition into 4 d 4d terms called KANOVA. An interpretation in terms of tensor product projections is obtained, and it is shown that projected kernels control both the sparsity of GRF sample paths and the dependence structure between FANOVA effects. Applications on simulated data show the relevance of the approach for designing new classes of covariance kernels dedicated to high-dimensional kriging.

Shortest node-disjoint paths on random graphs

A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length and the transition to the frustrated regime are analyzed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm. © 2014 IOP Publishing Ltd and SISSA Medialab srl.

Exploring Object Perception with Random Image Structure Evolution

We have developed a technique called RISE (Random Image Structure Evolution), by which one may systematically sample continuous paths in a high-dimensional image space. A basic RISE sequence depicts the evolution of an object's image from a random field, along with the reverse sequence which depicts the transformation of this image back into randomness. The processing steps are designed to ensure that important low-level image attributes such as the frequency spectrum and luminance are held constant throughout a RISE sequence. Experiments based on the RISE paradigm can be used to address some key open issues in object perception. These include determining the neural substrates underlying object perception, the role of prior knowledge and expectation in object perception, and the developmental changes in object perception skills from infancy to adulthood.

Observations on the flight paths of the day-flying moth Virbia lamae during periods of mate location: do males have a strategy for contacting the pheromone plume?

1. To maximize the probability of rapid contact with a female’s pheromone plume, the trajectories of male foraging flights might be expected to be directed with respect to wind flow and also to be energetically efficient. 2. Flights directed either upwind, downwind, or crosswind have been proposed as optimal strategies for rapid and/or energetically efficient plume contact. Other possible strategies are random and Lévy walks, which have trajectories and turn frequencies that are not dictated by the direction of wind flow. 3. The planar flight paths of males of the day-active moth Virbia lamae were recorded during the customary time of its sexual activity. 4. We found no directional preference in these foraging flights with respect to the direction of contemporaneous wind flow, but, because crosswind encompasses twice the possible orientations of either upwind or downwind, a random orientation is in effect a de facto crosswind strategy. 5. A crosswind preference should be favoured when the plume extends farther downwind than crosswind, and this strategy is realized by V. lamae males by a random orientation of their trajectories with respect to current wind direction

A structure-dynamic approach to cortical organization: Number of paths and accessibility

A structure-dynamic approach to cortical systems is reported which is based on the number of paths and the accessibility of each node. The latter measurement is obtained by performing self-avoiding random walks in the respective networks, so as to simulate dynamics, and then calculating the entropies of the transition probabilities for walks starting from each node. Cortical networks of three species, namely cat, macaque and humans, are studied considering structural and dynamical aspects. It is verified that the human cortical network presents the highest accessibility and number of paths (in terms of z-scores). The correlation between the number of paths and accessibility is also investigated as a mean to quantify the level of independence between paths connecting pairs of nodes in cortical networks. By comparing the cortical networks of cat, macaque and humans, it is verified that the human cortical network tends to present the largest number of independent paths of length larger than four. These results suggest that the human cortical network is potentially the most resilient to brain injures. (C) 2009 Elsevier B.V. All rights reserved.

The number of open paths in an oriented rho-percolation model

We study the asymptotic properties of the number of open paths of length n in an oriented rho-percolation model. We show that this number is e(n alpha(rho)(1+o(1))) as n ->infinity. The exponent alpha is deterministic, it can be expressed in terms of the free energy of a polymer model, and it can be explicitly computed in some range of the parameters. Moreover, in a restricted range of the parameters, we even show that the number of such paths is n(-1/2)We (n alpha(rho))(1+o(1)) for some nondegenerate random variable W. We build on connections with the model of directed polymers in random environment, and we use techniques and results developed in this context.

Geodesics and Almost Geodesic Cycles in Random Regular Graphs

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d(G)(u, v) is at least d(C)(u, v) - e(n). Let omega(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= log(d-1)log(d-1) n+omega(n) and vertical bar C vertical bar =2 log(d-1) n+O(omega(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 66: 115-136, 2011

Extracting more out of relocation data: building movement models as mixtures of random walks

We present a framework for fitting multiple random walks to animal movement paths consisting of ordered sets of step lengths and turning angles. Each step and turn is assigned to one of a number of random walks, each characteristic of a different behavioral state. Behavioral state assignments may be inferred purely from movement data or may include the habitat type in which the animals are located. Switching between different behavioral states may be modeled explicitly using a state transition matrix estimated directly from data, or switching probabilities may take into account the proximity of animals to landscape features. Model fitting is undertaken within a Bayesian framework using the WinBUGS software. These methods allow for identification of different movement states using several properties of observed paths and lead naturally to the formulation of movement models. Analysis of relocation data from elk released in east-central Ontario, Canada, suggests a biphasic movement behavior: elk are either in an "encamped" state in which step lengths are small and turning angles are high, or in an "exploratory" state, in which daily step lengths are several kilometers and turning angles are small. Animals encamp in open habitat (agricultural fields and opened forest), but the exploratory state is not associated with any particular habitat type.

Random positions of dendritic spines in human cerebral cortex

Dendritic spines establish most excitatory synapses in the brain and are located in Purkinje cell’s dendrites along helical paths, perhaps maximizing the probability to contact different axons. To test whether spine helixes also occur in neocortex, we reconstructed >500 dendritic segments from adult human cortex obtained from autopsies. With Fourier analysis and spatial statistics, we analyzed spine position along apical and basal dendrites of layer 3 pyramidal neurons from frontal, temporal, and cingulate cortex. Although we occasionally detected helical positioning, for the great majority of dendrites we could not reject the null hypothesis of spatial randomness in spine locations, either in apical or basal dendrites, in neurons of different cortical areas or among spines of different volumes and lengths. We conclude that in adult human neocortex spine positions are mostly random. We discuss the relevance of these results for spine formation and plasticity and their functional impact for cortical circuits.

Random positioning of dendritic spines in the human cerebral cortex

Dendritic spines establish most excitatory synapses in the brain and are located in Purkinje cell?s dendrites along helical paths, perhaps maximizing the probability to contact different axons. To test whether spine helixes also occur in neocortex, we reconstructed ?500 dendritic segments from adult human cortex obtained from autopsies. With Fourier analysis and spatial statistics, we analyzed spine position along apical and basal dendrites of layer 3 pyramidal neurons from frontal, temporal, and cingulate cortex. Although we occasionally detected helical positioning, for the great majority of dendrites we could not reject the null hypothesis of spatial randomness in spine locations, either in apical or basal dendrites, in neurons of different cortical areas or among spines of different volumes and lengths. We conclude that in adult human neocortex spine positions are mostly random. We discuss the relevance of these results for spine formation and plasticity and their functional impact for cortical circuits.

Robust Parametric Estimation of Branching Processes with a Random Number of Ancestors

2000 Mathematics Subject Classification: 60J80.