Conservation practitioners have long recognized ecological connectivity as a global priority
for preserving biodiversity and ecosystem function. In the early years of conservation …

The modern science of networks has brought significant advances to our understanding of
complex systems. One of the most relevant features of graphs representing real systems is …

In decentralized optimization, nodes cooperate to minimize an overall objective function that
is the sum (or average) of per-node private objective functions. Algorithms interleave local …

This paper considers the problem of distributed optimization over time-varying graphs. For
the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing …

Various aspects of the theory of random walks on graphs are surveyed. In particular,
estimates on the important parameters of access time, commute time, cover time and mixing …

Connectivity among populations and habitats is important for a wide range of ecological
processes. Understanding, preserving, and restoring connectivity in complex landscapes …

The R package gdistance provides classes and functions to calculate various distance
measures and routes in heterogeneous geographic spaces represented as grids. Least-cost …

Despite growing interest in the effects of landscape heterogeneity on genetic structuring, few
tools are available to incorporate data on landscape composition into population genetic …

This work presents a new perspective on characterizing the similarity between elements of a
database or, more generally, nodes of a weighted and undirected graph. It is based on a …

For simple random walk on a N-vertex graph, the mean time to cover all vertices is at least
cN log (N), where c> 0 is an absolute constant. This is deduced from a more general result …