Related papers: Weak uniform structures on probability distributio…
Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We…
Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures…
Quite recently, a new property related to norm-attaining operators has been introduced: the weak maximizing property (WMP). In this note, we define a generalised version of it considering other topologies than the weak one (mainly the…
The fundamental model of a periodic structure is a periodic point set up to rigid motion or isometry. Our recent paper in SoCG 2021 defined isometry invariants (density functions), which are complete in general position and continuous under…
Methods from statistical physics, such as those involving complex networks, have been increasingly used in quantitative analysis of linguistic phenomena. In this paper, we represented pieces of text with different levels of simplification…
This paper investigates the consensus problem in almost sure sense for uncertain multi-agent systems with noises and fixed topology. By combining the tools of stochastic analysis, algebraic graph theory, and matrix theory, we analyze the…
In this paper, we introduce a new class of optimization problems whose objective functions are weakly homogeneous relative to the constraint sets. By using the normalization argument in asymptotic analysis, we prove two criteria for the…
We define and study asymptotically symmetric Banach spaces (a.s.) and its variations: weakly a.s. (w.a.s.) and weakly normalized a.s. (w.n.a.s.). If X is a.s. then all spreading models of X are uniformly symmetric. We show that the converse…
Long lived topological features are distinguished from short lived ones (considered as topological noise) in simplicial complexes constructed from complex networks. A new topological invariant, persistent homology, is determined and…
We provide an asymptotic analysis of linear transport problems in the diffusion limit under minimal regularity assumptions on the domain, the coefficients, and the data. The weak form of the limit equation is derived and the convergence of…
Diagrammatic sets admit a notion of internal equivalence in the sense of coinductive weak invertibility, with similar properties to its analogue in strict $\omega$-categories. We construct a model structure whose fibrant objects are…
In this work, water distribution systems are regarded as large sparse planar graphs with complex network characteristics and the relationship between important topological features of the network (i.e. structural robustness and loop…
A generalization of incidence relations in abstract polytope has been explored, and parameterized surfaces are used as primers. The abstract orientable incidence structure is defined as an algebraic model of incidence relations, in which…
It has been shown that many complex networks shared distinctive features, which differ in many ways from the random and the regular networks. Although these features capture important characteristics of complex networks, their applicability…
We study the joint asymptotics of forward and backward processes of numbers of non-empty urns in an infinite urn scheme. The probabilities of balls hitting the urns are assumed to satisfy the conditions of regular decrease. We prove weak…
Networked dynamical systems are common throughout science in engineering; e.g., biological networks, reaction networks, power systems, and the like. For many such systems, nonlinearity drives populations of identical (or near-identical)…
We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the…
Some asymptotic notions for random variables are discussed. In particular, different versions of O and o for sequences of random variables are studied. The results are elementary and more or less well-known, but collected here for future…
For any abelian group $A$, we prove an asymptotic formula for the number of $A$-extensions $K/\mathbb{Q}$ of bounded discriminant such that the associated norm one torus $R_{K/\mathbb{Q}}^1 \mathbb{G}_m$ satisfies weak approximation. We are…
We consider a set $\mbK = \bigcup_{n \in \mbbN}\mbK_n$ of {\em finite} structures such that all members of $\mbK_n$ have the same universe, the cardinality of which approaches $\infty$ as $n\to\infty$. Each structure in $\mbK$ may have a…