activity
20192025
most citedCounterexample: scale-free networked graphs with invariable diameter and density feature

20 citations · 70 across the 17 of their papers we have counts for

collaborators

17 papers

cs.SI2025

Random walks with resetting on hypergraph

Fei Ma, Xincheng Hu, Haobin Shi +2

Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study rando…

physics.soc-ph2023

Type-II Apollonian Model

Fei Ma, Jinzhi Ouyang, Ping Wang +2

The family of planar graphs is a particularly important family and models many real-world networks. In this paper, we propose a principled framework based on the widely-known Apoll…

cs.CR2021★ 4 cited

Randomized Response Mechanisms for Differential Privacy Data Analysis: Bounds and Applications

Fei Ma, Ping Wang

Randomized response, as a basic building-block for differentially private mechanism, has given rise to great interest and found various potential applications in science communitie…

cs.CR2021

OPTT: Optimal Piecewise Transformation Technique for Analyzing Numerical Data under Local Differential Privacy

Fei Ma, Renbo Zhu, Ping Wang

Privacy preserving data analysis (PPDA) has received increasing attention due to a great variety of applications. Local differential privacy (LDP), as an emerging standard that is…

math.CO2021

Mean Hitting Time on Recursive Growth Tree Network

Fei Ma, Ping Wang

In this paper, we are concerned with mean hitting time for random walks on recursive growth tree networks that are built based on an arbitrary tree as t…

math.CO2021★ 3 cited

Scale-free tree network with an ultra-large diameter

Fei Ma, Ping Wang

Scale-free networks are prevalently observed in a great variety of complex systems, which triggers various researches relevant to networked models of such type. In this work, we pr…