Related papers: Cutoffs for exclusion processes on graphs with ope…
For a fixed finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION problem asks, given an $n$-vertex input graph $G,$ for the minimum number of vertices that intersect all minor models in $G$ of the graphs in ${\cal F}$. by…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
We consider the contact process on finite and connected graphs and study the behavior of the extinction time, that is, the amount of time that it takes for the infection to disappear in the process started from full occupancy. We prove,…
The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible…
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…
This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…
We study the asymptotic Dirichlet problem for $f$-minimal graphs in Cartan-Hadamard manifolds $M$. $f$-minimal hypersurfaces are natural generalizations of self-shrinkers which play a crucial role in the study of mean curvature flow. In the…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…
We consider discrete sine-Gordon equation on branched domains. The latter is modeled in terms of the metric graphs with discrete bonds having the form of the branched 1D chains. Exact analytical solutions of the problem are obtained for…
We propose a misanthrope process, defined on a ring, which realizes the totally asymmetric simple exclusion process with open boundaries. In the misanthrope process, particles have no exclusion interactions in contrast to those in the…
A major step in the graph minors theory of Robertson and Seymour is the transition from the Grid Theorem which, in some sense uniquely, describes areas of large treewidth within a graph, to a notion of local flatness of these areas in form…
In this paper, we study the mixing time of the simple exclusion process with $k$ particles in the line segment $[1, N]$ with conductances $c^{(N)}(x, x+1)_{1\le x<N}$ where $c^{(N)}(x, x+1)>0$ is the rate of swapping the contents of the two…
We show that the joint probability generating function of the stationary measure of a finite state asymmetric exclusion process with open boundaries can be expressed in terms of joint moments of Markov processes called quadratic harnesses.…
We study the symmetric simple exclusion process in two or higher dimensions. We prove the invariance principles for the occupation time when the process starts from nonequilibrium measures. Our proof combines the martingale method and…
Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…
We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine…