相关论文: Asymptotic Face Distributions in Random Reduced $\…

Let P be a random $d$-dimensional 0/1-polytope with $n(d)$ vertices, and denote by $\phi_k(P)$ the \emph{$k$-face density} of $P$, i.e., the quotient of the number of $k$-dimensional faces of $P$ and $\binom{n(d)}{k+1}$. For each $k\ge 2$,…

Exterior Dirichlet problems for two-dimensional lattice waves on the semi-infinite triangular lattice are considered. Namely, we study Dirichlet problems for the two-dimensional discrete Helmholtz equation in a plane with a hole. New…

A gas of self-avoiding surfaces with an arbitrary polynomial coupling to the gaussian curvature and an extrinsic curvature term can be realized in a three-dimensional Ising bcc lattice with only three local couplings. Similar three…

We give a new, short proof that graphs embeddable in a given Euler genus-$g$ surface admit a simple $f(g)$-round $\alpha$-approximation distributed algorithm for Minimum Dominating Set (MDS), where the approximation ratio $\alpha \le 906$.…

We prove Russo-Seymour-Welsh type crossing estimates for the FK-Ising model on general s-embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than $1$, provided a mild non-degeneracy assumption is satisfied.…

We consider the "all-for-one" decentralized learning problem for generalized linear models. The features of each sample are partitioned among several collaborating agents in a connected network, but only one agent observes the response…

Given a graph $G$ of degree $k$ over $n$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth $2L$, we develop a local message passing algorithm whose…

Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We…

We show that both aspect ratios of randomly oriented triaxial ellipsoids (representing isosurfaces of an isotropic 3D random field) can be determined from a single 2D cross-section of their sample using the probability distribution of the…

We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear when the number n of edges goes to infinity. The main…

Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$…

We consider time-dependent convection-diffusion problems with high P\'eclet number of order $\mathcal{O}(\varepsilon^{-1})$ in thin three-dimensional graph-like networks consisting of cylinders that are interconnected by small domains…

Given connected graph $H$ which is not a star, we show that the number of copies of $H$ in a dense uniformly random regular graph is asymptotically Gaussian, which was not known even for $H$ being a triangle. This addresses a question of…

We study the local asymptotic normality (LAN) property for the likelihood function associated with discretely observed $d$-dimensional McKean-Vlasov stochastic differential equations over a fixed time interval. The model involves a joint…

We delve into the statistical properties of regions within complex networks that are distant from vertices with high centralities, such as hubs or highly connected clusters. These remote regions play a pivotal role in shaping the asymptotic…

In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.

We derive an explicit formula for the fundamental solution $K_{T_{q+1}}(x,x_{0};t)$ to the discrete-time diffusion equation on the $(q+1)$-regular tree $T_{q+1}$ in terms of the discrete $I$-Bessel function. We then use the formula to…

The attempt to solve inverse scattering problems often leads to optimization and sampling problems that require handling moderate to large amounts of partial differential equations acting as constraints. We focus here on determining…

This work is motivated by problems on simultaneous Diophantine approximation on manifolds, namely, establishing Khintchine and Jarnik type theorems for submanifolds of R^n. These problems have attracted a lot of interest since Kleinbock and…

We study a majority based preference diffusion model in which the members of a social network update their preferences based on those of their connections. Consider an undirected graph where each node has a strict linear order over a set of…