Related papers: Explosive dismantling of two-dimensional random la…
We study a large class of Bernoulli percolation models on random lattices of the half- plane, obtained as local limits of uniform planar triangulations or quadrangulations. We first compute the exact value of the site percolation threshold…
We define the model of two-dimensional random interlacements using simple random walk trajectories conditioned on never hitting the origin, and then obtain some properties of this model. Also, for random walk on a large torus conditioned on…
We study the high-dimensional properties of an invading front in a disordered medium with random pinning forces. We concentrate on interfaces described by bounded slope models belonging to the quenched KPZ universality class. We find a…
Deep neural networks (DNNs) have gained prominence in various applications, such as classification, recognition, and prediction, prompting increased scrutiny of their properties. A fundamental attribute of traditional DNNs is their…
The study of interdependent networks, and in particular the robustness on networks, has attracted considerable attention. Recent studies mainly assume that the dependence is fully interdependent. However, targeted attack for partially…
In this work, we present a new algorithm to approximate the percolation centrality of every node in a graph. Such a centrality measure quantifies the importance of the vertices in a network during a contagious process. In this paper, we…
We model the isotropic depinning transition of a domain-wall using a two dimensional Ginzburg-Landau scalar field instead of a directed elastic string in a random media. An exact algorithm accurately targets both the critical depinning…
Explosive percolation (EP) has received significant research attention due to its rich and anomalous phenomena near criticality. In our recent study [Phys. Rev. Lett. 130, 147101 (2023)], we demonstrated that the correct critical behaviors…
Recent research on finding important intermediate nodes in a network suspected to contain criminal activity is highly dependent on network centrality values. Betweenness centrality, for example, is widely used to rank the nodes that act as…
Random planar graphs appear in a variety of context and it is important for many different applications to be able to characterize their structure. Local quantities fail to give interesting information and it seems that path-related…
A number of recent experimental measurements suggest the possibility of a breakdown of lepton ($\ell$) universality in exclusive $b \to c \ell \nu_\ell$ semileptonic meson decays. We analyze the full differential decay rates for several…
We study analytically the dynamics of two-dimensional rectangular lattices with periodic boundary conditions. We consider anisotropic initial data supported on one low-frequency Fourier mode. We show that, in the continuous approximation,…
We develop a mean-field theory of dropout as a perturbation of critical signal propagation at the edge of chaos. Dropout shifts the perfect-alignment fixed point, making the depth scale for information propagation finite even at critical…
We consider the transport of non-interacting electrons on two- and three-dimensional random Voronoi-Delaunay lattices. It was recently shown that these topologically disordered lattices feature strong disorder anticorrelations between the…
Betweenness centrality is essential in complex network analysis; it characterizes the importance of nodes and edges in networks. It is a crucial problem that exactly computes the betweenness centrality in large networks faster, which…
We study the transfer of adversarial robustness of deep neural networks between different perturbation types. While most work on adversarial examples has focused on $L_\infty$ and $L_2$-bounded perturbations, these do not capture all types…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
The site and bond percolation problems are conventionally studied on (hyper)cubic lattices, which afford straightforward numerical treatments. The recent implementation of efficient simulation algorithms for high-dimensional systems now…
Robustness and counterfactual bias are usually evaluated on a test dataset. However, are these evaluations robust? If the test dataset is perturbed slightly, will the evaluation results keep the same? In this paper, we propose a "double…
We study the tolerance of random networks to intentional attack, whereby a fraction p of the most connected sites is removed. We focus on scale-free networks, having connectivity distribution of P(k)~k^(-a) (where k is the site…