相关论文: Rapid mixing of the down-up walk on matchings of a…

We revisit the problem of estimates of moments of random n-dimensional matrices of Wigner ensemble by using the approach elaborated by Ya. Sinai and A. Soshnikov and further developed by A. Ruzmaikina. Our main subject is given by the…

How many adjacency matrix queries (also known as pair queries) are required to estimate the size of a maximum matching in an $n$-vertex graph $G$? We study this fundamental question in this paper. On the upper bound side, an algorithm of…

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

For two independent Erd\H{o}s-R\'enyi graphs $\mathbf G(n,p)$, we study the maximal overlap (i.e., the number of common edges) of these two graphs over all possible vertex correspondence. We present a polynomial-time algorithm which finds a…

In this paper we consider a class of one-dimensional interacting particle systems in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied/vacant sites has a local drift to the…

We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of the results of Kahn, Galvin and Tetali, and Zhao showing…

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

For any $\varepsilon > 0$, we give a polynomial-time $n^\varepsilon$-approximation algorithm for Max Independent Set in graphs of bounded twin-width given with an $O(1)$-sequence. This result is derived from the following time-approximation…

We study algorithms for estimating the size of maximum matching. This problem has been subject to extensive research. For $n$-vertex graphs, Bhattacharya, Kiss, and Saranurak [FOCS'23] (BKS) showed that an estimate that is within…

In this paper we present a new width measure for a tree decomposition, minor-matching hypertree width, $\mu\text{-}tw$, for graphs and hypergraphs, such that bounding the width guarantees that set of maximal independent sets has a…

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…

We introduce a notion called entropic independence that is an entropic analog of spectral notions of high-dimensional expansion. Informally, entropic independence of a background distribution $\mu$ on $k$-sized subsets of a ground set of…

We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices $\{u,v\}$ with distance $d>1$ is added as a "long-range" edge with probability…

We study the convergence rate of translation-invariant discrete-time quantum dynamics on a one-dimensional lattice. We prove that the cumulative distributions function of the ballistically scaled position $X(n)/{n}$ after $n$ steps…

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ is the maximum degree. The lower bound by Linial…

In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…

Let $(X_t, t \geq 0)$ be an $\alpha$-stable random walk with values in $\Z^d$. Let $l_t(x) = \int_0^t \delta_x(X_s) ds$ be its local time. For $p>1$, not necessarily integer, $I_t = \sum_x l_t^p(x)$ is the so-called $p$-fold self-…

Let $\mathcal{G}$ be an undirected graph with adjacency matrix $A$ and spectral radius $\rho$. Let $w_k, \phi_k$ and $\phi_k^{(i)}$ be, respectively, the number walks of length $k$, closed walks of length $k$ and closed walks starting and…

Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…