Related papers: Two-sided infinite-bin models and analyticity for …
We show that the introduction of two worldline parameters defines a different approach to computations in the effective field theory approach to the two-body problem in General Relativity and present some preliminary evidence for a…
We give an algorithm that decides whether the bipartite crossing number of a given graph is at most $k$. The running time of the algorithm is upper bounded by $2^{O(k)} + n^{O(1)}$, where $n$ is the number of vertices of the input graph,…
Erd\H{o}s introduced the noncommuting graph, in order to study the number of commuting elements in a finite group. Despite the use of combinatorial ideas, his methods involved several techniques of classical analysis. The interest for this…
In this paper, we study some parameter-dependent reaction-diffusion models governed by the Born-Infeld (or Minkowski) operator. In dependence on two parameters $a, b > 0$, related to the field strength and to the diffusivity, we investigate…
Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. The commonly used graph-based benchmark model R-MAT has some drawbacks…
We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…
We show the existence of traveling front solutions in a diffusive classical SIS epidemic model and the SIS model with a saturating incidence in the size of the susceptible population. We investigate the situation where both susceptible and…
We consider a class of stochastic growth models on the integer lattice which includes various interesting examples such as the number of open paths in oriented percolation and the binary contact path process. Under some mild assumptions, we…
A major difficulty in studying the Bak-Sneppen model is in effectively comparing it with well-understood models. This stems from the use of two geometries: complete graph geometry to locate the global fitness minimizer, and graph geometry…
Predicting extreme events in nonlinear dynamical systems is challenging due to a limited understanding of their statistical properties. This study numerically and theoretically investigates the statistical properties of infinite-modal maps…
The classic technique of Baker [J. ACM '94] is the most fundamental approach for designing approximation schemes on planar, or more generally topologically-constrained graphs, and it has been applied in a myriad of different variants and…
The Price model, the directed version of the Barab\'{a}si-Albert model, produces a growing directed acyclic graph. We look at variants of the model in which directed edges are added to the new vertex in one of two ways: using cumulative…
We consider the class of stationary-increment harmonizable stable processes with infinite control measure, which most notably includes real harmonizable fractional stable motions. We give conditions for the integrability of the paths of…
New algorithms for construction of asymptotic expansions for stationary distributions of nonlinearly perturbed semi-Markov processes with finite phase spaces are presented. These algorithms are based on a special technique of sequential…
The East model is a one-dimensional, non-attractive interacting particle system with Glauber dynamics, in which a flip is prohibited at a site $x$ if the right neighbour $x+1$ is occupied. Starting from a configuration entirely occupied on…
The diffusion in two dimensions of non-interacting active particles that follow an arbitrary motility pattern is considered for analysis. Accordingly, the transport equation is generalized to take into account an arbitrary distribution of…
We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed…
We consider the distribution of free path lengths, or the distance between consecutive bounces of random particles, in an n-dimensional rectangular box. If each particle travels a distance R, then, as R tends to infinity the free path…
We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…
The asymptotic wave speed for FKPP type reaction-diffusion equations on a class of infinite random metric trees are considered. We show that a travelling wavefront emerges, provided that the reaction rate is large enough. The wavefront…