相关论文: Betti numbers in the Random Connection Model for h…

Network science is a powerful framework allowing to model complex systems, it is capable to describe and take into account the intricate web of connections existing among the constituting basic element of the system. Recently scholars have…

Boolean networks are a valuable class of discrete dynamical systems models, but they remain fundamentally limited by their inability to capture multi-way interactions in their components. To remedy this limitation, we propose a model of…

It has been shown \citep{broeck90:physicalreview,patarnello87:europhys} that feedforward Boolean networks can learn to perform specific simple tasks and generalize well if only a subset of the learning examples is provided for learning.…

This review explains in a self-contained way the properties of random Boolean networks and their attractors, with a special focus on critical networks. Using small example networks, analytical calculations, phenomenological arguments, and…

We establish a central limit theorem for the sum of $\epsilon$-independent random variables, extending both the classical and free probability setting. Central to our approach is the use of graphon limits to characterize the limiting…

General Central limit theorem deals with weak limits (in type) of sums of row-elements of array random variables. In some situations as in the invariance principle problem, the sums may include only parts of the row-elements. For strictly…

We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…

We investigate the generalizability of learned binary relations: functions that map pairs of instances to a logical indicator. This problem has application in numerous areas of machine learning, such as ranking, entity resolution and link…

Suppose $B_i:= B(p,r_i)$ are nested balls of radius $r_i$ about a point $p$ in a dynamical system $(T,X,\mu)$. The question of whether $T^i x\in B_i$ infinitely often (i. o.) for $\mu$ a.e.\ $x$ is often called the shrinking target problem.…

We consider the line graph of a pure simplicial complex. We prove that, as in the case of line graphs of simple graphs, one can compute the second graded Betti number of the facet ideal of a pure simplicial complex in terms of the…

Theoretical analyses for graph learning methods often assume a complete observation of the input graph. Such an assumption might not be useful for handling any-size graphs due to the scalability issues in practice. In this work, we develop…

Simplicial complexes capture the underlying network topology and geometry of complex systems ranging from the brain to social networks. Here we show that algebraic topology is a fundamental tool to capture the higher-order dynamics of…

If $M$ is the complement of a hyperplane arrangement, and $A=H^*(M,\k)$ is the cohomology ring of $M$ over a field of characteristic 0, then the ranks, $\phi_k$, of the lower central series quotients of $\pi_1(M)$ can be computed from the…

In this paper, we develop necessary and sufficient conditions for the validity of a martingale approximation for the partial sums of a stationary process in terms of the maximum of consecutive errors. Such an approximation is useful for…

Preferential attachment is a widely adopted paradigm for understanding the dynamics of social networks. Formal statistical inference,for instance GLM techniques, and model verification methods will require knowing test statistics are…

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…

Complex systems are often modeled as Boolean networks in attempts to capture their logical structure and reveal its dynamical consequences. Approximating the dynamics of continuous variables by discrete values and Boolean logic gates may,…

Since the appearance of H. Robbins article (1948), the central limit theorems for random sums have been studied for about 70 years. The central limit theorems for random sums of independent random variables play a very important role in…

Consider a sequence of Poisson random connection models (X_n,lambda_n,g_n) on R^d, where lambda_n / n^d \to lambda > 0 and g_n(x) = g(nx) for some non-increasing, integrable connection function g. Let I_n(g) be the number of isolated…