相关论文: The moving particle lemma for the exclusion proces…

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…

Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For $n$-vertex and $m$-edge graphs, the best known algorithms run in…

We show that for any constant $\Delta \ge 2$, there exists a graph $G$ with $O(n^{\Delta / 2})$ vertices which contains every $n$-vertex graph with maximum degree $\Delta$ as an induced subgraph. For odd $\Delta$ this significantly improves…

Juggler's exclusion process describes a system of particles on the positive integers where particles drift down to zero at unit speed. After a particle hits zero, it jumps into a randomly chosen unoccupied site. We model the system as a…

We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of…

We define a family of asymmetric processes for particles on a one-dimensional lattice, depending on a continuous parameter $\lambda \in [0,1] $, interpolating between the completely asymmetric processes [1] (for $\lambda =1$) and the n=1…

We present an O(n^3 log^2 n)-time algorithm for the following problem: given a finite metric space X, create a star-topology network with the points of X as its leaves, such that the distances in the star are at least as large as in X, with…

The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described more naturally (and sometimes proved more easily) in…

We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…

Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…

We obtain the Phragm\`en-Lindel\"of principle on combinatorial infinite weighted graphs for the Cauchy problem associated to a certain class of parabolic equations with a variable density. We show that the hypothesis made on the density is…

For $t,g>0$, a vertex-weighted graph of total weight $W$ is $(t,g)$-trimmable if it contains a vertex-induced subgraph of total weight at least $(1-1/t)W$ and with no simple path of more than $g$ edges. A family of graphs is trimmable if…

We give a straightforward and divergence free derivation of the equation of motion for a small but finite object in an arbitrary background using strong field point particle limit. The resulting equation becomes a generalized geodesic for a…

A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…

In this paper, we address the numerical solution of the Optimal Transport Problem on undirected weighted graphs, taking the shortest path distance as transport cost. The optimal solution is obtained from the long-time limit of the gradient…

In our previous article [4] an approach to derive Papapetrou equations for constrained electromagnetic field was demonstrated by use of field variational principles. The aim of current work is to present more universal technique of…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

We present an approach to reduced-order modelling that builds off recent graph-theoretic work for representation, exploration, and analysis of computed states of physical systems (Banerjee et al., Comp. Meth. App. Mech. Eng., 351, 501-530,…

Starting from a unit mass on a vertex of a graph, we investigate the minimum number of "\emph{controlled diffusion}" steps needed to transport a constant mass $p$ outside of the ball of radius $n$. In a step of a controlled diffusion…

This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…