Related papers: Crossing-effect in non-isolated and non-symmetric …

Starting from the Fisher-Kolmogorov-Petrovskii-Piskunov equation (FKPP) we model the dynamic of a diffusive system with two mutually communicating identical patches and isolated of the remaining matrix. For this system we find the minimal…

This paper starts from the Fisher-Kolmogorov-Petrovskii-Piskunov equation to model diffusive populations. The main result, according to this model, is that two connected patches in a system do not always contribute to each other.…

As an alternative to the paradigmatic fragmentation problem of a single object crushed into a great number of pieces, we survey a large collection of identical bodies, each one randomly split into two fragments only. While some key features…

We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block…

Using a simulated annealing, we examine a bipartitioning of small worlds obtained by adding a fraction of randomly chosen links to a one-dimensional chain or a square lattice. Models defined on small worlds typically exhibit a mean-field…

Systems describing the long-range interaction between individuals have attracted a lot of attention in the last years, in particular in relation with living systems. These systems are quadratic, written under the form of transport equations…

We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest…

The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches,…

We disclose a new class of patterns, called patched patterns, in arrays of non-locally coupled excitable units with attractive and repulsive interactions. Self-organization process involves formation of two types of patches, majority and…

Cascading failures triggered by trivial initial events are encountered in many complex systems. It is the interaction and coupling between components of the system that causes cascading failures. We propose a simple model to simulate…

Small-world networks provide an interesting framework for studying the interplay between regular and random graphs, where links are located in a regular and random way, respectively. On one hand, the random links make the model to obey some…

One reports computational study revealing a set of general requirements, fulfilling of which would allow employing changes in ambient conditions to regulate accomplishing the collective outcome of emerging active network patterns in an…

Measuring the similarity between patches in images is a fundamental building block in various tasks. Naturally, the patch-size has a major impact on the matching quality, and on the consequent application performance. Under the assumption…

We introduce an algorithm to generate (not solve) spin-glass instances with planted solutions of arbitrary size and structure. First, a set of small problem patches with open boundaries is solved either exactly or with a heuristic, and then…

We prove the existence of solutions of a cross-diffusion parabolic population problem. The system of partial differential equations is deduced as the limit equations satisfied by the densities corresponding to an interacting particles…

Many major works in social science employ matching to make causal conclusions, but different matches on the same data may produce different treatment effect estimates, even when they achieve similar balance or minimize the same loss…

Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this…

Network alignment generalizes and unifies several approaches for forming a matching or alignment between the vertices of two graphs. We study a mathematical programming framework for network alignment problem and a sparse variation of it…

Reconstructing the structural connectivity between interacting units from observed activity is a challenge across many different disciplines. The fundamental first step is to establish whether or to what extent the interactions between the…

We reinvestigate the validity of mapping the problem of two onsite interacting particles in a random potential onto an effective random matrix model. To this end we first study numerically how the non-interacting basis is coupled by the…