Related papers: Two-sided infinite-bin models and analyticity for …
The theoretical models providing mathematical abstractions for several significant optimization problems in machine learning, combinatorial optimization, computer vision and statistical physics have intrinsic similarities. We propose a…
In 1905, Einstein's theory of Brownian motion supported the molecular basis of the diffusion equation and introduced two complementary viewpoints: a deterministic field description and a probabilistic formulation based on stochastic…
Dense subgraph search in bipartite graphs is a fundamental problem in graph analysis, with wide-ranging applications in fraud detection, recommendation systems, and social network analysis. The recently proposed $(\alpha, \beta)$-dense…
In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined…
In this work we study a kinetic model of active particles with delayed dynamics, and its limit when the number of particles goes to infinity. This limit turns out to be related to delayed differential equations with random initial…
We propose a mean-field model of intermittent particle transport, where a particle may be in one of two phases: the first is an active (ballistic) phase, when a particle runs with constant velocity in some direction, and the second is a…
We consider the motion of an underdamped Brownian particle in a tilted periodic potential in a wide temperature range. Based on the previous data [1] and the new simulation results we show that the underdamped motion of particles in…
The Invasion Model on the complete bibartitle graph was introduced and studied by physicists as a rudimentary model for opinion dynamics on complex networks. We identify the limit of the Quasistationary distribution for the model as one…
The classical Bakry-\'Emery calculus is extended to study, for degenerated (non-elliptic, non-reversible, or non-diffusive) Markov processes, questions such as hypoellipticity, hypocoercivity, functional inequalities or Wasserstein…
We will introduce a new method to derive the orbital elements of the spectroscopic binary stars. Fitting the adopted radial velocity curves on the measured experimental data, the corresponding radial acceleration data are obtained. The…
Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been investigated. The idea of partial edge drawings (PED) is to drop the middle part of edges and rely on the remaining edge parts called stubs.…
Given a finite connected graph $G$, place a bin at each vertex. Two bins are called a pair if they share an edge of $G$. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with…
This article connects the theory of extremal doubly stochastic measures to the geometry and topology of optimal transportation. We begin by reviewing an old question (# 111) of Birkhoff in probability and statistics [4], which is to give a…
A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…
In the last decade, copositive formulations have been proposed for a variety of combinatorial optimization problems, for example the stability number (independence number). In this paper, we generalize this approach to infinite graphs and…
We investigate wavefront solutions in a nonlinear system of two coupled reaction-diffusion equations with degenerate diffusivity: \[n_t = n_{xx} - nb, \quad b_t = [D nbb_x]_x + nb,\] where $t\geq0,$ $x\in\mathbb{R}$, and $D$ is a positive…
The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph $G$. We consider two optimization problems of adding $k$ new edges to $G$ such that the resulting graph has minimal total effective…
We introduce a four-parameter family of interacting particle systems on the line which can be diagonalized explicitly via a complete set of Bethe ansatz eigenfunctions, and which enjoy certain Markov dualities. Using this, for the systems…
We consider a tandem queue with coupled processors, which is subject to global breakdowns. When the network is in the operating mode and both queues are non empty, the total service capacity is shared among the stations according to fixed…
Biharmonic distance (\bd) is a powerful graph distance metric with many applications, including identifying critical links in road networks and mitigating over-squashing problem in \gnn. However, computing \bd\ is extremely difficult,…